An algorithmic benchmark for quantum information processing
The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Abstract
Quantum information processing offers potentially great advantages over classical information processing, both for efficient algorithms and for secure communication. Therefore, it is important to establish that scalable control of a large number of quantum bits (qubits) can be achieved in practice. There are a rapidly growing number of proposed device technologies for quantum information processing. Of these technologies, those exploiting nuclear magnetic resonance (NMR) have been the first to demonstrate non-trivial quantum algorithms with small numbers of qubits. To compare different physical realizations of quantum information processors, it is necessary to establish benchmark experiments that are independent of the underlying physical system, and that demonstrate reliable and coherent control of a reasonable number of qubits. Here we report an experimental realization of an algorithmic benchmark using an NMR technique that involves coherent manipulation of seven qubits. Moreover, our experimental procedure can be used as a reliable and efficient method for creating a standard pseudopure state, the first step for implementing traditional quantum algorithms in liquid state NMR systems. The benchmark and the techniques can be adapted for use with other proposed quantum devices.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“However, in the few cases where experiments with two quantum bits (qubits) have been performed, the EPGs currently achieved are much higher, 3 × 10 -2 or more in ion traps 11, 12 and liquid-state NMR. 13, 14”
From Quantum computing with realistically noisy devices (2005) · cites this paper as [13]
Citations
Cites
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Quantum computation with quantum dots
Loss, D., & DiVincenzo, D. P. (1998) · Physical Review A · doi:10.1103/physreva.57.120 · Cited by 6,840
Elementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311
A silicon-based nuclear spin quantum computer
Kane, B. E. (1998) · Nature · doi:10.1038/30156 · Cited by 3,779
Quantum Computations with Cold Trapped Ions
Cirac, J. I., & Zoller, P. (1995) · Physical Review Letters · doi:10.1103/physrevlett.74.4091 · Cited by 3,733
Experimental quantum cryptography
Bennett, C. H., Bessette, F., Brassard, G., Salvail, L., & Smolin, J. (1992) · Journal of Cryptology · doi:10.1007/bf00191318 · Cited by 1,614
Bulk Spin-Resonance Quantum Computation
Gershenfeld, N. A., & Chuang, I. L. (1997) · Science · doi:10.1126/science.275.5298.350 · Cited by 1,528
Wiesner, S. (1983) · ACM SIGACT News · doi:10.1145/1008908.1008920 · Cited by 1,520
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424 · cited 1×
“This is a critical issue for scalable quantum information processing, as robustness requires that each operation has a maximum error below some threshol”
BackgroundOn the Power of Quantum Computation
Simon, D. R. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796298637 · Cited by 1,295
Research works printed but not linked: 3
- Shor, P. W. in Proc. Symp. Foundations of Computer Science 56–65 (IEEE, Los Alamitos, California, 1996).
- Aharonov, D. & Ben-Or, M. in Proc. 29th Ann. ACM Symp. Theory of Computing 176–188 (Association for Computing Machinery, New York, 1996).
- Emsley, L. & Pines, A. in Proc. Int. School of Physics, Enrico Fermi Vol. CXXIII, 123–266 (North-Holland, Amsterdam, 1994).
Cited by
Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
Vandersypen, L. M. K., Steffen, M., Breyta, G., Yannoni, C. S., Sherwood, M. H., & Chuang, I. L. (2001) · Nature · doi:10.1038/414883a · Cited by 1,738
“In comparison with earlier work [8, 9, 10], this experiment thus puts extraordinarily high demands on the spin-spin coupling network, the degree of control over the Hamiltonian and the spin coherence times.”
BackgroundResultNMR techniques for quantum control and computation
Vandersypen, L. M. K., & Chuang, I. L. (2005) · Reviews of Modern Physics · doi:10.1103/revmodphys.76.1037 · Cited by 1,217
“More recently, over the past seven years, a wide variety of complex quantum information processing tasks have been realized using NMR, on systems ranging from two to seven quantum bits (qubits) in size, on molecules in liquid (11; 12; 13; 14; 15; 16), liquid crystal (17), and solid state samples (18; 19).”
BackgroundMethodInfluentialQuantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184
Self-citationCreation of a six-atom ‘Schrödinger cat’ state
Leibfried, D., Knill, E., Seidelin, S., Britton, J., Blakestad, R. B., Chiaverini, J., Hume, D. B., Itano, W. M., Jost, J. D., Langer, C., et al. (2005) · Nature · doi:10.1038/nature04251 · Cited by 805
Self-citationEfficient Z gates for quantum computing
McKay, D. C., Wood, C. J., Sheldon, S., Chow, J. M., & Gambetta, J. M. (2017) · Physical Review A · doi:10.1103/physreva.96.022330 · Cited by 557
“VirtualZ (VZ) gates have long been used in quantum experiments such as in NMR [3], ions [4], and superconducting qubits [5].”
Method
Metadata
- Authors
- Knill, E., Laflamme, R., Martinez, R., & Tseng, C.-H.
- Affiliations
- Los Alamos National Laboratory (US)
- Massachusetts Institute of Technology (US)
- Corresponding author
- Knill, E.
- Venue
- Nature
- Published
- 2000-03
- Volume
- 404
- Issue
- 6776
- Pages
- 368-370
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- OpenAlex
- W2019198372
- Cited by
- 290
- References
- 30
- Citations by year
- 2026: 3 · 2025: 5 · 2024: 5 · 2023: 33 · 2022: 13 · 2021: 8 · 2020: 6 · 2019: 5 · 2018: 4 · 2017: 7 · 2016: 12 · 2015: 11 · 2014: 2 · 2013: 5 · 2012: 10
- FWCI
- 28.12
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Nature (publishedVersion)
- PubMed (publishedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- Funders
- Deutsche Forschungsgemeinschaft
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- quantum information processing, nuclear magnetic resonance, liquid-state NMR, qubit control, coherent control, quantum algorithms
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.