CoChat

Hamiltonian Simulation by Qubitization

Open access
Low, Guang Hao, Chuang, Isaac L. · 2019 · Quantum

The 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.22331/q-2019-07-12-163

Cites

48 of 48 references verified0 citation errors · 0 not checkable

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).
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).CC-BY · From the PDF

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.

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?

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

Show all 48 references

Research works printed but not linked: 3

  1. R. Kothari, Efficient algorithms in quantum query complexity, Ph.D. thesis, University of Waterloo (2014).
  2. 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
  3. M. Abramowitz, I. A. Stegun, and Others, ``Handbook of mathematical functions,'' Applied mathematics series 55, 62 (1966).

Cited by

See all 1,007

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
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.