Cited by 99Quantum Computing Algorithms and ArchitectureQuantum many-body systemsQuantum Information and Cryptography

Limitations of Quantum Simulation Examined by Simulating a Pairing Hamiltonian Using Nuclear Magnetic Resonance

Open access
Brown, Kenneth R., Clark, Robert J., Chuang, Isaac L.·2006·Physical Review Letters

Abstract

Quantum simulation uses a well-known quantum system to predict the behavior of another quantum system. Certain limitations in this technique arise, however, when applied to specific problems, as we demonstrate with a theoretical and experimental study of an algorithm proposed by Wu, Byrd, and Lidar [Phys. Rev. Lett. 89, 057904 (2002).10.1103/PhysRevLett.89.057904] to find the low-lying spectrum of a pairing Hamiltonian. While the number of elementary quantum gates required scales polynomially with the size of the system, it increases inversely to the desired error bound E. Making such simulations robust to decoherence using fault tolerance requires an additional factor of approximately 1/E gates. These constraints, along with the effects of control errors, are illustrated using a three qubit NMR system.

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/physrevlett.97.050504

Cites

34 of 34 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?

  • When digital quantum simulation operates with fault-tolerant quantum error correction, its output can be trusted to a known finite precision.

    “When such a digital quantum simulation operates with fault-tolerant quantum error correction [63], we can trust its output to a known finite precision.”

    From Can one trust quantum simulators? (2012) · cites this paper as [63]

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: 7

  1. [11]Z. Chen, J. Yepez, and D. G. Cory (2004), the LANL preprint quant-ph/0410198. · arXiv
  2. [12]X.-D. Yang, A. M. Wang, F. Xu, and J. Du (2004), the LANL preprint quant-ph/0410143. · arXiv
  3. [15]R. Cleve, A. Ekert, C. Macchiavello and M. Mosca, Proc. Roy. Soc. London Ser. A 454 , 339 (1998).
  4. [17]J. Ketterson and S. Song, Superconductivity (Cambridge University Press, Cambridge, United Kingdom, 1999).
  5. [21]J. Preskill, Proc. Roy. Soc. London Ser. A 454 , 385 (1998).
  6. [25]H. Trotter, Pacific Journal of Math 8 , 887 (1958).
  7. [28]N. Khaneja, S. J. Glaser, and R. Brockett, Physical Review A 65:032301 (2002).

Cited by

Sorted by citations

Authors
Brown, K. R., Clark, R. J., & Chuang, I. L.
Affiliations
Massachusetts Institute of Technology (US)
Venue
Physical Review Letters
Published
2006-08-04
Volume
97
Issue
5
Pages
050504-050504
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W2025107850
Cited by
98
References
34
Citations by year
2026: 1 · 2025: 3 · 2024: 4 · 2022: 3 · 2021: 2 · 2019: 4 · 2018: 5 · 2017: 2 · 2016: 1 · 2015: 6 · 2014: 9 · 2013: 6 · 2012: 9
FWCI
6.47
Type
journal article
Language
en
Open access
Locations
  • Physical Review Letters (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
Keywords
quantum simulation, pairing Hamiltonian, NMR quantum computing, low-lying spectrum, fault tolerance, decoherence, control error, three-qubit systems

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