The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Hamiltonian simulation using linear combinations of unitary operations
Abstract
We present a new approach to simulating Hamiltonian dynamics based on implementing linear combinations of unitary operations rather than products of unitary operations. The resulting algorithm has superior performance to existing simulation algorithms based on product formulas and, most notably, scales better with the simulation error than any known Hamiltonian simulation technique. Our main tool is a general method to nearly deterministically implement linear combinations of nearby unitary operations, which we show is optimal among a large class of methods.
Overview
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.
Integrity signals
Registry
Cites
Statistics
Verification
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.
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
Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables
W., J. W., Abramowitz, M., & Stegun, I. A. (1965) · Mathematics of Computation · doi:10.2307/2004114 · Cited by 18,663
Quantum Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088
Universal Computation by Quantum Walk
Childs, A. M. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.180501 · Cited by 1,002
Self-citationSuzuki, M. (1991) · Journal of Mathematical Physics · doi:10.1063/1.529425 · Cited by 762
Quantum Computation by Adiabatic Evolution
Farhi, E., Goldstone, J., Gutmann, S., & Sipser, M. (2000) · arXiv · doi:10.48550/arxiv.quant-ph/0001106 · Cited by 536
On the Relationship Between Continuous- and Discrete-Time Quantum Walk
Childs, A. M. (2010) · Communications in Mathematical Physics · doi:10.1007/s00220-009-0930-1 · Cited by 411
Self-citationAdiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., & Regev, O. (2008) · SIAM Review · doi:10.1137/080734479 · Cited by 395
Adiabatic quantum state generation and statistical zero knowledge
Aharonov, D., & Ta-Shma, A. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · doi:10.1145/780542.780546 · Cited by 322
Quantum Simulation of Time-Dependent Hamiltonians and the Convenient Illusion of Hilbert Space
Poulin, D., Qarry, A., Somma, R., & Verstraete, F. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.170501 · Cited by 265
Higher order decompositions of ordered operator exponentials
Wiebe, N., Berry, D., Høyer, P., & Sanders, B. C. (2010) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/43/6/065203 · Cited by 208
Self-citationQuantum information processing in continuous time
Childs, A. M., & Farhi, E. (2004) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 167
Self-citationA Quantum Algorithm for the Hamiltonian NAND TreePreprint
Farhi, E., Goldstone, J., & Gutmann, S. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0702144 · Cited by 141
Exponential algorithmic speedup by a quantum walk
Childs, A. M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., & Spielman, D. A. (2003) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/780551.780552 · Cited by 135
Self-citationBlack-box Hamiltonian simulation and unitary implementation
Childs, A. M., & Berry, D. W. (2012) · Quantum Information and Computation · doi:10.26421/qic12.1-2-4 · Cited by 111
Self-citationSimulating Sparse Hamiltonians with Star Decompositions
Childs, A. M., & Kothari, R. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-18073-6_8 · Cited by 85
Self-citationOn the efficiency of quantum algorithms for Hamiltonian simulation
Papageorgiou, A., & Zhang, C. (2011) · Quantum Information Processing · doi:10.1007/s11128-011-0263-9 · Cited by 44
Efficient discrete-time simulations of continuous-time quantum query algorithms
Cleve, R., Gottesman, D., Mosca, M., Somma, R. D., & Yonge-Mallo, D. L. (2009) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1536414.1536471 · Cited by 40
Chin, S. A., & Geiser, J. (2011) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/drq022 · Cited by 21
Quantum algorithms for solving linear differential equationsPreprint
Berry, D. W. (2010) · arXiv (Cornell University) · Cited by 7
Cited by
Circuit-centric quantum classifiers
Schuld, M., Bocharov, A., Svore, K. M., & Wiebe, N. (2020) · Physical Review A · doi:10.1103/physreva.101.032308 · Cited by 1,057
Self-citationHamiltonian Simulation by Qubitization
Low, G. H., & Chuang, I. L. (2019) · Quantum · doi:10.22331/q-2019-07-12-163 · Cited by 854
Optimal Hamiltonian Simulation by Quantum Signal Processing
Low, G. H., & Chuang, I. L. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.010501 · Cited by 769
Elucidating reaction mechanisms on quantum computers
Reiher, M., Wiebe, N., Svore, K. M., Wecker, D., & Troyer, M. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1619152114 · Cited by 745
Self-citationSimulating Hamiltonian Dynamics with a Truncated Taylor Series
Berry, D. W., Childs, A. M., Cleve, R., Kothari, R., & Somma, R. D. (2015) · Physical Review Letters · doi:10.1103/physrevlett.114.090502 · Cited by 742
Self-citation
Metadata
- Authors
- Childs, A. M., & Wiebe, N.
- Venue
- Quantum Information and Computation
- Publisher
- Rinton Press
- Published
- 2012-11
- Volume
- 12
- Issue
- 11&12
- Pages
- 901-924
- ISSN
- 1533-7146 (ISSN-L)
- OpenAlex
- W2600825956
- Cited by
- 392
- References
- 20
- FWCI
- 2.53
- Type
- journal article
- Language
- en
- Open access
- closed
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.