Abstracts

Choosing sequence lengths for single-shot-randomized Clifford benchmarking

Presenting Author: Alex Kwiatkowski, University of Colorado
Contributing Author(s): Scott Glancy, Emanuel Knill

We analyze randomized benchmarking of Clifford gates when a new random sequence is drawn for each single shot of the experiment, where a single shot consists of a state preparation followed by a gate sequence and then a measurement. We present calculations of Fisher-efficient choices of sequence lengths for a single-qubit experiment that minimize the total experiment time needed to achieve a fixed statistical uncertainty and take into account the different time-costs of shots with different sequence lengths. We also describe strategies for choosing sequence lengths that can help diagnose the presence of gate errors that are not constant throughout an experiment.

(Session 5 : Thursday from 12:00pm-2:00 pm)

 

SQuInT Chief Organizer
Akimasa Miyake, Associate Professor
amiyake@unm.edu

SQuInT Co-Organizer
Brian Smith, Associate Professor
bjsmith@uoregon.edu

SQuInT Local Organizers
Philip Blocher, Postdoc
Pablo Poggi, Research Assistant Professor
Tzula Propp, Postdoc
Jun Takahashi, Postdoc
Cunlu Zhou, Postdoc

SQuInT Founder
Ivan Deutsch, Regents' Professor, CQuIC Director
ideutsch@unm.edu

Tweet About SQuInT 2021!