CoChat

Simulating Sparse Hamiltonians with Star Decompositions

Open access
Childs, Andrew M., Kothari, Robin · 2011 · Lecture Notes in Computer Science

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

Abstract

We present an efficient algorithm for simulating the time evolution due to a sparse Hamiltonian. In terms of the maximum degree d and dimension N of the space on which the Hamiltonian H acts for time t, this algorithm uses (d2(d+log* N) ∥Ht∥)1+o(1) queries. This improves the complexity of the sparse Hamiltonian simulation algorithm of Berry, Ahokas, Cleve, and Sanders, which scales like (d4(d+log* N) ∥Ht∥)1+o(1) To achieve this, we decompose a general sparse Hamiltonian into a small sum of Hamiltonians whose graphs of non-zero entries have the property that every connected component is a star, and efficiently simulate each of these pieces.

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.1007/978-3-642-18073-6_8

Cites

17 of 17 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

Show all 17 references

Research works printed but not linked: 1

  1. 8. Farhi, E., Goldstone, J., Gutmann, S.: A quantum algorithm for the Hamiltonian NAND tree. Theory Of Computing 4 (2008) 169-190 · doi:10.4086/toc.2008.v004a008

Cited by

See all 86

Metadata

Authors
Childs, A. M., & Kothari, R.
Affiliations
University of Waterloo (CA)
Venue
Lecture Notes in Computer Science
Published
2011
Pages
94-103
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
OpenAlex
W1741741009
Cited by
85
References
20
Citations by year
2025: 2 · 2024: 3 · 2023: 6 · 2022: 2 · 2021: 4 · 2020: 4 · 2019: 5 · 2018: 6 · 2017: 10 · 2016: 6 · 2015: 2 · 2014: 12 · 2013: 6 · 2012: 9
FWCI
8.37
Type
conference paper
Language
en
Open access
Locations
  • Lecture notes in computer science (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • Mitacs
  • Natural Sciences and Engineering Research Council of Canada
  • Army Research Office
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 › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
Keywords
quantum simulation, star decomposition, Hamiltonian decomposition, time evolution, query complexity, maximum degree, quantum algorithms, Hamiltonian graphs

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: Simulating Sparse Hamiltonians with Star Decompositions. https://app.cochat.ai/papers/10.1007/978-3-642-18073-6_8
The paper
Childs, A. M., & Kothari, R. (2011). Simulating Sparse Hamiltonians with Star Decompositions. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-18073-6_8

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.