Cited by 1,019Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum Mechanics and Applications

Randomized benchmarking of quantum gates

Open access
Knill, E., Leibfried, D., Reichle, R., Britton, J., Blakestad, R. B., Jost, J. D., Langer, C., Ozeri, R. +2 more·2008·Physical Review A

Abstract

A key requirement for scalable quantum computing is that elementary quantum gates can be implemented with sufficiently low error. One method for determining the error behavior of a gate implementation is to perform process tomography. However, standard process tomography is limited by errors in state preparation, measurement and one-qubit gates. It suffers from inefficient scaling with number of qubits and does not detect adverse error-compounding when gates are composed in long sequences. An additional problem is due to the fact that desirable error probabilities for scalable quantum computing are of the order of 0.0001 or lower. Experimentally proving such low errors is challenging. We describe a randomized benchmarking method that yields estimates of the computationally relevant errors without relying on accurate state preparation and measurement. Since it involves long sequences of randomly chosen gates, it also verifies that error behavior is stable when used in long computations. We implemented randomized benchmarking on trapped atomic ion qubits, establishing a one-qubit error probability per randomized $\ensuremath{\pi}/2$ pulse of 0.00482(17) in a particular experiment. We expect this error probability to be readily improved with straightforward technical modifications.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physreva.77.012307

Cites

27 of 27 references verified0 citation errors · 0 not checkable

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The paper gives a full analysis of the scalable multi-qubit randomized benchmarking protocol for Clifford gates proposed in [25] which overcomes the shortcomings described above.

    “In this paper we give a full analysis of the scalable multi-qubit randomized benchmarking protocol for Clifford gates we proposed in [25] which overcomes the shortcomings described above.”

    From Characterizing quantum gates via randomized benchmarking (2012) · cites this paper as [25]

  • Gate-dependent errors can lead to a deviation from the exponential decay, defining a partial test for such effects in the noise.

    “The fitting formula shows that gatedependent errors can lead to a deviation from the exponential decay (defining a partial test for such effects in the noise), which was illustrated via numerical examples in [25].”

    From Characterizing quantum gates via randomized benchmarking (2012) · cites this paper as [25]

  • There exist physically relevant noise models for which, when the true value of the depolarization fidelity parameter p is used, the first-order model fits the experimental data much better than the zeroth-order model.

    “As depicted in [25] there exist physically relevant noise models for which when the true value of the depolarization fidelity parameter p is used, the first order model fits the experimental data much better than the zeroth order model.”

    From Characterizing quantum gates via randomized benchmarking (2012) · cites this paper as [25]

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 5

  1. [12]M. Riebe, M. Chwalla, J. Benhelm, H. Haeffner, W. Haensel, C. F. Roose, and R. Blatt (2007), arXiv:0704.2027 [quant-ph]. · arXiv
  2. [17]B. W. Reichardt (2004), quant-ph/0406025. · arXiv
  3. [21]F. Magniez, D. Mayers, M. Mosca, and H. Ollivier, in Proc. 33rd Int. Coll. Automata, Languages and Programming (ICALP'06) (2006), pp. 72-83, quant-ph/0512111. · arXiv
  4. [22]D. Gottesman (1998), quant-ph/9807006. · arXiv
  5. [25]D. J. Wineland, D. Leibfried, M. D. Barrett, A. Ben-kish, J. C. Bergquist, R. B. Blakestad, J. J. Bollinger, J. Britton, J. Chiaverini, B. Demarco, et al., in Int. Conf. on Laser Spectroscopy, Avemore, Scotland, 2005 , edited by H. A. Hinds, A. Ferguson, and E. Riis (World Scientific, Singapore, 2005),

Cited by

Sorted by citations

Authors
Knill, E., Leibfried, D., Reichle, R., Britton, J., Blakestad, R. B., Jost, J. D., Langer, C., Ozeri, R., Seidelin, S., & Wineland, D. J.
Affiliations
National Institute of Standards and Technology (US)
Venue
Physical Review A
Published
2008-01-08
Volume
77
Issue
1
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
OpenAlex
W2170620327
Cited by
1,019
References
27
Citations by year
2026: 67 · 2025: 118 · 2024: 99 · 2023: 122 · 2022: 85 · 2021: 121 · 2020: 94 · 2019: 70 · 2018: 41 · 2017: 39 · 2016: 43 · 2015: 31 · 2014: 25 · 2013: 16 · 2012: 12
FWCI
18.99
Type
journal article
Language
en
Open access
Locations
  • Physical Review A (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
  • APS
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
Keywords
randomized benchmarking, quantum gate errors, quantum computing scalability, state preparation and measurement errors

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