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
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
Comments on holographic complexity
Carmi, D., Myers, R. C., & Rath, P. (2017) · Journal of High Energy Physics · doi:10.1007/jhep03(2017)118 · Cited by 292
Machine learning topological states
Deng, D.-L., Li, X., & Das Sarma, S. (2017) · Physical Review B · doi:10.1103/physrevb.96.195145 · Cited by 290
Liouville action as path-integral complexity: from continuous tensor networks to AdS/CFT
Caputa, P., Kundu, N., Miyaji, M., Takayanagi, T., & Watanabe, K. (2017) · Journal of High Energy Physics · doi:10.1007/jhep11(2017)097 · Cited by 270
Complexity of formation in holography
Chapman, S., Marrochio, H., & Myers, R. C. (2017) · Journal of High Energy Physics · doi:10.1007/jhep01(2017)062 · Cited by 248
Faster ground state preparation and high-precision ground energy estimation with fewer qubits
Ge, Y., Tura, J., & Cirac, J. I. (2019) · Journal of Mathematical Physics · doi:10.1063/1.5027484 · Cited by 244
Exploring Entanglement and Optimization within the Hamiltonian Variational Ansatz
Wiersema, R., Zhou, C., de Sereville, Y., Carrasquilla, J. F., Kim, Y. B., & Yuen, H. (2020) · PRX Quantum · doi:10.1103/prxquantum.1.020319 · Cited by 235
Quantum Computing: Lecture NotesPreprint
de Wolf, R. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.09415 · Cited by 221
Quantum Gibbs Samplers: The Commuting Case
Kastoryano, M. J., & Brandão, F. G. S. L. (2016) · Communications in Mathematical Physics · doi:10.1007/s00220-016-2641-8 · Cited by 111
Quantum algorithmic measurement
Aharonov, D., Cotler, J., & Qi, X.-L. (2022) · Nature Communications · doi:10.1038/s41467-021-27922-0 · Cited by 95
Circuit complexity for free fermions
Hackl, L., & Myers, R. C. (2018) · Journal of High Energy Physics · doi:10.1007/jhep07(2018)139 · Cited by 196
Action growth for AdS black holes
Cai, R.-G., Ruan, S.-M., Wang, S.-J., Yang, R.-Q., & Peng, R.-H. (2016) · Journal of High Energy Physics · doi:10.1007/jhep09(2016)161 · Cited by 196
Hamiltonian Simulation by Uniform Spectral AmplificationPreprint
Low, G. H., & Chuang, I. L. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1707.05391 · Cited by 185
Leverrier, A., Tillich, J.-P., & Zemor, G. (2015) · 2015 IEEE 56th Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2015.55 · Cited by 86
Strategies for solving the Fermi-Hubbard model on near-term quantum computers
Cade, C., Mineh, L., Montanaro, A., & Stanisic, S. (2020) · Physical Review B · doi:10.1103/physrevb.102.235122 · Cited by 178
“Although this problem is expected to be computationally hard for quantum computers in the worst case [9], it is plausible that instances of practical importance could nevertheless be solved efficiently.”
BackgroundCircuit complexity in interacting QFTs and RG flows
Bhattacharyya, A., Shekar, A., & Sinha, A. (2018) · Journal of High Energy Physics · doi:10.1007/jhep10(2018)140 · Cited by 158
Complexity of Quantum Impurity Problems
Bravyi, S., & Gosset, D. (2017) · Communications in Mathematical Physics · doi:10.1007/s00220-017-2976-9 · Cited by 84
On the Representation of Boolean and Real Functions as Hamiltonians for Quantum Computing
Hadfield, S. (2021) · ACM Transactions on Quantum Computing · doi:10.1145/3478519 · Cited by 86
Neural Network Representation of Tensor Network and Chiral States
Huang, Y., & Moore, J. E. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.170601 · Cited by 68
Self-citationTime evolution of complexity: a critique of three methods
Ali, T., Bhattacharyya, A., Haque, S. S., Kim, E. H., & Moynihan, N. (2019) · Journal of High Energy Physics · doi:10.1007/jhep04(2019)087 · Cited by 138
Improved Thermal Area Law and Quasilinear Time Algorithm for Quantum Gibbs States
Kuwahara, T., Alhambra, A. M., & Anshu, A. (2021) · Physical Review X · doi:10.1103/physrevx.11.011047 · Cited by 109
Clustering of Conditional Mutual Information for Quantum Gibbs States above a Threshold Temperature
Kuwahara, T., Kato, K., & Brandão, F. G. S. L. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.220601 · Cited by 102
Holographic subregion complexity under a thermal quench
Chen, B., Li, W.-M., Yang, R.-Q., Zhang, C.-Y., & Zhang, S.-J. (2018) · Journal of High Energy Physics · doi:10.1007/jhep07(2018)034 · Cited by 96
Universal eigenstate entanglement of chaotic local Hamiltonians
Huang, Y. (2018) · Nuclear Physics B · doi:10.1016/j.nuclphysb.2018.09.013 · Cited by 83
Self-citationEigenstate entanglement in the Sachdev-Ye-Kitaev model
Huang, Y., & Gu, Y. (2019) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.100.041901 · Cited by 82
Self-citationGharibian, S., & Gall, F. L. (2022) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3519935.3519991 · Cited by 79
Self-citationApproximation algorithms for quantum many-body problems
Bravyi, S. B., Gosset, D., König, R., & Temme, K. (2019) · Journal of Mathematical Physics · doi:10.1063/1.5085428 · Cited by 76
Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut
Gharibian, S., & Parekh, O. (2019) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.approx-random.2019.31 · Cited by 76
Self-citationClassical verification of quantum proofs
Ji, Z. (2016) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2897518.2897634 · Cited by 69
Certified algorithms for equilibrium states of local quantum Hamiltonians
Fawzi, H., Fawzi, O., & Scalet, S. O. (2024) · Nature Communications · doi:10.1038/s41467-024-51592-3 · Cited by 67
Spread and spectral complexity in quantum spin chains: from integrability to chaos
Camargo, H. A., Huh, K.-B., Jahnke, V., Jeong, H.-S., Kim, K.-Y., & Nishida, M. (2024) · Journal of High Energy Physics · doi:10.1007/jhep08(2024)241 · Cited by 67
Herrera, F., Cao, Y., Kais, S., & Whaley, K. B. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/7/075001 · Cited by 65
Equilibration towards generalized Gibbs ensembles in non-interacting theories
Gluza, M., Eisert, J., & Farrelly, T. (2019) · SciPost Physics · doi:10.21468/scipostphys.7.3.038 · Cited by 64
Surface counterterms and regularized holographic complexity
Yang, R.-Q., Niu, C., & Kim, K.-Y. (2017) · Journal of High Energy Physics · doi:10.1007/jhep09(2017)042 · Cited by 62
The Complexity of Translationally Invariant Spin Chains with Low Local Dimension
Bausch, J., Cubitt, T. S., & Ozols, M. (2017) · Annales Henri Poincaré · doi:10.1007/s00023-017-0609-7 · Cited by 59
Learning Quantum Hamiltonians at Any Temperature in Polynomial Time
Bakshi, A., Liu, A., Moitra, A., & Tang, E. (2024) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3618260.3649619 · Cited by 58
Double-Bracket Quantum Algorithms for Quantum Imaginary-Time Evolution
Gluza, M., Son, J., Tiang, B. H., Zander, R., Seidel, R., Suzuki, Y., Holmes, Z., & Ng, N. H. Y. (2026) · Physical Review Letters · doi:10.1103/rw81-k8vk · Cited by 59
Polynomial-Time Classical Simulation of Quantum Ferromagnets
Bravyi, S. B., & Gosset, D. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.100503 · Cited by 53
Testing holographic conjectures of complexity with Born–Infeld black holes
Tao, J., Wang, P., & Yang, H. (2017) · The European Physical Journal C · doi:10.1140/epjc/s10052-017-5395-3 · Cited by 53
Complexity of holographic superconductors
Yang, R.-Q., Jeong, H.-S., Niu, C., & Kim, K.-Y. (2019) · Journal of High Energy Physics · doi:10.1007/jhep04(2019)146 · Cited by 51
Complexity of Supersymmetric Systems and the Cohomology Problem
Cade, C., & Crichigno, P. M. (2024) · Quantum · doi:10.22331/q-2024-04-30-1325 · Cited by 50
Gharibian, S., & Gall, F. L. (2023) · SIAM Journal on Computing · doi:10.1137/22m1513721 · Cited by 47
Self-citationA Multiprover Interactive Proof System for the Local Hamiltonian Problem
Fitzsimons, J. F., & Vidick, T. (2015) · Conference on Innovations in Theoretical Computer Science · doi:10.1145/2688073.2688094 · Cited by 43
Unique Games hardness of Quantum Max-Cut, and a conjectured vector-valued Borell's inequality
Hwang, Y., Neeman, J., Parekh, O., Thompson, K., & Wright, J. (2023) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611977554.ch48 · Cited by 42
The Philosophy and Physics of Duality
Haro, S. D., & Butterfield, J. (2025) · doi:10.1093/oso/9780198846338.001.0001 · Cited by 41
Clocks in Feynman's computer and Kitaev's local Hamiltonian: Bias, gaps, idling, and pulse tuning
Caha, L., Landau, Z. A., & Nagaj, D. (2018) · Physical Review A · doi:10.1103/physreva.97.062306 · Cited by 42
Self-citationCui, S. X., Freedman, M. H., Sattath, O., Stong, R., & Minton, G. (2016) · Journal of Mathematical Physics · doi:10.1063/1.4954231 · Cited by 41
Entanglement and correlation functions of the quantum Motzkin spin-chain
Movassagh, R. (2017) · Journal of Mathematical Physics · doi:10.1063/1.4977829 · Cited by 40
The pair-flip model: a very entangled translationally invariant spin chainPreprint
Caha, L., & Nagaj, D. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.07168 · Cited by 41
Correlation Length versus Gap in Frustration-Free Systems
Gosset, D., & Huang, Y. (2016) · Physical Review Letters · doi:10.1103/physrevlett.116.097202 · Cited by 39
Self-citationThe complexity of simulating local measurements on quantum systems
Gharibian, S., & Yirka, J. (2019) · Quantum · doi:10.22331/q-2019-09-30-189 · Cited by 39
Self-citationAharonov, D., Ben-Or, M., Brandão, F. G. S. L., & Sattath, O. (2022) · Quantum · doi:10.22331/q-2022-03-17-668 · Cited by 37
Ground State Connectivity of Local Hamiltonians
Gharibian, S., & Sikora, J. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-47672-7_50 · Cited by 36
Self-citationImportance of the Spectral gap in Estimating Ground-State Energies
Deshpande, A., Gorshkov, A. V., & Fefferman, B. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.040327 · Cited by 35
Learning Quantum Hamiltonians at Any Temperature in Polynomial Time
Bakshi, A., Liu, A., Moitra, A., & Tang, E. (2026) · SIAM Journal on Computing · doi:10.1137/24m1690965 · Cited by 34
Wang, P., Yang, H., & Ying, S. (2017) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.96.046007 · Cited by 33
Optimizing sparse fermionic Hamiltonians
Herasymenko, Y., Stroeks, M., Helsen, J., & Terhal, B. M. (2023) · Quantum · doi:10.22331/q-2023-08-10-1081 · Cited by 32
Bosonic model of quantum holography
Swingle, B. G., & Winer, M. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.109.094206 · Cited by 32
Aharonov, D., & Grilo, A. B. (2019) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2019.00065 · Cited by 30
Realistic Area-Law Bound on Entanglement from Exponentially Decaying Correlations
Cho, J. (2018) · Physical Review X · doi:10.1103/physrevx.8.031009 · Cited by 30
Hybrid Quantum-Classical Heuristic to Solve Large-Scale Integer Linear Programs
Svensson, M., Andersson, M., Grönkvist, M., Vikstål, P., Dubhashi, D., Ferrini, G., & Johansson, G. (2023) · Physical Review Applied · doi:10.1103/physrevapplied.20.034062 · Cited by 29
Determining quantum Monte Carlo simulability with geometric phases
Hen, I. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.023080 · Cited by 28
Exponential Clustering of Bipartite Quantum Entanglement at Arbitrary Temperatures
Kuwahara, T., & Saito, K. (2022) · Physical Review X · doi:10.1103/physrevx.12.021022 · Cited by 26
Evolutions of entanglement and complexity after a thermal quench in massive gravity theory
Zhou, Y., Ghodrati, M., Kuang, X., & Wu, J.-P. (2019) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.100.066003 · Cited by 26
Universal scaling laws for correlated decay of many-body quantum systems
Mok, W.-K., Poddar, A., Sierra, E., Rusconi, C. C., Preskill, J., & Asenjo-Garcia, A. (2024) · Nature Physics · doi:10.1038/s41567-026-03448-4 · Cited by 24
Complexity growth of rotating black holes with a probe string
Nagasaki, K. (2018) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.98.126014 · Cited by 25
Quantum advantage from energy measurements of many-body quantum systems
Novo, L., Bermejo-Vega, J., & García−Patrón, R. (2021) · Quantum · doi:10.22331/q-2021-06-02-465 · Cited by 25
Piddock, S., & Montanaro, A. (2021) · Communications in Mathematical Physics · doi:10.1007/s00220-021-03940-3 · Cited by 24
Sign Problem in Tensor-Network Contraction
Chen, J., Jiang, J., Hangleiter, D., & Schuch, N. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.010312 · Cited by 23
Gapped Clique Homology on Weighted Graphs Is \({\text{QMA}_1}\)-Hard and Contained in QMA
King, R., & Kohler, T. (2026) · SIAM Journal on Computing · doi:10.1137/24m1710243 · Cited by 23
Holographic fluctuations and the principle of minimal complexity
Chemissany, W. A., & Osborne, T. J. (2016) · Journal of High Energy Physics · doi:10.1007/jhep12(2016)055 · Cited by 22
An Improved Quantum Max Cut Approximation via Maximum Matching
Lee, E., & Parekh, O. (2024) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.icalp.2024.105 · Cited by 21
Approximating Local Properties by Tensor Network States With Constant Bond Dimension
Huang, Y. (2026) · IEEE Transactions on Information Theory · doi:10.1109/tit.2026.3694133 · Cited by 21
Self-citationA polynomial-time algorithm for the ground state of one-dimensional gapped HamiltoniansPreprint
Huang, Y. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1406.6355 · Cited by 21
Self-citationClassical simulation of quantum many-body systems
Huang, Y. (2015) · eScholarship (California Digital Library) · Cited by 21
Self-citationVariational wave functions for Sachdev-Ye-Kitaev models
Haldar, A., Tavakol, O., & Scaffidi, T. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.023020 · Cited by 20
Gibbs state preparation for commuting Hamiltonian: Mapping to classical Gibbs sampling
Hwang, Y., & Jiang, J. (2026) · Quantum · doi:10.22331/q-2026-09-18-2209 · Cited by 20
Quantum Computing 2022Preprint
Whitfield, J. D., Yang, J., Wang, W., Heath, J. T., & Harrison, B. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2201.09877 · Cited by 20
Mallick, B., Maity, A. G., Ganguly, N., & Majumdar, A. S. (2025) · Physical Review A · doi:10.1103/nzrc-8yrt · Cited by 19
High Schmidt Number Concentration in Quantum Bound Entangled States
Krebs, R., & Gachechiladze, M. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.220203 · Cited by 19
Universal quantum computation by scattering in the Fermi–Hubbard model
Bao, N., Hayden, P. M., Salton, G., & Thomas, N. (2015) · New Journal of Physics · doi:10.1088/1367-2630/17/9/093028 · Cited by 19
Entropy constraints for ground energy optimization
Fawzi, H., Fawzi, O., & Scalet, S. O. (2024) · Journal of Mathematical Physics · doi:10.1063/5.0159108 · Cited by 19
Approximation Algorithms for Noncommutative CSPs
Culf, E., Mousavi, H., & Spirig, T. (2024) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs61266.2024.00061 · Cited by 18
On connectivity-dependent resource requirements for digital quantum simulation of d-level particles
Sawaya, N. P. D., Guerreschi, G. G., & Holmes, A. A. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00031 · Cited by 18
Tensor network non-zero testing
Gharibian, S., Landau, Z. A., Shin, S. W., & Wang, G. (2015) · Quantum Information and Computation · doi:10.26421/qic15.9-10-7 · Cited by 17
Self-citationInterior Point Methods for Structured Quantum Relative Entropy Optimization Problems
He, K., Saunderson, J., & Fawzi, H. (2025) · Mathematical Programming Computation · doi:10.1007/s12532-025-00296-w · Cited by 17
Krumnow, C., Veis, L., Eisert, J., & Legeza, Ö. (2021) · Physical review. B./Physical review. B · doi:10.1103/physrevb.104.075137 · Cited by 16
Quantum Information and Computation for Chemistry
Olson, J., Cao, Y., Romero, J., Johnson, P., Dallaire-Demers, P.-L., Sawaya, N., Narang, P., Kivlichan, I., Wasielewski, M., & Aspuru-Guzik, A. (2017) · arXiv · doi:10.48550/arxiv.1706.05413 · Cited by 15
“From the formal perspective, tools from theoretical computer science have deepened our understanding of what makes a quantum system hard to simulate on a classical computer (Gharibian et al., 2015).”
BackgroundThe Complexity of Translationally Invariant Problems Beyond Ground State Energies
Watson, J. D., Bausch, J., & Gharibian, S. (2020) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.stacs.2023.54 · Cited by 14
Self-citationEntanglement dynamics in critical random quantum Ising chain with perturbations
Huang, Y. (2017) · Annals of Physics · doi:10.1016/j.aop.2017.02.018 · Cited by 14
Self-citationExtracting the spin excitation spectrum of a fermionic system using a quantum processor
Vilchez-Estevez, L., Santos, R. A., Wang, S. Y., & Gambetta, F. M. (2025) · Physical review. B./Physical review. B · doi:10.1103/ydfw-k83n · Cited by 13
Li, J., & Zur, S. (2025) · Quantum · doi:10.22331/q-2025-05-06-1733 · Cited by 13
Computational complexity of the ground state energy density problem
Watson, J. D., & Cubitt, T. S. (2022) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3519935.3520052 · Cited by 13
Classically Computing Performance Bounds on Depolarized Quantum Circuits
Mishra, S. D., Frías-Pérez, M., & Trivedi, R. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.020317 · Cited by 12
A square-root speedup for finding the smallest eigenvalue
Kerzner, A., Gheorghiu, V., Mosca, M., Guilbaud, T., Carminati, F., Fracas, F., & Dellantonio, L. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad6a36 · Cited by 12
Deviation From Maximal Entanglement for Mid-Spectrum Eigenstates of Local Hamiltonians
Huang, Y. (2024) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2024.3487856 · Cited by 12
Self-citation
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.