Quantum Hamiltonian Complexity
Open accessThe DOI matches its Crossref record; 194 of the 209 references it cites were found in a registry or an index, and 15 are not checked yet.
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.
Integrity signals
Registry
Cites
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.
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 check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“This modification of the optical apparatus stems from the unitary transformation (Equation 19) that encodes the molecular problem 220 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [220]
Experimental — accuracy not yet measured
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
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 18,842
Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables
W., J. W., Abramowitz, M., & Stegun, I. A. (1965) · Mathematics of Computation · doi:10.2307/2004114 · Cited by 18,663
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
Density matrix formulation for quantum renormalization groups
White, S. R. (1992) · Physical Review Letters · doi:10.1103/physrevlett.69.2863 · Cited by 7,702
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Bekenstein, J. D. (1973) · Physical Review D · doi:10.1103/physrevd.7.2333 · Cited by 7,555
Fault-tolerant quantum computation by anyons
Kitaev, A. Y. (2003) · Annals of Physics · doi:10.1016/s0003-4916(02)00018-0 · Cited by 7,238
Electron correlations in narrow energy bands
Hubbard, J. (1963) · Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences · doi:10.1098/rspa.1963.0204 · Cited by 6,699
Crystal Statistics. I. A Two-Dimensional Model with an Order-Disorder Transition
Onsager, L. (1944) · Physical Review · doi:10.1103/physrev.65.117 · Cited by 6,510
Research works printed but not linked: 2
- Levin, 1973, Universal sequential search problems, Problems of Information Transmission, 9, 265
- Watrous, 2009, Encyclopedia of Complexity and System Science, chapter Quantum Computational Complexity
Cited by
Quantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J. P., Degroote, M., Johnson, P. D., Kieferová, M., Kivlichan, I. D., Menke, T., Peropadre, B., Sawaya, N. P. D., et al. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00803 · Cited by 1,560
Albash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
Quantum information processing with superconducting circuits: a review
Wendin, G. (2017) · Reports on Progress in Physics · doi:10.1088/1361-6633/aa7e1a · Cited by 890
Circuit complexity in quantum field theory
Jefferson, R. A., & Myers, R. C. (2017) · Journal of High Energy Physics · doi:10.1007/jhep10(2017)107 · Cited by 412
Quantum Entanglement in Neural Network States
Deng, D.-L., Li, X., & Das Sarma, S. (2017) · Physical Review X · doi:10.1103/physrevx.7.021021 · Cited by 403
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
- green
- arxiv.org
- 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.