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.
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 · cited 3×
“One of the main instigators of this push was White’s celebrated Density Matrix Renormalization Group 1 (DMRG) method [Whi92, Whi93], which is a heuristic algorithm performing remarkably well in practice for finding ground states of 1D quantum systems.”
BackgroundMethodSimulating 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: 9
- 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.
- I. Arad, M. Santha, A. Sundaram, and S. Zhang. Linear time algorithm for quantum 2SAT. arXiv:1508.06340, 2015. · arXiv
- 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.
- A. Kitaev. Quantum NP, 1999. Talk at Second Workshop on Algorithms in Quantum Information Processing (AQIP 1999), DePaul University.
- A. Kitaev, A. Shen, and M. Vyalyi. Classical and Quantum Computa- tion. American Mathematical Society, 2002.
- L. Levin. Universal sequential search problems. Problems of Information Transmission, 9(3):265-266, 1973.
- 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.
- J. Watrous. Encyclopedia of Complexity and System Science, chapter Quantum Computational Complexity. Springer, 2009.
- 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
Items 101–200 of 233
Commuting Local Hamiltonian Problem on 2D Beyond Qubits
Irani, S., & Jiang, J. (2025) · Communications in Mathematical Physics · doi:10.1007/s00220-025-05462-8 · Cited by 12
Oracle Complexity Classes and Local Measurements on Physical Hamiltonians
Gharibian, S., Piddock, S., & Yirka, J. (2019) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.stacs.2020.20 · Cited by 12
Self-citationOn Efficiently Solvable Cases of Quantum k-SAT
Aldi, M., de Beaudrap, N., Gharibian, S., & Saeedi, S. (2020) · Communications in Mathematical Physics · doi:10.1007/s00220-020-03843-9 · Cited by 11
Self-citationTwo-dimensional local Hamiltonian problem with area laws is QMA-complete
Huang, Y. (2021) · Journal of Computational Physics · doi:10.1016/j.jcp.2021.110534 · Cited by 11
Self-citationHolographic complexity in general quadratic curvature theory of gravity
Ghodsi, A., Qolibikloo, S., & Karimi, S. (2020) · The European Physical Journal C · doi:10.1140/epjc/s10052-020-08503-9 · Cited by 11
Polynomial-time Classical Simulation for One-dimensional Quantum Gibbs StatesPreprint
Kuwahara, T., & Saito, K. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1807.08424 · Cited by 11
A multiprover interactive proof system for the local Hamiltonian problemPreprint
Fitzsimons, J. F., & Vidick, T. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1409.0260 · Cited by 11
Position Papers for the ASCR Workshop on Basic Research Needs in Quantum Computing and Networking
Lougovski, P., Parekh, O., Broz, J., Byrd, M., Chembo, Y. K., de Jong, W. A., Figueroa, E. V., Humble, T. S., Larson, J. M., Quiroz, G., et al. (2023) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/2283320 · Cited by 11
Sharp Transitions for Subsystem ComplexityPreprint
Fan, Y., Hunter-Jones, N., Karch, A., & Mittal, S. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2510.18832 · Cited by 11
Fawzi, H., Fawzi, O., & Scalet, S. O. (2023) · Quantum · doi:10.22331/q-2023-05-22-1011 · Cited by 10
Entanglement area law for one-dimensional gauge theories and bosonic systems
Abrahamsen, N., Tong, Y., Bao, N., Su, Y., & Wiebe, N. (2023) · Physical Review A · doi:10.1103/physreva.108.042422 · Cited by 10
On the characterization of partially entanglement breaking and annihilating channels
Mallick, B., Ganguly, N., & Majumdar, A. S. (2026) · Journal of Mathematical Physics · doi:10.1063/5.0274921 · Cited by 10
Hamiltonian complexity in the thermodynamic limit
Aharonov, D., & Irani, S. (2022) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3519935.3520067 · Cited by 10
Complexity growth of massive black hole with a probe string
Zhou, Y., Kuang, X., & Wu, J.-P. (2021) · The European Physical Journal C · doi:10.1140/epjc/s10052-021-09563-1 · Cited by 10
Statistical learnability of nuclear masses
Idini, A. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.043363 · Cited by 10
Simulating Condensed Matter Physics on Quantum HardwarePreprint
Shen, R., Chen, T., Tai, T., Koh, J. M., Ghaemi, P., & Lee, C. H. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2606.02721 · Cited by 12
Fermionic Hamiltonians without trivial low-energy states
Herasymenko, Y., Anshu, A., Terhal, B. M., & Helsen, J. (2024) · Physical Review A · doi:10.1103/physreva.109.052431 · Cited by 9
Entanglement Dynamics From Random Product States: Deviation From Maximal Entanglement
Huang, Y. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3140469 · Cited by 9
Self-citationShang, Z.-X., Chen, Z., Lu, C., Pan, J.-W., & Chen, M.-C. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2401.13946 · Cited by 9
On the Computational Complexity of Schrödinger OperatorsPreprint
Zheng, Y., Leng, J., Liu, Y., & Wu, X. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2411.05120 · Cited by 9
Pinned quantum Merlin-Arthur: The power of fixing a few qubits in proofs
Nagaj, D., Hangleiter, D., Eisert, J., & Schwarz, M. (2021) · Physical Review A · doi:10.1103/physreva.103.012604 · Cited by 8
Complexity Classification of Product State Problems for Local Hamiltonians
Kallaugher, J., Parekh, O., Thompson, K., Wang, Y., & Yirka, J. (2024) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.itcs.2025.63 · Cited by 8
Quantum proofs, the local Hamiltonian problem and applications
Grilo, A. B. (2018) · theses.fr (ABES) · doi:10.70675/f00d1315z363fz45c1zb638z80469285a584 · Cited by 8
Classical Algorithms for Hamiltonian Dynamics Mean Value and Guided Local Hamiltonian ProblemPreprint
Wu, Y., Zhang, Y., Wang, C., & Yuan, X. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2409.04161 · Cited by 8
A Dequantized Algorithm for the Guided Local Hamiltonian ProblemPreprint
Zhang, Y., Wu, Y., & Yuan, X. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2411.16163 · Cited by 9
Efficient Quantum Measurements: Computational Max- and Measured Rényi Divergences and Applications
Yángüez, Á., Hahn, T. A., & Kochanowski, J. (2026) · IEEE Transactions on Information Theory · doi:10.1109/tit.2026.3680247 · Cited by 7
Complexity of geometrically local stoquastic Hamiltonians
Raza, A., Eisert, J., & Grilo, A. B. (2026) · Quantum · doi:10.22331/q-2026-02-11-2004 · Cited by 7
Entanglement Dynamics from Random Product States at Long Times
Huang, Y. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9518187 · Cited by 7
Self-citationGapped Clique Homology on Weighted Graphs is QMA1-Hard and Contained in QMA
King, R., & Kohler, T. (2024) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs61266.2024.00039 · Cited by 7
Quantum Entropy Thermalization
Huang, Y., & Harrow, A. W. (2025) · Communications in Mathematical Physics · doi:10.1007/s00220-025-05268-8 · Cited by 7
Self-citationKernel function based quantum algorithms for finite temperature quantum simulation
Wang, H., Nan, J., Zhang, T., Qiu, X., Chen, W., & Li, X. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.108.085102 · Cited by 7
2D Local Hamiltonian with Area Laws Is QMA-Complete
Huang, Y. (2020) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit44484.2020.9174029 · Cited by 7
Self-citationPolynomial-Time Approximation of Zero-Free Partition Functions
Yao, P., Yin, Y., & Zhang, X. (2022) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.icalp.2022.108 · Cited by 6
Ding, M., King, R., Kiani, B. T., & Anschuetz, E. R. (2026) · Quantum · doi:10.22331/q-2026-03-16-2029 · Cited by 6
Hamiltonian Complexity in the Thermodynamic Limit
Aharonov, D., & Irani, S. (2025) · Journal of the ACM · doi:10.1145/3769108 · Cited by 6
The Complexity of Simulating Local Measurements on Quantum Systems
Gharibian, S., & Yirka, J. (2018) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.tqc.2017.2 · Cited by 6
Self-citationComplexity growth of BTZ black hole in massive gravity with a null string
Zhou, Y. (2023) · The European Physical Journal C · doi:10.1140/epjc/s10052-023-12260-w · Cited by 6
A simple efficient algorithm in frustration-free one-dimensional gapped systemsPreprint
Huang, Y. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1510.01303 · Cited by 6
Self-citationEntanglement area law in interacting bosons from the Bose-Hubbard model to ϕ4 theory and beyond
Kim, D., & Kuwahara, T. (2026) · Nature Communications · doi:10.1038/s41467-026-72404-w · Cited by 5
On the complexity of the succinct state local Hamiltonian problem
Waite, G., & Lin, K. (2026) · npj Quantum Information · doi:10.48550/arxiv.2509.25821 · Cited by 5
Pointer Quantum PCPs and Multi-Prover Games
Grilo, A. B., Kerenidis, I., & Pereszlényi, A. (2016) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.mfcs.2016.21 · Cited by 5
A Comparison of Three Ways to Measure Time-Dependent Densities With Quantum Simulators
Yang, J., Brown, J. C., & Whitfield, J. D. (2021) · Frontiers in Physics · doi:10.3389/fphy.2021.546538 · Cited by 5
Fawzi, H., Fawzi, O., & Scalet, S. O. (2022) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.itcs.2023.49 · Cited by 4
Louiz, A. (2023) · WSEAS Transactions on Computers archive · doi:10.37394/23205.2023.22.19 · Cited by 4
Quantum Fluctuation on the Worldsheet of Probe String in BTZ Black Hole
Zhou, Y., & Kuang, X. (2025) · Fortschritte der Physik · doi:10.1002/prop.70001 · Cited by 4
Correlations in quantum spin systems from the boundary effect
Cho, J. (2015) · New Journal of Physics · doi:10.1088/1367-2630/17/5/053021 · Cited by 4
Robustness of QMA against witness noise
Dziemba, F. A. (2017) · Quantum Information and Computation · doi:10.26421/qic17.13-14-6 · Cited by 4
Operator Learning Renormalization GroupPreprint
Luo, X.-Z., Luo, D., & Melko, R. G. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2403.03199 · Cited by 5
Commuting Local Hamiltonians Beyond 2DPreprint
Bostanci, J., & Hwang, Y. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2410.10495 · Cited by 4
Quasiprobabilistic Imaginary-Time Evolution on Quantum Computers
Ray, A., Swaroop, E., Cao, N., Vasmer, M., & Chowdhury, A. C. N. (2026) · Quantum Information and Computation · doi:10.2478/qic-2026-0005 · Cited by 3
Translationally Invariant Constraint Optimization Problems
Aharonov, D., & Irani, S. (2022) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.ccc.2023.23 · Cited by 3
Lower Bounds for Arithmetic Circuits via the Hankel Matrix
Fijalkow, N., Lagarde, G., Ohlmann, P., & Serre, O. (2021) · Computational Complexity · doi:10.1007/s00037-021-00214-1 · Cited by 3
Ground State Preparation via QubitizationPreprint
Marteau, C. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2306.14993 · Cited by 3
Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hardPreprint
Incudini, M., Gyurik, C., Molteni, R., & Dunjko, V. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2412.14932 · Cited by 3
Approximating the operator norm of local Hamiltonians via few quantum statesPreprint
Becker, L., Slote, J., Vol'berg, A. L., & Zhang, H. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2509.11979 · Cited by 3
On the complexity of estimating ground state entanglement and free energyPreprint
Gharibian, S., & Kamminga, J. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2510.06796 · Cited by 3
Self-citationTong, X.-H., & Kuwahara, T. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2509.25572 · Cited by 3
Dequantization Barriers for Guided Stoquastic HamiltoniansPreprint
Hamoudi, Y., Borgne, Y. L., & Sridhara, S. T. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2602.23183 · Cited by 3
Tiwary, S., & Moore, J. E. (2026) · Physical review. B./Physical review. B · doi:10.1103/51bk-vrp4 · Cited by 2
Chia, N.-H., Hasegawa, A., Gall, F. L., & Shen, Y.-C. (2026) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.ccc.2026.12 · Cited by 2
On Efficiently Solvable Cases of Quantum k-SAT
Aldi, M., de Beaudrap, N., Gharibian, S., & Saeedi, S. (2018) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.mfcs.2018.38 · Cited by 2
Self-citationMatched Instances of Quantum Satisfiability (QSat) – Product State Solutions of Restrictions
Goerdt, A. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-19955-5_14 · Cited by 2
LIPIcs, Volume 73, TQC'17, Complete Volume
Wilde, M. M. (2018) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.tqc.2017 · Cited by 2
Behavior of O(log n) Local Commuting Hamiltonians
Mehta, J. C. (2016) · CaltechTHESIS (California Institute of Technology) · doi:10.7907/z9v98611 · Cited by 2
Geometric and computational aspects of chiral topological quantum matterPreprint
Golan, O. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.10897 · Cited by 2
Exact Diagonalization of Sums of Hamiltonians and Products of UnitariesPreprint
Šoda, B., & Kempf, A. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2206.09927 · Cited by 2
Product states optimize quantum $p$-spin models for large $p$Preprint
Anschuetz, E. R., Gamarnik, D., & Kiani, B. T. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2309.11709 · Cited by 2
An Entropy-Governed Speedup for Quantum Algorithms on Local HamiltoniansPreprint
Mataraarachchi, R., Gall, F. L., & Tamaki, S. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2605.18241 · Cited by 2
Quantitative semidefinite certificates for ground-state energies of Pauli HamiltoniansPreprint
Klep, I., Leijenhorst, N., & Magron, V. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2605.29959 · Cited by 2
Fine-tuning small reasoning models for quantum field theory
Woodward, N., Gao, Z., Kvasiuk, Y., Smith, K. M., Sala, F., & Münchmeyer, M. (2026) · Machine Learning Science and Technology · doi:10.1088/2632-2153/aea39e · Cited by 1
Predictive Complexity of Quantum Subsystems
Asplund, C. T., & Panciu, E. (2024) · Entropy · doi:10.3390/e26121065 · Cited by 1
An Unholy Trinity: TFNP, Polynomial Systems, and the Quantum Satisfiability Problem
Aldi, M., Gharibian, S., & Rudolph, D. (2024) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.itcs.2026.7 · Cited by 1
Self-citationEquivalence in logic and philosophy of science
Haro, S. D., & Butterfield, J. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780198846338.003.0011 · Cited by 1
Quantum SAT Problems with Finite Sets of Projectors Are Complete for a Plethora of Classes
Cardoso, R. R., Meiburg, A., & Nagaj, D. (2025) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.tqc.2025.6 · Cited by 1
Quantum Stochastic Processes and Quantum Many-Body Physics
Bausch, J. (2017) · Apollo (University of Cambridge) · doi:10.17863/cam.16755 · Cited by 1
Complexity and simulation of many-body quantum systems
Piddock, S. (2019) · Bristol Research (University of Bristol) · Cited by 1
Non-equilibrium dynamics in quantum simulators
Gluza, M. (2020) · Refubium (Universitätsbibliothek der Freien Universität Berlin) · doi:10.17169/refubium-28577 · Cited by 1
On Lagrangian Formalism of Quantum ComputationPreprint
Xu, J. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2112.04892 · Cited by 1
Free Snacks in Quantum ComplexityPreprint
McCaul, G. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2509.04618 · Cited by 1
Quantum qomrades: catalysts in resource theories and memories in dynamic programming
Son, J. (2025) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/202519 · Cited by 1
Chia, N.-H., & Shen, Y.-C. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2510.07495 · Cited by 1
Bopardikar, S., Montoya, M., Decoodt, P., Pulido, J. G. L., & Sierra-Sosa, D. (2024) · Research Square · doi:10.21203/rs.3.rs-3922115/v1 · Cited by 1
Rounding Almost Commuting HamiltoniansPreprint
Faisal, I., Natarajan, A., & Poremba, A. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2605.26096 · Cited by 1
Existence of a Thermodynamic Limit and Correlations in Quantum Spin SystemsPreprint
Cho, J. (2013) · arXiv (Cornell University)
Quantum Computation Beyond the Unitary Circuit Model
Usher, N. (2017) · UCL Discovery (University College London)
The complexity of simulating quantum physics: dynamics and equilibrium
Deshpande, A. (2021) · University Libraries (University of Maryland) · doi:10.13016/dalh-5dhv
On Polynomially Many Queries to NP or QMA Oracles
Gharibian, S., & Rudolph, D. (2021) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.itcs.2022.75
Self-citation(2019) · SciPost Physics · doi:10.21468/scipost.report.1133
(2019) · SciPost Physics · doi:10.21468/scipost.report.1118
Approximate Constraint Satisfaction in the Quantum Setting.
Gharibian, S., Parekh, O., & Ryan-Anderson, C. (2018) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)
Self-citationHosseinzadeh, A., & Alonso, M. N. I. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4944437
Haro, S. D., & Butterfield, J. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780198846338.003.0015
Haro, S. D., & Butterfield, J. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780198846338.003.0003
Haro, S. D., & Butterfield, J. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780198846338.003.0016
Haro, S. D., & Butterfield, J. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780198846338.002.0003
The geometric view of theories
Haro, S. D., & Butterfield, J. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780198846338.003.0014
Duality and theoretical equivalence
Haro, S. D., & Butterfield, J. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780198846338.003.0012
Elements of string theory dualities
Haro, S. D., & Butterfield, J. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780198846338.003.0008
Haro, S. D., & Butterfield, J. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780198846338.002.0004
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.