CoChat

Exponential improvement in precision for simulating sparse Hamiltonians

Open access
Berry, Dominic W., Childs, Andrew M., Cleve, Richard, Kothari, Robin, Somma, Rolando D. · 2014 · Proceedings of the forty-sixth annual ACM symposium on Theory of computing

The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.

Abstract

We provide a quantum algorithm for simulating the dynamics of sparse Hamiltonians with complexity sublogarithmic in the inverse error, an exponential improvement over previous methods. Specifically, we show that a d-sparse Hamiltonian H on n qubits can be simulated for time t with precision ε using O(τlog(τ/ε)/log log(τ/ε)) queries and O(τnlog2(τ/ε)/log log(τ/ε)) additional 2-qubit gates, where τ=d2||H||maxt. Unlike previous approaches based on product formulas, the query complexity is independent of the number of qubits acted on, and for time-varying Hamiltonians, the gate complexity is logarithmic in the norm of the derivative of the Hamiltonian. Our algorithm is based on a significantly improved simulation of the continuous- and fractional-query models using discrete quantum queries, showing that the former models are not much more powerful than the discrete model even for very small error. We also significantly simplify the analysis of this conversion, avoiding the need for a complex fault correction procedure. Our simplification relies on a new form of "oblivious amplitude amplification" that can be applied even though the reflection about the input state is unavailable. Finally, we prove new lower bounds showing that our algorithms are optimal as a function of the error.

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.1145/2591796.2591854

Cites

38 of 38 references verified0 citation errors · 0 not checkable

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.

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

Research works printed but not linked: 7

  1. [8] Andrew M. Childs, Quantum information processing in continuous time , Ph.D. thesis, Massachusetts Institute of Technology, 2004. [p. 2] - · doi:10.5555/1037515
  2. [12] Andrew M. Childs, David Gosset, and Zak Webb, Universal computation by multi-particle quantum walk , Science 339 (2013), no. 6121, 791-794, arXiv:1205.3782. [p. 21] - · arXiv
  3. [13] Andrew M. Childs and Robin Kothari, Simulating sparse Hamiltonians with star decompositions , Theory of Quantum Computation, Communication, and Cryptography (TQC 2010), Lecture Notes in Computer Science, vol. 6519, pp. 94-103, 2011, arXiv:1003.3683. [pp. 2, 14] - · arXiv
  4. 10.5555/2481569.2481570 · doi:10.5555/2481569.2481570
  5. [24] Camille Jordan, Essai sur la g´ eom´ etrie ` a n dimensions , Bulletin de la Soci´ et´ e Math´ ematique de France 3 (1875), 103-174. [p. 10] -
  6. [29] Rajeev Motwani and Prabhakar Raghavan, Randomized algorithms , Cambridge University Press, 1995. [p. 27] -
  7. [34] George N. Watson, A treatise on the theory of Bessel functions , Cambridge University Press, 1922. [p. 20] -

Cited by

See all 556

Metadata

Authors
Berry, D. W., Childs, A. M., Cleve, R., Kothari, R., & Somma, R. D.
Affiliations
  • Macquarie University (AU)
  • University of Waterloo (CA)
  • Los Alamos National Laboratory (US)
Venue
Proceedings of the forty-sixth annual ACM symposium on Theory of computing
Publisher
ACM
Published
2014-05-31
Pages
283-292
OpenAlex
W1985671429
Cited by
324
References
28
Citations by year
2026: 16 · 2025: 38 · 2024: 38 · 2023: 49 · 2022: 25 · 2021: 38 · 2020: 17 · 2019: 26 · 2018: 17 · 2017: 19 · 2016: 17 · 2015: 16 · 2014: 6
FWCI
11.38
Type
conference paper
Language
en
Open access
Locations
  • ACM Symposium on Theory of Computing (STOC) (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • Army Research Office
  • Natural Sciences and Engineering Research Council of Canada
  • Ontario Ministry of Research and Innovation
  • Australian Research Council (FT100100761)
  • Laboratory Directed Research and Development Program at LANL
  • Canadian Institute for Advanced Research
  • Mitacs
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 Information and Cryptography
Keywords
quantum simulation, sparse Hamiltonians, query complexity, time evolution simulation, lower bounds, fault-tolerant quantum computing, product formula

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.