The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Randomized benchmarking with confidence
Open accessAbstract
Randomized benchmarking is a promising tool for characterizing the noise in experimental implementations of quantum systems. In this paper, we prove that the estimates produced by randomized benchmarking (both standard and interleaved) for arbitrary Markovian noise sources are remarkably precise by showing that the variance due to sampling random gate sequences is small. We discuss how to choose experimental parameters, in particular the number and lengths of random sequences, in order to characterize average gate errors with rigorous confidence bounds. We also show that randomized benchmarking can be used to reliably characterize time-dependent Markovian noise (e.g., when noise is due to a magnetic field with fluctuating strength). Moreover, we identify a necessary property for time-dependent noise that is violated by some sources of non-Markovian noise, which provides a test for non-Markovianity.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424
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
General teleportation channel, singlet fraction, and quasidistillation
Horodecki, M., Horodecki, P., & Horodecki, R. (1999) · Physical Review A · doi:10.1103/physreva.60.1888 · Cited by 965
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
Characterizing quantum gates via randomized benchmarking
Magesan, E., Gambetta, J. M., & Emerson, J. (2012) · Physical Review A · doi:10.1103/physreva.85.042311 · Cited by 464
Direct Fidelity Estimation from Few Pauli Measurements
Flammia, S. T., & Liu, Y.-K. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.230501 · Cited by 449
Self-citationAn analysis of completely-positive trace-preserving maps on M2
Beth Ruskai, M., Szarek, S., & Werner, E. (2002) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(01)00547-x · Cited by 366
A trace inequality of John von Neumann
Mirsky, L. (1975) · Monatshefte für Mathematik · doi:10.1007/bf01647331 · Cited by 343 · cited 2×
“By Von Neumann’s trace inequality [37],”
Wolf, M. M., & Cirac, J. I. (2008) · Communications in Mathematical Physics · doi:10.1007/s00220-008-0411-y · Cited by 288
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 by
Quantum internet: a vision for the road ahead
Wehner, S., Elkouss, D., & Hanson, R. (2018) · Science · doi:10.1126/science.aam9288 · Cited by 2,467
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
Noise tailoring for scalable quantum computation via randomized compiling
Wallman, J. J., & Emerson, J. (2016) · Physical Review A · doi:10.1103/physreva.94.052325 · Cited by 535
Self-citationBlume-Kohout, R., Gamble, J. K., Nielsen, E., Rudinger, K., Mizrahi, J., Fortier, K., & Maunz, P. (2017) · Nature Communications · doi:10.1038/ncomms14485 · Cited by 401
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
Metadata
- Authors
- Wallman, J. J., & Flammia, S. T.
- Venue
- New Journal of Physics
- Publisher
- IOP Publishing
- Published
- 2014-10-20
- Volume
- 16
- Issue
- 10
- Pages
- 103032
- ISSN
- 1367-2630 (ISSN-L)
- OpenAlex
- W2019630194
- Cited by
- 164
- References
- 10
- FWCI
- 10.89
- 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: Randomized benchmarking with confidence. https://app.cochat.ai/papers/10.1088/1367-2630/16/10/103032
- The paper
- Wallman, J. J., & Flammia, S. T. (2014). Randomized benchmarking with confidence. New Journal of Physics. https://doi.org/10.1088/1367-2630/16/10/103032
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.