Southwest Quantum Information and Technology

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 gate 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 n-qubit experiments that minimize the total experiment time needed to achieve a fixed statistical uncertainty while taking into account the different time-costs of shots with different sequence lengths. We provide comparison to past randomized benchmarking experiments and demonstrate that improvements in signal-to-noise are possible. We also describe models of Clifford randomized benchmarking with possible time-dependent or gate-dependent errors and discuss strategies for choosing sequence lengths in this case.

(Session 5 : Thursday from 5:00 pm - 7:00 pm)