Scalable randomised benchmarking of non-Clifford gates
Open accessThe DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
Randomised benchmarking is a widely used experimental technique to characterise the average error of quantum operations. Benchmarking procedures that scale to enable the characterisation of n-qubit circuits rely on efficient procedures for manipulating those circuits and, as such, have been limited to subgroups of the Clifford group. However, universal quantum computers require additional, non-Clifford gates to approximate arbitrary unitary transformations. We define a scalable randomised benchmarking procedure over n-qubit unitary matrices that correspond to protected non-Clifford gates for a class of stabiliser codes. We present efficient methods for representing and composing group elements, sampling them uniformly and synthesising corresponding poly(n)-sized circuits. The procedure provides experimental access to two independent parameters that together characterise the average gate fidelity of a group element. A scalable procedure to determine the error of quantum operations has been developed by researchers in the United States. Andrew Cross and colleagues at the IBM T.J. Watson Research Center have expanded previously used protocols to a broader range of quantum circuits, thereby enabling error benchmarking for all common logical operations used in leading quantum computing protocols. The standard technique for error characterization in these devices is randomized benchmarking, which provides benefits such as insensitivity to measurement errors, but on the other hand only functions in a limited number of circumstances. In their theoretical study, the researchers demonstrate how randomized benchmarking approaches can be expanded to a much broader range of logical operations. The procedure can be readily implemented experimentally, and provides access to important experimental noise parameters in quantum computing.
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
Universal quantum computation with ideal Clifford gates and noisy ancillas
Bravyi, S., & Kitaev, A. (2005) · Physical Review A · doi:10.1103/physreva.71.022316 · Cited by 1,525 · cited 2×
“Because our procedure scales, in principle it allows efficient benchmarking of isolated non-Clifford gates as well as large sub-circuits for state distillation [18, 19] or repeat-until-success protocols [20].”
BackgroundMethodRandomized 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
Fault-Tolerant Quantum Computation with High Threshold in Two Dimensions
Raussendorf, R., & Harrington, J. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.190504 · Cited by 812
Stabilizer Codes and Quantum Error Correction
Gottesman, D. (1997) · arXiv · doi:10.48550/arxiv.quant-ph/9705052 · Cited by 753
Scalable noise estimation with random unitary operators
Emerson, J., Alicki, R., & Życzkowski, K. (2005) · Journal of Optics B: Quantum and Semiclassical Optics · doi:10.1088/1464-4266/7/10/021 · Cited by 502
Randomized Benchmarking of Multiqubit Gates
Gaebler, J. P., Meier, A. M., Tan, T. R., Bowler, R., Lin, Y., Hanneke, D., Jost, J. D., Home, J. P., Knill, E., Leibfried, D., et al. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.260503 · Cited by 127 · cited 2×
“RB over G2k – The benchmarking procedure we present here both generalizes [16] [30] and extends naturally to interleaving gates to estimate individual gate fidelities [8, 9].”
BackgroundMethod
Cited by
Noisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
Trapped-ion quantum computing: Progress and challenges
Bruzewicz, C. D., Chiaverini, J., McConnell, R., & Sage, J. M. (2019) · Applied Physics Reviews · doi:10.1063/1.5088164 · Cited by 1,483
Quantum information processing with superconducting circuits: a review
Wendin, G. (2017) · Reports on Progress in Physics · doi:10.1088/1361-6633/aa7e1a · Cited by 890
Quantum certification and benchmarking
Eisert, J., Hangleiter, D., Walk, N., Roth, I., Markham, D., Parekh, R., Chabaud, U., & Kashefi, E. (2020) · Nature Reviews Physics · doi:10.1038/s42254-020-0186-4 · Cited by 342
Quantum error correction and universal gate set operation on a binomial bosonic logical qubit
Hu, L., Ma, Y., Cai, W., Mu, X., Xu, Y., Wang, W., Wu, Y., Wang, H., Song, Y. P., Zou, C.-L., et al. (2019) · Nature Physics · doi:10.1038/s41567-018-0414-3 · Cited by 286
Metadata
- Authors
- Cross, A. W., Magesan, E., Bishop, L. S., Smolin, J. A., & Gambetta, J. M.
- Venue
- npj Quantum Information
- Published
- 2016-04-26
- Volume
- 2
- Issue
- 1
- ISSN
- 2056-6387 (ISSN-L)
- OpenAlex
- W2949178668
- Cited by
- 84
- References
- 6
- FWCI
- 7.19
- Type
- journal article
- Language
- en
- Open access
- gold
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Scalable randomised benchmarking of non-Clifford gates. https://app.cochat.ai/papers/10.1038/npjqi.2016.12
- The paper
- Cross, A. W., Magesan, E., Bishop, L. S., Smolin, J. A., & Gambetta, J. M. (2016). Scalable randomised benchmarking of non-Clifford gates. npj Quantum Information. https://doi.org/10.1038/npjqi.2016.12
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.