CoChat

Quantum Hamiltonian Complexity

Open access
Gharibian, Sevag, Huang, Yichen, Landau, Zeph, Shin, Seung Woo · 2015 · Foundations and Trends® in Theoretical Computer Science

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

Abstract

Constraint satisfaction problems are a central pillar of modern computational complexity theory. This survey provides an introduction to the rapidly growing field of Quantum Hamiltonian Complexity, which includes the study of quantum constraint satisfaction problems. Over the past decade and a half, this field has witnessed fundamental breakthroughs, ranging from the establishment of a “Quantum Cook-Levin Theorem” to deep insights into the structure of 1D low-temperature quantum systems via so-called area laws. Our aim here is to provide a computer science-oriented introduction to the subject in order to help bridge the language barrier between computer scientists and physicists in the field. As such, we include the following in this survey: (1) The motivations and history of the field, (2) a glossary of condensed matter physics terms explained in computer-science friendly language, (3) overviews of central ideas from condensed matter physics, such as indistinguishable particles, mean field theory, tensor networks, and area laws, and (4) brief expositions of selected computer science-based results in the area. For example, as part of the latter, we provide a novel information theoretic presentation of Bravyi’s polynomial time algorithm for Quantum 2-SAT.

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.1561/0400000066

Cites

194 of 209 references verified0 citation errors · 15 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 209 references

Research works printed but not linked: 9

  1. I. Arad, A. Kitaev, Z. Landau, and U. Vazirani. An area law and sub- exponential algorithm for 1D systems. Available at arXiv.org e-Print quant-ph/1301.1162, 2013.
  2. I. Arad, M. Santha, A. Sundaram, and S. Zhang. Linear time algorithm for quantum 2SAT. arXiv:1508.06340, 2015. · arXiv
  3. T. Cubitt, D. Perez-Garcia, and M. M. Wolf. Undecidability of the spectral gap (full version). Available at arXiv.org e-Print quant- ph/1502.04573, 2015.
  4. A. Kitaev. Quantum NP, 1999. Talk at Second Workshop on Algorithms in Quantum Information Processing (AQIP 1999), DePaul University.
  5. A. Kitaev, A. Shen, and M. Vyalyi. Classical and Quantum Computa- tion. American Mathematical Society, 2002.
  6. L. Levin. Universal sequential search problems. Problems of Information Transmission, 9(3):265-266, 1973.
  7. A. Meyer and L. Stockmeyer. The equivalence problem for regular expressions with squaring requires exponential time. In Proceedings of the 13th Symposium on Foundations of Computer Science, pages 125- 129, 1972.
  8. J. Watrous. Encyclopedia of Complexity and System Science, chapter Quantum Computational Complexity. Springer, 2009.
  9. J. Yan and D. Bacon. The k-local Pauli commuting Hamiltonians prob- lem is in P. Available at arXiv.org e-Print quant-ph/1203.3906, 2012.

Cited by

Metadata

Authors
Gharibian, S., Huang, Y., Landau, Z., & Shin, S. W.
Affiliations
  • University of California, Berkeley (US)
  • University of California System (US)
Venue
Foundations and Trends® in Theoretical Computer Science
Publisher
Emerald
Published
2015-10-13
Volume
10
Issue
3
Pages
159-282
ISSN
  • 1551-305X (ISSN-L)
  • 1551-3068
OpenAlex
W2116015765
Cited by
144
References
182
Citations by year
2026: 7 · 2025: 31 · 2024: 13 · 2023: 10 · 2022: 8 · 2021: 14 · 2020: 8 · 2019: 16 · 2018: 7 · 2017: 18 · 2016: 6 · 2015: 3
FWCI
11.11
Type
journal article
Language
en
Open access
Locations
  • Foundations and Trends® in Theoretical Computer Science (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • National Science Foundation (0905626, W911NF-12-1-0541)
  • John Templeton Foundation
  • Government of Canada
  • Indian Institute of Technology Madras
  • Defense Advanced Research Projects Agency
  • Simons Institute for the Theory of Computing, University of California Berkeley
  • Natural Sciences and Engineering Research Council of Canada
  • Army Research Office (CCF-0905626, W911NF-09-1-0440, W911NF, W911NF-12-1-0541)
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
area law, tensor networks, mean-field theory, identical particles, condensed matter physics

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

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.