Easier randomizing gates provide more accurate fidelity estimation
Debankan Sannamoth, Kristine Boone, Arnaud Carignan-Dugas, Akel Hashim, Irfan Siddiqi, Karl Mayer, Joseph Emerson
TL;DR
This paper tackles the problem that interleaved benchmarking using multi-qubit Clifford randomization can yield highly biased or unphysical estimates of an interleaved gate’s fidelity in the presence of coherent errors. It introduces a theoretical framework to quantify systematic errors, uses unitarity-based XRB bounds to tighten these estimates, and demonstrates that cycle benchmarking with Pauli (or Local Clifford) randomization dramatically improves accuracy and data efficiency. The authors provide numerical simulations and experimental results across three platforms, showing substantial reductions in bias and enabling data reuse through CER-compatible analyses. The work has practical impact by guiding the choice of randomization groups for fast, reliable gate calibration and benchmarking in heterogeneous quantum hardware, with implications for scalable quantum computing calibration pipelines.
Abstract
Accurate benchmarking of quantum gates is crucial for understanding and enhancing the performance of quantum hardware. A standard method for this is interleaved benchmarking, a technique which estimates the error on an interleaved target gate by comparing cumulative error rates of randomized sequences implemented with the interleaved gate and without it. In this work, we show both numerically and experimentally that the standard approach of interleaved randomized benchmarking (IRB), which uses the multi-qubit Clifford group for randomization, can produce highly inaccurate and even physically impossible estimates for the error on the interleaved gate in the presence of coherent errors. Fortunately we also show that interleaved benchmarking performed with cycle benchmarking, which randomizes with single qubit Pauli gates, provides dramatically reduced systematic uncertainty relative to standard IRB, and further provides as host of additional benefits including data reusability. We support our conclusions with a theoretical framework for bounding systematic errors, extensive numerical results comparing a range of interleaved protocols under fixed resource costs, and experimental demonstrations on three quantum computing platforms.
