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

Quantum Simulation of Time-Dependent Hamiltonians and the Convenient Illusion of Hilbert Space

Open access
Poulin, David, Qarry, Angie, Somma, Rolando, Verstraete, Frank·2011·Physical Review Letters

Abstract

We consider the manifold of all quantum many-body states that can be generated by arbitrary time-dependent local Hamiltonians in a time that scales polynomially in the system size, and show that it occupies an exponentially small volume in Hilbert space. This implies that the overwhelming majority of states in Hilbert space are not physical as they can only be produced after an exponentially long time. We establish this fact by making use of a time-dependent generalization of the Suzuki-Trotter expansion, followed by a well-known counting argument. This also demonstrates that a computational model based on arbitrarily rapidly changing Hamiltonians is no more powerful than the standard quantum circuit model.

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.1103/physrevlett.106.170501

Cites

23 of 23 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?

  • For many physical systems, both k and m are limited: 2 or 3-body interactions are the norm for fundamental processes, and higher interaction orders are generally hard to engineer.

    “For many physical systems, both k and m are limited: 2 or 3-body interactions are the norm for fundamental processes, and higher interaction orders are generally hard to engineer here [37-39].”

    From Enhancing the Charging Power of Quantum Batteries (2017) · cites this paper as [38]

  • Antisymmetrization can be enforced by reversing a suitable sorting algorithm and uncomputing ancillas to make the procedure reversible.

    “Antisymmetrization can be enforced by reversing a suitable sorting algorithm and uncomputing ancillas to make the procedure reversible 286 .”

    From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [286]

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: 18

  1. J. Bardeen, L. N. Cooper, and J. R. Schrieffer, Phys. Rev. A 108, 1175 (1957).
  2. R. B. Laughlin, Physical Review Letters, 50, 1395 (1983).
  3. J. I. Cirac, F. Verstraete, J. Phys. A: Math. Theor. 42, 504004 (2009)
  4. S. Lloyd, Science, 273, 1073 (1996).
  5. C. Zalka, Proc. R. Soc. Lond. A, 454, 313 (1998).
  6. D. Aharonov and A. Ta-Shma, Proc. 35th Annual ACM Symp. on Theo. Comp., 20 (2003).
  7. D. W. Berry, G. Ahokas, R. Cleve, and B. C. Sanders, Communications in Mathematical Physics, 270, 359 (2007).
  8. D. W. Berry and A. M. Childs, arXiv:0910.4157 (2009) · arXiv
  9. A. M. Childs and R. Kothari, arXiv:1003.3683 (2010) · arXiv
  10. C. M. Dawson and M. A. Nielsen, Quant. Info. and Comp. 6, 81 (2006)
  11. R. P. Feynman, Int. J. of Theor. Phys., 21, 467 (1982).
  12. H. Trotter, Proc. Am. Math. Soc., 10, 545 (1959).
  13. M. Suzuki, Proc. Japan Acad., 69, 161 (1993).
  14. N. Wiebe, D. Berry, P. Hyer, and B. C. Sanders, Journal of Physics A: Mathematical and Theoretical, 43, 065203 (2010), ISSN 1751-8113.
  15. C. Cohen-Tannoudji, J. Dupont-Roc, and G. Grynberg, Atom-Photon Interactions (John Wiley Sons, 1992).
  16. G. Vidal, Phys. Rev. Lett. 99, 220405 (2007);
  17. Phys. Rev. Lett. 101, 110501 (2008)
  18. F. Verstraete, J.I. Cirac, V. Murg, Adv. Phys. 57, 143 (2008)

Cited by

Sorted by citations

Authors
Poulin, D., Qarry, A., Somma, R., & Verstraete, F.
Affiliations
  • Université de Sherbrooke (CA)
  • Centre for Quantum Technologies (SG)
  • Los Alamos National Laboratory (US)
  • University of Vienna (AT)
Venue
Physical Review Letters
Published
2011-04-29
Volume
106
Issue
17
Pages
170501-170501
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W2053987271
Cited by
265
References
23
Citations by year
2026: 9 · 2025: 29 · 2024: 18 · 2023: 19 · 2022: 37 · 2021: 41 · 2020: 17 · 2019: 14 · 2018: 8 · 2017: 14 · 2016: 6 · 2015: 12 · 2014: 13 · 2013: 9 · 2012: 15
FWCI
12.07
Type
journal article
Language
en
Open access
Locations
  • Physical Review Letters (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • Ghent University Academic Bibliography (Ghent University) (submittedVersion, other-oa)
  • National University of Singapore (submittedVersion)
  • arXiv (Cornell University)
  • Bulletin of the American Physical Society
Funders
National Science Foundation
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, time-dependent Hamiltonian, quantum many-body states, quantum circuit model, computational power

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