CoChat
Sign Up
Cited by 51Quantum Computing Algorithms and ArchitectureQuantum many-body systemsQuantum Information and Cryptography

Resource requirements for fault-tolerant quantum simulation: The ground state of the transverse Ising model

Open access
Clark, Craig R., Metodi, Tzvetan S., Gasster, Samuel D., Brown, Kenneth R.·2009·Physical Review A
DOI 10.1103/physreva.79.062314
Open this paper in CoChat — free accountOpen PDF

Abstract

We estimate the resource requirements, the total number of physical qubits and computational time, required to compute the ground-state energy of a one-dimensional quantum transverse Ising model (TIM) of $N$ spin-1/2 particles, as a function of the system size and the numerical precision. This estimate is based on analyzing the impact of fault-tolerant quantum error correction in the context of the quantum logic array architecture. Our results show that a significant amount of error correction is required to implement the TIM problem due to the exponential scaling of the computational time with the desired precision of the energy. Comparison of our results to the resource requirements for a fault-tolerant implementation of Shor's quantum factoring algorithm reveals that the required logical qubit reliability is similar for both the TIM problem and the factoring problem.

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.79.062314

Cites

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

  • In the presence of errors, ensuring reliability to a desired precision has profound implications for efficiency even in a digital simulator on a fault-tolerant quantum computer.

    “In the presence of errors, however, ensuring reliability to a desired precision has profound implications for efficiency even in a digital simulator on a fault-tolerant quantum computer [64, 117].”

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

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

  1. [1]R. Feynman, International Journal of Theoretical Physics 21 , 467 (1982).
  2. [5]C. Zalka, Proc. R. Soc. Lond. A 454 , 313 (1998).
  3. [7]I. Kassal, S. P. Jordan, P. J. Love, M. Mohseni, and A. Aspuru-Guzik, Proceedings of the National Academy of Science 105 , 1868 (2008).
  4. [8]P. Pfeuty, Annals of Physics 57 , 79 (1970).
  5. IEEE/ACM International Symposium on Microarchitecture (IEEE Computer Society, Washington, DC, 2005), pp. 305-318.
  6. [13]P. W. Shor, in Proceedings of the 35th annual Symposium on Foundations of Computer Science (IEEE, Los Alamitos, CA, 1994), pp. 124-134.
  7. [20]R. Cleve, A. Ekert, C. Macchiavello, and M. Mosca, Proc. R. Soc. Lon. A 454 , 339 (1998).
  8. [22]J. Kempe, A. Kitaev, and O. Regev, SIAM Journal of Computing 35 , 1070 (2006).
  9. [27]P. Shor, in Proceedings of the 37th annual Symposium on the Foundations of Computer Science (IEEE, Los Alamitos, CA, 1996), pp. 56-65.
  10. [28]D. Aharonov and M. Ben-Or, in Proceedings of the 29th annual ACM Symposium on Theory of Computing (ACM, New York, NY, USA, 1997), vol. 29, pp. 176-188.
  11. [29]A. Y. Kitaev, in Proceedings of the 3rd International Conference of Quantum Communication and Measurement , edited by O. Hirota, A. S. Holevo, and C. M. Caves (Plenum, New York, NY, 1997), pp. 181-188.
  12. [32]D. Wineland, M. Barrett, J.Britton, J. Chiaverini, B. DeMarco, W. Itano, B. Jelenkovic, C. Langer, D. Leibfried, V. Meyer, et al., Phil. Trans. R. Soc. Lond. A361 , 1349 (2003).
  13. [36]T. M. Metodi, D. D. Thaker, and F. T. Chong, in Proceedings of the 5th Workshop on Non-Silicon Computing (NSC-5) (2007).
  14. [38]D. Gottesman, Journal of Modern Optics 47 , 333 (2000).
  15. [47]S. Istrail, in Proceedings of the 32nd annual ACM Symposium on Theory of Computing (ACM, New York, NY, 2000), p. 87.

Cited by

Sorted by citations

Related

Authors
Clark, C. R., Metodi, T. S., Gasster, S. D., & Brown, K. R.
Affiliations
  • Georgia Institute of Technology (US)
  • The Aerospace Corporation (US)
ORCID
Venue
Physical Review A
Publisher
American Physical Society (APS)
Published
2009-06-15
Volume
79
Issue
6
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
DOI
10.1103/physreva.79.062314
OpenAlex
W2031187169
Cited by
51
References
42
Citations by year
2024: 1 · 2023: 1 · 2022: 1 · 2021: 6 · 2019: 1 · 2018: 1 · 2016: 3 · 2015: 2 · 2014: 9 · 2013: 8 · 2012: 3
FWCI
6.50
Type
journal article
Language
en
Open access
Licence
link.aps.org/licenses/aps-default-license (vor)
Locations
  • Physical Review A (publishedVersion)
  • arXiv (Cornell University) (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
fault-tolerant quantum computing, quantum simulation, transverse-field Ising model, ground state energy, resource requirements, quantum error correction, Shor's algorithm, quantum factoring, spin-1/2 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