The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Simulating quantum systems on a quantum computer
Open accessAbstract
We show that the time evolution of the wave function of a quantum–mechanical many–particle system can be simulated precisely and efficiently on a quantum computer. The time needed for such a simulation is comparable to the time of a conventional simulation of the corresponding classical system, a performance which can't be expected from any classical simulation of a quantum system. We then show how quantities of interest, like the energy spectrum of a system, can be obtained. We also indicate that ultimately the simulation of quantum field theory might be possible on large quantum computers.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
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
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Mathematical Foundations of Quantum Mechanics: New Edition
von Neumann, J. (2018) · Princeton University Press eBooks · doi:10.1515/9781400889921 · Cited by 4,582
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
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
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 4×
“For this case it is reassuring to know that Lloyd has shown (Lloyd 1996) that any quantum system can be simulated on a quantum computer in something roughly proportional to real time.”
BackgroundInfluentialFeynman, R. P. (1986) · Foundations of Physics · doi:10.1007/bf01886518 · Cited by 1,770
Demonstration of a Fundamental Quantum Logic Gate
Monroe, C., Meekhof, D. M., King, B. E., Itano, W. M., & Wineland, D. J. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.4714 · Cited by 1,586
Bulk Spin-Resonance Quantum Computation
Gershenfeld, N. A., & Chuang, I. L. (1997) · Science · doi:10.1126/science.275.5298.350 · Cited by 1,528
Quantum computation and Shor's factoring algorithm
Ekert, A., & Jozsa, R. (1996) · Reviews of Modern Physics · doi:10.1103/revmodphys.68.733 · Cited by 1,354
Montvay, I., & Münster, G. (1994) · Cambridge University Press eBooks · doi:10.1017/cbo9780511470783 · Cited by 1,197
Fault-tolerant quantum computation
Shor, P. W. (2002) · Proceedings of 37th Conference on Foundations of Computer Science · doi:10.1109/sfcs.1996.548464 · Cited by 892
Decoherence, Continuous Observation, and Quantum Computing: A Cavity QED Model
Pellizzari, T., Gardiner, S. A., Cirac, J. I., & Zoller, P. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.3788 · Cited by 792
Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
Abrams, D. S., & Lloyd, S. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.2586 · Cited by 745
DeWitt, B. S. (1970) · Physics Today · doi:10.1063/1.3022331 · Cited by 678
A Potentially Realizable Quantum Computer
Lloyd, S. (1993) · Science · doi:10.1126/science.261.5128.1569 · Cited by 649 · cited 2×
“Quantum computers are still imaginary devices, but it is hoped that eventually the technical problems involved in their realization can be overcome (Lloyd 1993; Gershenfeld & Chuang 1993; Cirac & Zoller 1995; Monroe et al. 1995; Pellizzari et al. 1995; Haroche & Raimond 1996; Chuang & Yamamoto 1995; Unruh 1995; Ekert…”
BackgroundFault-tolerant quantum computation with constant error
Aharonov, D., & Ben-Or, M. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258579 · Cited by 631
Maintaining coherence in quantum computers
Unruh, W. G. (1995) · Physical Review A · doi:10.1103/physreva.51.992 · Cited by 594
Quantum measurements and the Abelian Stabilizer ProblemPreprint
Kitaev, A. (1995) · arXiv (Cornell University) · Cited by 510
Chuang, I. L., & Yamamoto, Y. (1995) · Physical Review A · doi:10.1103/physreva.52.3489 · Cited by 434
Quantum Computers, Factoring, and Decoherence
Chuang, I. L., Laflamme, R., Shor, P. W., & Zurek, W. H. (1995) · Science · doi:10.1126/science.270.5242.1633 · Cited by 289 · cited 1×
“y be available one day... 1 Quantum Computers (QCs) Quantum computers are still imaginary devices, but it is hoped that eventually the technical problems involved in their realization can be overcome [1, 2, 3, 4, 5, 6, 7]. Quantum computers could solve some problems much faster than conventional computers. Most promin…”
BackgroundA universal two-bit gate for quantum computation
Barenco, A. (1995) · Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences · doi:10.1098/rspa.1995.0066 · Cited by 217
Quantum Computing: Dream or Nightmare?
Haroche, S., & Raimond, J.-M. (1996) · Physics Today · doi:10.1063/1.881512 · Cited by 161
Simulations of Many-Body Quantum Systems by a Quantum ComputerPreprint
Wiesner, S. (1996) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9603028 · Cited by 155
Threshold Estimate for Fault Tolerant Quantum ComputationPreprint
Zalka, C. (1996) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9612028 · Cited by 87
Self-citationAccuracy threshold for quantum computation
Knill, E. H., Zurek, W. H., & Laflamme, R. (1996) · Cited by 74
Cited by
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904
Georgescu, I. M., Ashhab, S., & Nori, F. (2014) · Reviews of Modern Physics · doi:10.1103/revmodphys.86.153 · Cited by 2,932
“Some of the representative studies on DQS are (Abrams and Lloyd, 1997; Lidar and Biham, 1997; Lloyd, 1996; Marzuoli and Rasetti, 2002; Ortiz et al., 2001; Raeisi et al., 2012; Somma et al., 2002; Terhal and DiVincenzo, 2000; Verstraete et al., 2009; Wiesner, 1996; Zalka, 1998a,b).”
BackgroundQuantum computational chemistry
McArdle, S., Endo, S., Aspuru-Guzik, A., Benjamin, S. C., & Yuan, X. (2020) · Reviews of Modern Physics · doi:10.1103/revmodphys.92.015003 · Cited by 1,621
Quantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J. P., Degroote, M., Johnson, P. D., Kieferová, M., Kivlichan, I. D., Menke, T., Peropadre, B., Sawaya, N. P. D., et al. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00803 · Cited by 1,560
Simulated Quantum Computation of Molecular Energies
Aspuru-Guzik, A., Dutoi, A. D., Love, P. J., & Head-Gordon, M. (2005) · Science · doi:10.1126/science.1113479 · Cited by 1,418
Metadata
- Authors
- Zalka, C.
- Venue
- Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
- Publisher
- The Royal Society
- Published
- 1998-01-08
- Volume
- 454
- Issue
- 1969
- Pages
- 313-322
- ISSN
- 1364-5021 (ISSN-L)
- 1471-2946
- OpenAlex
- W1966702987
- Cited by
- 390
- References
- 29
- FWCI
- 12.69
- Type
- journal article
- Language
- en
- Open access
- green
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.