Quantum simulation of the single-particle Schrödinger equation
Open accessThe DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
The nature of a quantum computer is described in the concrete context of a quantum simulator of the single-particle Schrödinger equation. We show that a register of 6–10 qubits is sufficient to realize a useful quantum simulator capable of efficiently solving standard quantum mechanical problems.
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
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
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306
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
Gerjuoy, E. (2005) · American Journal of Physics · doi:10.1119/1.1891170 · Cited by 76
Quantum mechanical description of linear optics
Skaar, J., Garcı́a Escartı́n, J. C., & Landro, H. (2004) · American Journal of Physics · doi:10.1119/1.1775241 · Cited by 48
Cited by
Georgescu, I. M., Ashhab, S., & Nori, F. (2014) · Reviews of Modern Physics · doi:10.1103/revmodphys.86.153 · Cited by 2,932
“More recently, the single-particle Schrödinger equation was considered in more detail in (Benenti and Strini, 2008), where it was shown that six to ten qubits would be sufficient for a simulation of the single-particle Schrödinger equation.”
BackgroundSimulating Chemistry Using Quantum Computers
Kassal, I., Whitfield, J. D., Perdomo-Ortiz, A., Yung, M.-H., & Aspuru-Guzik, A. (2011) · Annual Review of Physical Chemistry · doi:10.1146/annurev-physchem-032210-103512 · Cited by 352
“The earliest applications established that as few as 10-15 qubits would be needed for a proofof-principle demonstration of single-particle dynamics (120) (later improved to 610 (15)).”
BackgroundQuantum Algorithm Implementations for Beginners
J., A., Adedoyin, A., Ambrosiano, J., Anisimov, P., Casper, W., Chennupati, G., Coffrin, C., Djidjev, H., Gunter, D., Karra, S., et al. (2018) · arXiv · doi:10.48550/arxiv.1804.03719 · Cited by 256
Using Quantum Computers for Quantum Simulation
Brown, K. L., Munro, W. J., & Kendon, V. M. (2010) · Entropy · doi:10.3390/e12112268 · Cited by 129
“Benenti and Strini [68] provide a pedagogical description of this method applied to a single particle, with quantitative analysis of the number of elementary operations required for small simulations.”
MethodEfficient quantum circuits for diagonal unitaries without ancillas
Welch, J., Greenbaum, D., Mostame, S., & Aspuru-Guzik, A. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/3/033040 · Cited by 114
Algorithm for the solution of the Dirac equation on digital quantum computers
Fillion-Gourdeau, F., MacLean, S., & Laflamme, R. (2017) · Physical Review A · doi:10.1103/physreva.95.042343 · Cited by 33
Metadata
- Authors
- Benenti, G., & Strini, G.
- Venue
- American Journal of Physics
- Published
- 2008-07-01
- Volume
- 76
- Issue
- 7
- Pages
- 657-662
- ISSN
- 0002-9505 (ISSN-L)
- 1943-2909
- OpenAlex
- W2061056711
- Cited by
- 92
- References
- 6
- FWCI
- 3.71
- 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.