CoChat

Limitations on the simulation of non-sparse hamiltonians

Open access
Andrew M. Childs, Robin Kothari · 2010
DOI 10.5555/2011373.2011380
PreprintCited by 52

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

Abstract

The problem of simulating sparse Hamiltonians on quantum computers is well studied. The evolution of a sparse N × N Hamiltonian H for time t can be simulated using O(||Ht|| poly(logN)) operations, which is essentially optimal due to a no-fast-forwarding theorem. Here, we consider non-sparse Hamiltonians and show significant limitations ontheir simulation. We generalize the no-fast-forwarding theorem to dense Hamiltonians, ruling out generic simulations taking time o(||Ht||), even though ||H|| is not a uniquemeasure of the size of a dense Hamiltonian H. We also present a stronger limitationruling out the possibility of generic simulations taking time poly(||Ht||; logN), showingthat known simulations based on discrete-time quantum walk cannot be dramatically improved in general. On the positive side, we show that some non-sparse Hamiltonianscan be simulated efficiently, such as those with graphs of small arboricity.

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

OpenAlex · 10.5555/2011373.2011380

Cites

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

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 6 references

Cited by

See all 52

Metadata

Authors
Childs, A. M., & Kothari, R.
Published
2010-07-01
Volume
10
Issue
7
Pages
669-684
DOI
10.5555/2011373.2011380
OpenAlex
W1639121495
Cited by
52
References
6
Type
posted content
Language
en
Open access
green

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: Limitations on the simulation of non-sparse hamiltonians. https://app.cochat.ai/papers/10.5555/2011373.2011380
The paper
Childs, A. M., & Kothari, R. (2010). Limitations on the simulation of non-sparse hamiltonians. https://doi.org/10.5555/2011373.2011380

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.