Complete randomized benchmarking protocol accounting for leakage errors
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
Randomized benchmarking allows one to efficiently and scalably characterize the average error of a unitary 2-design such as the Clifford group $\mathcal{C}$ on a physical candidate for quantum computation, as long as there are no noncomputational leakage levels in the system. We investigate the effect of leakage errors on randomized benchmarking induced from an additional level per physical qubit and provide a modified protocol that allows us to derive reliable estimates for the error per gate in their presence. We assess the variance of the sequence fidelity corresponding to the number of random sequences needed for valid fidelity estimation. Our protocol allows for gate-dependent error channels without being restricted to perturbations. We show that our protocol is compatible with interleaved randomized benchmarking and expand to benchmarking of arbitrary gates. This setting is relevant for superconducting transmon qubits, among other systems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Matrix Analysis and Applied Linear Algebra
Meyer, C. (2000) · doi:10.1137/1.9780898719512 · Cited by 3,565
Superconducting quantum circuits at the surface code threshold for fault tolerance
Barends, R., Kelly, J., Megrant, A., Veitia, A., Sank, D., Jeffrey, E., White, T. C., Mutus, J., Fowler, A. G., Campbell, B., et al. (2014) · Nature · doi:10.1038/nature13171 · Cited by 1,733
Randomized benchmarking of quantum gates
Knill, E., Leibfried, D., Reichle, R., Britton, J., Blakestad, R. B., Jost, J. D., Langer, C., Ozeri, R., Seidelin, S., & Wineland, D. J. (2008) · Physical Review A · doi:10.1103/physreva.77.012307 · Cited by 1,019
High-fidelity spin entanglement using optimal control
Dolde, F., Bergholm, V., Wang, Y., Jakobi, I., Naydenov, B., Pezzagna, S., Meijer, J., Jelezko, F., Neumann, P., Schulte-Herbrüggen, T., et al. (2014) · Nature Communications · doi:10.1038/ncomms4371 · Cited by 325
Randomized Benchmarking of Single-Qubit Gates in a 2D Array of Neutral-Atom Qubits
Xia, T., Lichtman, M., Maller, K., Carr, A. W., Piotrowicz, M. J., Isenhower, L., & Saffman, M. (2015) · Physical Review Letters · doi:10.1103/physrevlett.114.100503 · Cited by 249
Cited by
Measuring and Suppressing Quantum State Leakage in a Superconducting Qubit
Chen, Z., Kelly, J., Quintana, C., Barends, R., Campbell, B., Chen, Y., Chiaro, B., Dunsworth, A., Fowler, A. G., Lucero, E., et al. (2016) · Physical Review Letters · doi:10.1103/physrevlett.116.020501 · Cited by 264
Direct Randomized Benchmarking for Multiqubit Devices
Proctor, T. J., Carignan-Dugas, A., Rudinger, K., Nielsen, E., Blume-Kohout, R., & Young, K. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.030503 · Cited by 118
“Finally, the techniques of DRB can also be applied to extend and improve the full suite of RB methods [26, 27, 56, 65–73], and varied-sampling”
BackgroundMethodScalable Randomized Benchmarking of Quantum Computers Using Mirror Circuits
Proctor, T., Seritan, S., Rudinger, K., Nielsen, E., Blume-Kohout, R., & Young, K. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.150502 · Cited by 68
Efficient unitarity randomized benchmarking of few-qubit Clifford gates
Dirkse, B., Helsen, J., & Wehner, S. (2019) · Physical Review A · doi:10.1103/physreva.99.012315 · Cited by 20
“For standard RB, progress has been made in terms of understanding the fit model and relating the decay rate to a physically interpretable infidelity in the gate-dependent error model [39–41].”
BackgroundMeasuring error rates of mid-circuit measurements
Hothem, D., Hines, J., Baldwin, C., Gresh, D., Blume-Kohout, R., & Proctor, T. (2025) · Nature Communications · doi:10.1038/s41467-025-60923-x · Cited by 5
Metadata
- Authors
- Chasseur, T., & Wilhelm, F. K.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2015-10-30
- Volume
- 92
- Issue
- 4
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W1567452835
- Cited by
- 39
- References
- 5
- FWCI
- 3.75
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.