Cited by 120Quantum Computing Algorithms and ArchitectureQuantum many-body systemsQuantum Mechanics and Applications

Simulating quantum mechanics on a quantum computer

Open access
Boghosian, Bruce M., Taylor, Washington·1998·Physica D: Nonlinear Phenomena

Abstract

Algorithms are described for efficiently simulating quantum mechanical systems on quantum computers. A class of algorithms for simulating the Schrödinger equation for interacting many-body systems are presented in some detail. These algorithms would make it possible to simulate nonrelativistic quantum systems on a quantum computer with an exponential speedup compared to simulations on classical computers. Issues involved in simulating relativistic systems of Dirac or gauge particles are discussed.

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.1016/s0167-2789(98)00042-6

Cites

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

  • Both the collision and streaming operations are unitary and can be encoded in logical gates for quantum computing purposes.

    “Both operations are unitary and can be encoded in logical gates for quantum computing purposes [, ].”

    From Quantum lattice Boltzmann is a quantum walk (2015) · cites this paper as [35]

  • The difficulty to analyse the (3+1)-dimensional Dirac QW is mentioned in [14, 17-19].

    “The difficulty to analyse the + (3 1)-dimensional Dirac QW is mentioned in [14, 17-19].”

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

  1. [5][5] B. Boghosian and W. Taylor, A quantum lattice-gas model for the many-body Schr¨ odinger equation in d dimensions, BU-CCS/PUPT preprint quant-ph/9604035 , April 1996. - · arXiv
  2. [6][6] B. Boghosian and W. Taylor, Quantum lattice-gas models for the many-body Schr¨ odinger equation, talk presented at the Sixth International Conference on Discrete Fluid Mechanics, Boston University, Boston MA, August 1996, BU-CCS/PUPT preprint quant-ph/9701016 , January 1997. - · arXiv
  3. [8][8] D. Meyer, From quantum cellular automata to quantum lattice gases, UCSD preprint quant-ph/9604003 , March 1996. - · arXiv
  4. [12][12] C. Zalka, Efficient simulation of quantum systems by quantum computers, BUTP preprint quant-ph/9603026 , March 1996; S. Wiesner, Simulations of many-body quantum systems by a quantum computer, preprint quant-ph/9603028 , March 1996. - · arXiv
  5. [13][13] B. Nachtergaele and V. Periwal, Quantum logic as a sum over classical logic gates, PUPT preprint quant-ph/9606018 , June 1996. - · arXiv
  6. [15][15] S. Succi, Numerical solution of the Schr¨ odinger equation using discrete kinetic theory, IBM ECSEC preprint, 1995. -
  7. [16][16] R. P. Feynman and A. R. Hibbs, Quantum Mechanics and Path Integrals (McGrawHill, New York, 1965) pp. 35-36; see also Feynman's unpublished notes as reproduced in S. S. Schweber, Rev. Mod. Phys. 58 (1986) 449. -
  8. [17][17] D. Meyer, Quantum lattice gases and their invariants, talk presented at the Sixth International Conference on Discrete Fluid Mechanics, Boston University, Boston MA, August 1996. -
  9. [18][18] D. Meyer, Quantum mechanics of lattice gas automata I. One particle plane waves and potentials, UCSD preprint quant-ph/9611005 , October 1996. - · arXiv
  10. [20][20] D. S. Abrams and S. Lloyd, Simulation of Many-Body Fermi Systems on a Universal Quantum Computer, MIT preprint, November 1996. -
  11. [25][25] P. W. Shor, Fault-tolerant quantum computation, AT&T preprint quant-ph/9605011 , May 1996, and references therein. · arXiv

Cited by

Sorted by citations

Authors
Boghosian, B. M., & Taylor, W.
Affiliations
  • Boston University (US)
  • Princeton University (US)
Corresponding author
Boghosian, Bruce M.
Venue
Physica D: Nonlinear Phenomena
Publisher
Elsevier BV
Published
1998-09
Volume
120
Issue
1-2
Pages
30-42
ISSN
0167-2789 (ISSN-L)
OpenAlex
W2165841391
Cited by
120
References
8
Citations by year
2026: 1 · 2025: 8 · 2024: 7 · 2023: 7 · 2022: 9 · 2021: 2 · 2020: 4 · 2019: 4 · 2018: 7 · 2017: 3 · 2016: 5 · 2015: 2 · 2014: 5 · 2013: 5 · 2012: 3
FWCI
3.52
Type
journal article
Language
en
Open access
Locations
  • Physica D Nonlinear Phenomena (publishedVersion, cc-by-nc-nd)
  • 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 › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
Keywords
quantum simulation, quantum computing hardware, Schrödinger equation, quantum many-body systems, quantum algorithms, exponential speedup, relativistic quantum systems, Dirac equation

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