Hamiltonian Simulation by Qubitization
Open accessThe DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
Abstract
We present the problem of approximating the time-evolution operatore−iH^tto errorϵ, where the HamiltonianH^=(⟨G|⊗I^)U^(|G⟩⊗I^)is the projection of a unitary oracleU^onto the state|G⟩created by another unitary oracle. Our algorithm solves this with a query complexityO(t+log(1/ϵ))to both oracles that is optimal with respect to all parameters in both the asymptotic and non-asymptotic regime, and also with low overhead, using at most two additional ancilla qubits. This approach to Hamiltonian simulation subsumes important prior art considering Hamiltonians which ared-sparse or a linear combination of unitaries, leading to significant improvements in space and gate complexity, such as a quadratic speed-up for precision simulations. It also motivates useful new instances, such as whereH^is a density matrix. A key technical result is `qubitization', which uses the controlled version of these oracles to embed anyH^in an invariantSU(2)subspace. A large class of operator functions ofH^can then be computed with optimal query complexity, of whiche−iH^tis a special case.
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
Figures
![Figure 1 (Left) Approximation error ϵ = max θ ∈ R | A [ θ ] -iC [ θ ] -e it sin ( θ ) | . ( A [ θ ] , C [ θ ]) are real Fourier series in (cos ( kθ ) , sin ( kθ )) , k = 0 , ..., Q/ 2 , and ϵ is plotted for the upper bound 4 t q 2 q q ! (blue), truncation ∑ ∞ k = q 2 | J k [ t ] | (black), and best possible [51] (red), for Q = 2 , 4 , 8 , 16 , 32 , 64 , ∞ queries to the controlled iterate ˆ W , where q = 1+ Q/ 2 . (Right) Queries per unit of simulation time to unitary ˆ U encoding ˆ H = 〈 G | ˆ U | G 〉 at target error ‖〈 + | ˆ V ⃗ ϕ | + 〉-e -i ˆ Ht ‖ = 10 -2 , -4 , -8 , -16 for the BCCKS algorithm (thin), and this work using the truncated approximation to e it sin ( θ ) (thick).](https://figures.cochat.ai/paper-figures/5c1dcf1a11a64556bdfea9907007ec13/hamiltonian-simulation-by-qubitization-figure-1.png)
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.
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 citing paper
“There are many other Hamiltonian simulation methods, an example of a powerful and sophisticated method being qubitization [166] and quantum signal processing [167], which have the provably optimal asymptotic scaling, although it is unclear whether this will translate to better practical applications.”
From The prospects of quantum computing in computational molecular biology (2021) · cites this paper as [166]
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
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 · cited 1×
“ralized by Aharonov and Ta-Shma [3] to sparse Hamiltonians. Celebrated achievements over the years [20,8,32,10,33] have each ignited a urry of activity in diverse applications from quantum algorithms [26,19,21,15] to quantum chemistry [46,44,40,41,4,29,39]. In this dawning era of the small quantum computer [5,23], the…”
BackgroundLloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 2×
“The first explicit quantum algorithms were discovered by Lloyd [31] for local interactions, and then generalized by Aharonov and Ta-Shma [3] to sparse Hamiltonians.”
MethodSuperconducting quantum circuits at the surface code threshold for fault tolerance
Barends, R., Kelly, J., Megrant, A., Veitia, A., Sank, D., Jeffrey, E., White, T. C., Mutus, J., Fowler, A. G., Campbell, B., et al. (2014) · Nature · doi:10.1038/nature13171 · Cited by 1,733
Quantum principal component analysis
Lloyd, S., Mohseni, M., & Rebentrost, P. (2014) · Nature Physics · doi:10.1038/nphys3029 · Cited by 1,385
A computer program for designing optimum FIR linear phase digital filters
McClellan, J., Parks, T., & Rabiner, L. (1973) · IEEE Transactions on Audio and Electroacoustics · doi:10.1109/tau.1973.1162525 · Cited by 1,139
Scalable Quantum Simulation of Molecular Energies
O’Malley, P. J. J., Babbush, R., Kivlichan, I. D., Romero, J., McClean, J. R., Barends, R., Kelly, J., Roushan, P., Tranter, A., Ding, N., et al. (2016) · Physical Review X · doi:10.1103/physrevx.6.031007 · Cited by 1,059
Exponential algorithmic speedup by a quantum walk
Childs, A. M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., & Spielman, D. A. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · doi:10.1145/780542.780552 · Cited by 825
Demonstration of a small programmable quantum computer with atomic qubits
Debnath, S., Linke, N. M., Figgatt, C., Landsman, K. A., Wright, K., & Monroe, C. (2016) · Nature · doi:10.1038/nature18648 · Cited by 777
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
Self-citation
Research works printed but not linked: 3
- R. Kothari, Efficient algorithms in quantum query complexity, Ph.D. thesis, University of Waterloo (2014).
- S. Chakraborty, A. Gilyén, and S. Jeffery, ``The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation,'' arXiv preprint arXiv:1804.01973 (2018). · arXiv
- M. Abramowitz, I. A. Stegun, and Others, ``Handbook of mathematical functions,'' Applied mathematics series 55, 62 (1966).
Cited by
Quantum 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
Machine learning & artificial intelligence in the quantum domain: a review of recent progress
Dunjko, V., & Briegel, H. J. (2018) · Reports on Progress in Physics · doi:10.1088/1361-6633/aab406 · Cited by 1,055
The Variational Quantum Eigensolver: A review of methods and best practices
Tilly, J., Chen, H., Cao, S., Picozzi, D., Setia, K., Li, Y., Grant, E., Wossnig, L., Rungger, I., Booth, G. H., et al. (2022) · Physics Reports · doi:10.1016/j.physrep.2022.08.003 · Cited by 1,031
Quantum Algorithms for Quantum Chemistry and Quantum Materials Science
Bauer, B., Bravyi, S., Motta, M., & Chan, G. K.-L. (2020) · Chemical Reviews · doi:10.1021/acs.chemrev.9b00829 · Cited by 848
Metadata
- Authors
- Low, G. H., & Chuang, I. L.
- Affiliations
- Massachusetts Institute of Technology (US)
- Venue
- Quantum
- Published
- 2019-07-12
- Volume
- 3
- Pages
- 163
- ISSN
- 2521-327X (ISSN-L)
- OpenAlex
- W2535738892
- Cited by
- 854
- References
- 46
- Citations by year
- 2026: 120 · 2025: 216 · 2024: 160 · 2023: 137 · 2022: 92 · 2021: 70 · 2020: 43 · 2019: 15
- FWCI
- 25.21
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- Quantum (publishedVersion, cc-by)
- arXiv (Cornell University) (acceptedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
- arXiv (Cornell University) (cc-by)
- 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
- Hamiltonian simulation, qubitization, evolution operator, query complexity, sparse Hamiltonians, linear combination of unitaries, ancilla qubits, operator functions, quantum algorithms
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Hamiltonian Simulation by Qubitization. https://app.cochat.ai/papers/10.22331/q-2019-07-12-163
- The paper
- Low, G. H., & Chuang, I. L. (2019). Hamiltonian Simulation by Qubitization. Quantum. https://doi.org/10.22331/q-2019-07-12-163
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.