Cited by 692Quantum Computing Algorithms and ArchitectureQuantum many-body systemsQuantum Information and Cryptography

Efficient Quantum Algorithms for Simulating Sparse Hamiltonians

Open access
Berry, Dominic W., Ahokas, Graeme, Cleve, Richard, Sanders, Barry C.·2007·Communications in Mathematical Physics

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1007/s00220-006-0150-x

Cites

15 of 15 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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?

  • The operators b_i_k, b†_i_k can always be mapped to products of Pauli matrices using the Jordan-Wigner transformation.

    “The operators b i k , b † i k can always be mapped to products of Pauli matrices, i.e., nonlocal spin operators, using the Jordan-Wigner transformation”
  • Only in one spatial dimension, and for couplings extended to a reduced number of neighbors, the correspondence is from a local model to a similar one.

    “Only in one spatial dimension, and for couplings extended to a reduced number of neighbors, the correspondence is from a local model to a similar one [28].”
  • The method maps products of fermionic operators onto nonlocal spin operators via the Jordan-Wigner transformation.

    “We map products of fermionic operators onto nonlocal spin operators and decompose the resulting dynamics in efficient steps with Trotter methods, yielding an overall protocol that employs only polynomial resources.”
  • The Jordan-Wigner mapping establishes a correspondence between a set of fermionic operators and a set of spin operators, transforming a local Hamiltonian of fermions onto a nonlocal Hamiltonian of spins.

    “This technique establishes a correspondence between a set of fermionic operators and a set of spin operators, transforming a local Hamiltonian of fermions onto a nonlocal Hamiltonian of spins.”
  • After the four photons pass through PBS 3, PBS 4 and PBS 5, Hong-Ou-Mandel type interference was observed among the four photons.

    “After the four photons pass through PBS 3 , PBS 4 and PBS 5 , we observed the Hong-Ou-Mandel type interference among the four photons [20, 21].”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 7

  1. [1]Shor, P. W.: Algorithms for quantum computation: Discrete logarithms and factoring. Proc. 35th Symp. on Foundations of Computer Science, 124-134 (1994)
  2. [9]Ambainis, A.: Quantum walk algorithm for element distinctness. http://arxiv.org/abs/quant-ph/0311001 (2003) · arXiv
  3. [10]Ambainis, A., Kempe, J., and Rivosh, A.: Coins make quantum walks faster. http://arxiv.org/abs/quant-ph/0402107 (2004) · arXiv
  4. [11]Farhi, E., Goldstone, J., Gutmann, S., and Sipser, M.: Quantum computation by adiabatic evolution. http://arxiv.org/abs/quant-ph/0001106 (2000) · arXiv
  5. [14]Childs, A.M.: Quantum information processing in continuous time. Ph.D. Thesis, Massachusetts Institute of Technology, 2004
  6. [18]Ahokas, G.: Improved algorithms for approximate quantum Fourier transforms and sparse Hamiltonian simulations. M.Sc. Thesis, University of Calgary, 2004
  7. [20]Nielsen, M.A. and Chuang, I.L.: Quantum Computation and Quantum Information . Cambridge: Cambridge University Press, 2000

Cited by

Sorted by citations

Authors
Berry, D. W., Ahokas, G., Cleve, R., & Sanders, B. C.
Affiliations
  • The University of Queensland (AU)
  • University of Calgary (CA)
  • University of Waterloo (CA)
Venue
Communications in Mathematical Physics
Published
2006-12-14
Volume
270
Issue
2
Pages
359-371
ISSN
  • 0010-3616 (ISSN-L)
  • 1432-0916
OpenAlex
W2064906820
Cited by
692
References
15
Citations by year
2026: 47 · 2025: 109 · 2024: 83 · 2023: 95 · 2022: 54 · 2021: 63 · 2020: 38 · 2019: 36 · 2018: 23 · 2017: 22 · 2016: 14 · 2015: 18 · 2014: 23 · 2013: 14 · 2012: 18
FWCI
6.09
Type
journal article
Language
en
Open access
Locations
  • Communications in Mathematical Physics (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
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 › Artificial Intelligence › Quantum Information and Cryptography
Keywords
quantum simulation, sparse Hamiltonians, quantum algorithms, quantum state evolution, sublinear time complexity, time complexity lower bounds

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