Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

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

Hamiltonian simulation with optimal sample complexity

Open access
Kimmel, Shelby, Lin, Cedric Yen-Yu, Low, Guang Hao, Ozols, Maris, Yoder, Theodore J. · 2017 · npj Quantum Information

Abstract

We investigate the sample complexity of Hamiltonian simulation: how many copies of an unknown quantum state are required to simulate a Hamiltonian encoded by the density matrix of that state? We show that the procedure proposed by Lloyd, Mohseni, and Rebentrost [ Nat. Phys. , 10(9):631–633, 2014] is optimal for this task. We further extend their method to the case of multiple input states, showing how to simulate any Hermitian polynomial of the states provided. As applications, we derive optimal algorithms for commutator simulation and orthogonality testing, and we give a protocol for creating a coherent superposition of pure states, when given sample access to those states. We also show that this sample-based Hamiltonian simulation can be used as the basis of a universal model of quantum computation that requires only partial swap operations and simple single-qubit states.

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.1038/s41534-017-0013-7

Cites

63 of 63 references verified0 citation errors · 0 not checkable

Statistics

Figures

Fig. 1 Connectivity graph for qubits in our model. Each circle represents a qubit. Qubits connected by a solid line can have the Heisenberg interaction applied between them. The qubit q * can be prepared in the state | 0 〉 or | + 〉
Fig. 1 Connectivity graph for qubits in our model. Each circle represents a qubit. Qubits connected by a solid line can have the Heisenberg interaction applied between them. The qubit q * can be prepared in the state | 0 〉 or | + 〉CC-BY · From the PDF
Fig. 2 The gadget to create ρ ′ ( r ) . Here Sk is the permutation of k registers given in Eq. (32), and the waste bins indicate the partial trace. The H -gate is a single-qubit Hadamard gate and measurement is in the Z -basis. In ref. 41 they use the same circuit, but use the measurement outcomes to perform spectrum estimation
Fig. 2 The gadget to create ρ ′ ( r ) . Here Sk is the permutation of k registers given in Eq. (32), and the waste bins indicate the partial trace. The H -gate is a single-qubit Hadamard gate and measurement is in the Z -basis. In ref. 41 they use the same circuit, but use the measurement outcomes to perform spectrum estimationCC-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 64 references

Cited by

See all 121

Metadata

Authors
Kimmel, S., Lin, C. Y.-Y., Low, G. H., Ozols, M., & Yoder, T. J.
Affiliations
  • Joint Center for Quantum Information and Computer Science (US)
  • Massachusetts Institute of Technology (US)
Venue
npj Quantum Information
Published
2017-03-30
Volume
3
Issue
1
ISSN
2056-6387 (ISSN-L)
OpenAlex
W2490964415
Cited by
85
References
64
Citations by year
2026: 4 · 2025: 17 · 2024: 10 · 2023: 9 · 2022: 6 · 2021: 7 · 2020: 9 · 2019: 12 · 2018: 5 · 2017: 4
FWCI
4.90
Type
journal article
Language
en
Open access
Licence
Locations
  • npj Quantum Information (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • DSpace@MIT (Massachusetts Institute of Technology) (submittedVersion, cc-by-nc)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • University Libraries (University of Maryland) (submittedVersion)
  • Apollo (University of Cambridge) (submittedVersion, cc-by)
  • arXiv (Cornell University)
  • Digital Repository at the University of Maryland (University of Maryland College Park)
  • Apollo (cc-by)
Funders
  • National Science Foundation
  • U.S. Department of Defense (32 CFR 168 a)
  • Massachusetts Institute of Technology
  • Leverhulme Trust (ECF-2015-256)
  • European Commission (600700)
  • National Defense Science and Engineering Graduate (32 CFR 168a, CFR 168a)
  • Army Research Office (32 CFR 168A)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
Keywords
Hamiltonian simulation, sample complexity, quantum state tomography, optimal algorithms, Hermitian polynomials, universal quantum computation

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 with optimal sample complexity. https://app.cochat.ai/papers/10.1038/s41534-017-0013-7
The paper
Kimmel, S., Lin, C. Y.-Y., Low, G. H., Ozols, M., & Yoder, T. J. (2017). Hamiltonian simulation with optimal sample complexity. npj Quantum Information. https://doi.org/10.1038/s41534-017-0013-7

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.