Computational complexity of interacting electrons and fundamental limitations of density functional theory
Open accessThe DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Abstract
Using arguments from computational complexity theory, fundamental limitations are found for how efficient it is to calculate the ground-state energy of many-electron systems using density functional theory. One of the central problems in quantum mechanics is to determine the ground-state properties of a system of electrons interacting through the Coulomb potential. Since its introduction1,2, density functional theory has become the most widely used and successful method for simulating systems of interacting electrons. Here, we show that the field of computational complexity imposes fundamental limitations on density functional theory. In particular, if the associated ‘universal functional’ could be found efficiently, this would imply that any problem in the computational complexity class Quantum Merlin Arthur could be solved efficiently. Quantum Merlin Arthur is the quantum version of the class NP and thus any problem in NP could be solved in polynomial time. This is considered highly unlikely. Our result follows from the fact that finding the ground-state energy of the Hubbard model in an external magnetic field is a hard problem even for a quantum computer, but, given the universal functional, it can be computed efficiently using density functional theory. This work illustrates how the field of quantum computing could be useful even if quantum computers were never built.
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 cited source says what the claim attributes to it.
In the citing paper
“Although this programme is not yet complete, it has already provided some formal justi fi cation for empirical observations in condensed-matter physics about relative hardness of these problems.”
From Quantum algorithms: an overview (2016) · cites this paper as [81]
In the citing paper
“For systems of electrons, one common methodology to avoid treating the size of the full many-electron wave function is density functional theory (DFT) 77,78 . All degrees of freedom of the electronic system are integrated out, except for the density.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [78]
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
Self-Consistent Equations Including Exchange and Correlation Effects
Kohn, W., & Sham, L. J. (1965) · Physical Review · doi:10.1103/physrev.140.a1133 · Cited by 64,135 · cited 1×
“As the functional (3) is convex and the physical λi,s,s′ form a convex set in R4N, the minimization in equation (2) (up to polynomial accuracy) can be carried out efficiently16; that is, finding the ground-state energy of the Hubbardmodel is in P.”
BackgroundHohenberg, P., & Kohn, W. (1964) · Physical Review · doi:10.1103/physrev.136.b864 · Cited by 53,541
Density-functional theory of atoms and molecules
Patterson, J. D. (1989) · Annals of Nuclear Energy · doi:10.1016/0306-4549(89)90016-9 · Cited by 12,545
Density Functional Theory of Atoms and Molecules
Parr, R. G. (1980) · Horizons of Quantum Chemistry · doi:10.1007/978-94-009-9027-2_2 · Cited by 11,964 · cited 2×
“V -representability [ 14 ]: given a local density ρ(r), does there exist a potential V (r) such that the Hamiltonian T + I + V [Eq. (1)] has a unique ground state with local density ρ(r)? The lattice version of the problem is the following: Given a local density ρ on the lattice, decide whether there exists a potentia…”
BackgroundMethodElectron 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 · cited 3×
“6, and has been included in the Supplementary Information: in (4), we choose an on-site repulsion U very large as compared to t , and operate the system in the so-called half-occupancy regime where there are as many electrons as sites.”
BackgroundMethodA Simplification of the Hartree-Fock Method
Slater, J. C. (1951) · Physical Review · doi:10.1103/physrev.81.385 · Cited by 4,584 · cited 1×
“As the functional (3) is convex and the physical λi,s,s′ form a convex set in R4N, the minimization in equation (2) (up to polynomial accuracy) can be carried out efficiently16; that is, finding the ground-state energy of the Hubbardmodel is in P.”
BackgroundGeometric Algorithms and Combinatorial Optimization
Grötschel, M., Lovász, L., & Schrijver, A. (1988) · Algorithms and Combinatorics · doi:10.1007/978-3-642-97881-4 · Cited by 3,431 · cited 1×
“As the functional (3) is convex and the physical λ i , s , s ′ form a convex set in , the minimization in equation (2) (up to polynomial accuracy) can be carried out efficientl”
BackgroundDreizler, R. M., & Gross, E. K. U. (1990) · Springer eBooks · doi:10.1007/978-3-642-86105-5 · Cited by 2,570
Interacting Electrons and Quantum Magnetism
Auerbach, A. (1994) · Graduate Texts in Contemporary Physics · doi:10.1007/978-1-4612-0869-3 · Cited by 1,738 · cited 1×
“in [ 2 , 8]. Except for being a special case of interacting electrons, the Hubbard model is of high interest on its own, as it is believed to be the appropriate model for understanding effects like high-temperature superconductivity, quantum magnetism, and heavy fermions.”
BackgroundClassical and Quantum Computation
Kitaev, A., Shen, A., & Vyalyi, M. (2002) · Graduate Studies in Mathematics · doi:10.1090/gsm/047 · Cited by 1,387
Cited by
Items 201–283 of 283
Hodala, A. J., Wood, I. G., & Carbone, P. (2025) · Journal of Molecular Liquids · doi:10.1016/j.molliq.2025.127410 · Cited by 4
Efficient state initialization by a quantum spectral filtering algorithm
Fillion‐Gourdeau, F., MacLean, S. G., & Laflamme, R. (2017) · Physical Review A · doi:10.1103/physreva.95.042331 · Cited by 6
Quantum Zeno approach for molecular energies with maximum commuting initial Hamiltonians
Yu, H., & Wei, T.-C. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.013104 · Cited by 5
“Very often the claim of such hardness requires inclusion of certain randomness, such as a random local field or some random couplings [46].”
BackgroundTesting Quantum Circuits and Detecting Insecure Encryption
Rosgen, B. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-35656-8_6 · Cited by 5
“Other problems related to finding ground states of physical systems are also known to be complete for QMA [20, 21].”
BackgroundComputability and Complexity of Unconventional Computing DevicesPreprint
Broersma, H. J., Stepney, S., & Wendin, G. P. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1702.02980 · Cited by 6
“Electronic structure calculation with full account of many-body interactions is QMA -hard (Aaronson; 2009; Schuch and Verstraete; 2009; Whitfield et al.; 2013).”
BackgroundComplexity of the XY antiferromagnet at fixed magnetization
Childs, A. M., Gosset, D., & Webb, Z. (2016) · Quantum Information and Computation · doi:10.26421/qic16.1-2 · Cited by 4
“07 08 3v 1 [ qu an t- ph ] 2 4 M ar 2 01”
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
Captured weight and boundary leakage bound the error of sample-based spectral functionsPreprint
Vargas, N. B. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2608.16436 · Cited by 4
A Performance Model for Estimating the Cost of Scaling to Practical Quantum Advantage
Camps, D., Klymko, K., Austin, B. M., & Wright, N. J. (2023) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/3624062.3625533 · Cited by 3
“…configurations of the Hubbard model (e.g., a 2D triangular lattice with frustration, or for the three-band Hubbard model) must lead to quantum advantage because it has been shown that finding the ground state of the Hubbard Hamiltonian is among the hardest problems in the QMA complexity class [27].”
BackgroundMethodLower 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
Vassetti, D., & Labat, F. (2022) · Journal of Computational Chemistry · doi:10.1002/jcc.26944 · Cited by 3
Pemmaraju, C. D., & Deshmukh, A. A. (2022) · Physical Review A · doi:10.1103/physreva.106.042807 · Cited by 3
Semicoherent symmetric quantum processes: Theory and applications
Wang, Y., Chehade, S., & Dumitrescu, E. (2024) · AVS Quantum Science · doi:10.1116/5.0215919 · Cited by 3
“𝑝 = 2 is sufficient for symHVA to reach the exact ground state energy (GSE) within (classical) machine precision, as shown in Fig.”
BackgroundLearning density functionals from noisy quantum data
Koridon, E., Frohnert, F., Prehn, E., van Nieuwenburg, E., Tura, J., & Polla, S. (2025) · Machine Learning Science and Technology · doi:10.1088/2632-2153/adcb89 · Cited by 4
“Although exact universal functionals theoretically exist, their general explicit form is unknown, and their evaluation would necessarily be computationally intractable [13].”
Perspective on Moreau–Yosida regularization in density-functional theory
Penz, M., Herbst, M. F., Helgaker, T. U., & Laestadius, A. (2026) · Electronic Structure · doi:10.1088/2516-1075/ae55eb · Cited by 3
“For the interacting case, however, F 1 ( ρ ) is in principle unavailable since its evaluation corresponds to a quantum version of an NP-hard problem [44].”
Warming Up Density Functional TheoryPreprint
Smith, J. C., Sagredo, F., & Burke, K. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1701.00873 · Cited by 3
“on energy and bond length(s). A substantially more sophisticated test occurs when a highly accurate calculation is performed such as QMC[CKB79; NU99] or DMRG[W92], and an inversion of the KS equations[SV09], so that essentially exact KS potentials, eigenvalues, orbitals, etc, can all be deduced. This is a much more po…”
MethodExact density functional theory with the density matrix renormalization groupPreprint
Stoudenmire, E. M., Wagner, L. O., White, S. R., & Burke, K. (2011) · arXiv (Cornell University) · Cited by 3
PAC-learning of free-fermionic states is NP-hard
Bittel, L., Mele, A. A., Eisert, J., & Leone, L. (2025) · Quantum · doi:10.22331/q-2025-03-20-1665 · Cited by 9
Erhard, J., & Ayers, P. W. (2026) · Physical Review A · doi:10.1103/1gzs-88l4 · Cited by 2
Delgado-Granados, L. H., & Mazziotti, D. A. (2026) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.6c00615 · Cited by 2
Complexity of the XY antiferromagnet at fixed magnetization
Childs, A. M., Gosset, D., & Webb, Z. (2016) · Quantum Information and Computation · doi:10.26421/qic16.1-2-1 · Cited by 2
Pueyo, A. G., & Castro, A. (2018) · The European Physical Journal B · doi:10.1140/epjb/e2018-90109-6 · Cited by 2
Complexity growth for one-dimensional free-fermionic lattice models
Aravinda, S., & Modak, R. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.108.064309 · Cited by 2
Testing quantum circuits and detecting insecure encryptionPreprint
Rosgen, B. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1108.1052 · Cited by 1
“Other problems related to finding ground states of physical systems are also known to be complete for QMA [20, 21].”
BackgroundClassification on the Computational Complexity of Spin ModelsPreprint
Zhang, S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.04122 · Cited by 2
Bundled matrix product states represent low-energy excitations faithfully
Baker, T. E., & Seif, N. (2024) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ad770f · Cited by 1
“However, reducing the problem down to few enough orbitals that a polynomial time solver could be used would imply that the determination of that transformation is not discoverable in polynomial time since the general problem is known to be hard [12].”
BackgroundLIPIcs, Volume 350, TQC 2025, Complete Volume
Fefferman, B. (2025) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.tqc.2025 · Cited by 1
Boutadghart, T., Nour, H., Chtita, S., & Ghaılane, R. (2026) · Computational Biology and Chemistry · doi:10.1016/j.compbiolchem.2026.108976 · Cited by 1
Cheng, Y., Yang, X., Chen, H., Ma, J., Gao, F., Guo, S., Wang, Z., Zhang, L., Xu, L., & Shen, B. (2026) · Fuel · doi:10.1016/j.fuel.2026.139584 · Cited by 1
Carr, J., Volkai, M., Foulkes, W. M. C., & Fadon, A. P. (2026) · The Journal of Chemical Physics · doi:10.1063/5.0334570 · Cited by 1
Approximating ground and excited state energies on a quantum computer
Hadfield, S., & Papageorgiou, A. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-0927-y · Cited by 1
“On the other hand, there are a number of recent results in discrete complexity theory suggesting that many eigenvalue problems are very hard even for quantum computers because they are QMA-complete [20, 38, 33, 9].”
BackgroundEffectiveness of Neural Networks for Research on Novel Thermoelectric Materials. A Proof of Concept
Remonato, F., Løvvik, O. M., & Flage−Larsen, E. (2019) · Communications in computer and information science · doi:10.1007/978-3-030-35664-4_7 · Cited by 1
Linear-time generalized Hartree-Fock algorithm for quasi-one-dimensional systems
Meiburg, A., & Bauer, B. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.023128 · Cited by 1
Ng, E. Z. X., Ang, S. J., Yang, H., Chen, Y., & Wong, M. W. (2025) · Computational Materials Today · doi:10.1016/j.commt.2025.100042 · Cited by 2
Baishnab, N., Khadka, R., Paquette, M. M., Rulis, P., Oyler, N. A., Hwang, J., & Sakidja, R. (2020) · Materials Research Express · doi:10.1088/2053-1591/ab7b2c · Cited by 1
Systematic routes to improved approximations in Kohn–Sham theory
Callow, T. J. (2020) · Durham e-Theses (Durham University) · Cited by 2
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
Miessen, A. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2508.21504 · Cited by 2
On the Computational Complexity of Guided Berry Phase EstimationPreprint
Waite, G. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2609.25929 · Cited by 1
Polynomial-time classical and quantum simulation of quantum impurity modelsPreprint
Jiang, J., Ju, N., Parekh, O., Rayudu, S. S. C., & Zhao, A. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.02167 · Cited by 2
Mathematical contributions to the calculations of electronic structures
Gontier, D. (2015) · theses.fr (ABES) · doi:10.70675/2646ce85z7ae6z43f1zb6ddz0d6a49283f65 · Cited by 1
At the intersection of quantum computing and quantum chemistry
Whitfield, J. D. (2011)
Computational complexity in entanglement transformations
Chitambar, E. (2010) · Deep Blue (University of Michigan) · Cited by 1
Whiteld, J. D. (2011)
Bauer, B. (2011)
Algorithms for Classical and Quantum Simulations
Lubasch, M. (2015) · MPG.PuRe (Max Planck Society)
Bridging the Gap Between the Theoretical and Empirical Reorganization Energy
Johannes, J. (2016) · Libraries and Cultural Resources (University of Calgary) · doi:10.11575/prism/25165
Control, gates, and error suppression with Hamiltonians in quantum computation
Bookatz, A. D. (2016) · DSpace@MIT (Massachusetts Institute of Technology)
Quantum Dots of Indium Nitrides
Pozhar, L. A. (2015) · Elsevier eBooks · doi:10.1016/b978-0-12-396984-2.00006-6
Testing non-isometry is QMA-completePreprint
Rosgen, B. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0910.3740 · Cited by 2
“…other complete problems for QMA are known, such as local consistency [12] (see also [13, 19]), some problems related to the minimum output entropy [2], testing whether unitary circuits are close to the identity [6] (see also [7]), and finding the ground states of some physical systems [16, 17].”
BackgroundSørensen, L. K. (2019) · arXiv (Cornell University)
Complexity and simulation of many-body quantum systems
Piddock, S. (2019) · Bristol Research (University of Bristol) · Cited by 1
On the Theory of Modern Quantum Algorithms.Preprint
Biamonte, J. (2020) · arXiv (Cornell University)
Non-NP-Hardness of Translationally-Invariant Spin-Model ProblemsPreprint
Liss, R., Mor, T., & Shapira, R. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.10092
“In the general Heisenberg Hamiltonian problems analyzed by [30] and [27] (eqs.”
BackgroundMethodWall, M. L. (2015) · Springer theses · doi:10.1007/978-3-319-14252-4_1
Tavazohi, P. (2022) · The Research Repository @ WVU (West Virginia University) · doi:10.33915/etd.11192
“This is due to the two-electron integral [34].”
BackgroundSenjean, B., Yalouz, S., & Saubanère, M. (2022) · SciPost Physics · doi:10.21468/scipost.report.5731
Senjean, B., Yalouz, S., & Saubanère, M. (2022) · SciPost Physics · doi:10.21468/scipost.report.5276
Idini, A. (2023) · Journal of Physics Conference Series · doi:10.1088/1742-6596/2586/1/012155
Symmetry breaking and restoration for many-body problems treated on quantum computersPreprint
Ruiz, A. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2310.17996
Solvatation implicite généralisée pour les systèmes finis et infinis périodiques
Vassetti, D. (2021) · theses.fr (ABES) · doi:10.70675/725de6cez72adz4db5z8635zb98b9412349a
A machine learning ride in the physics theme park: from quantum to biophysics
Requena, B. (2024) · UPCommons institutional repository (Universitat Politècnica de Catalunya) · doi:10.5821/dissertation-2117-409132
Kaicher, M., Dommert, F., Wever, C., Amsler, M., Kühn, M., & QUTAC Material Science Working Group (2025) · Journal of Physics Communications · doi:10.1088/2399-6528/ade75c · Cited by 1
Ab initio simulation of segregation at oxide-metal interfaces in GRX-810 alloy
Tavenner, J. P., Mendelev, M. I., Smith, T. M., & Lawson, J. (2025) · Physical Review Materials · doi:10.1103/8rrp-w6tb
Christiansen‐Salameh, J. (2022) · eCommons (Cornell University) · doi:10.7298/48cg-nj38
Waste to an Asset, H2S to Hydrogen: A DFT Study
Baratifar, S. (2023) · doi:10.11575/prism/41912
Jin, J.-X., Ren, G.-P., Hu, J., Liu, Y., Gao, Y., Wu, K., & He, Y. (2024) · Figshare · doi:10.6084/m9.figshare.26605114
Complexity of Finding and Measuring Ground States in Quantum Systems
Meiburg, A. H. Z. (2023) · eScholarship (California Digital Library)
Superconducting qubit readout and control system based on FPGA and development of a pulse sequencer
BOVE, L. (2025) · Electronic Theses and Dissertations Repository (University of Pisa)
Quantum versus classical resources in computational complexity
Weggemans, J. R. (2025) · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands
Simulation of atomic nuclei and their constituents with quantum computers
Guzman, E. A. R. (2023) · theses.fr (ABES) · doi:10.70675/efb16840z58b5z4c76z8eadzfeae7d3faaaa
Penalty-free quantum algorithm to find energy eigenstates
Ma, N., Dai, H., & Gong, J. (2026) · Physical Review A · doi:10.1103/25rr-mpyj
“The eigenvalues and eigenstates of a many-body Hamiltonian are fundamental elements in both physics research [1–4] and computational applications [5, 6].”
DUSHIMIRIMANA, E. (2026) · Research Square · doi:10.21203/rs.3.rs-9063900/v1
Quantum phase recognition via swap-test-based correlation mechanism
Chen, J.-L., Li, X., & Yin, Z. (2026) · Physical Review A · doi:10.1103/rcjd-bgdb
Overfitting by design: neural network density functionals for water
El-Din, K. K. A., Strachwitz, A. V., Dutra, A. C., & Vinko, S. M. (2026) · npj Computational Materials · doi:10.1038/s41524-026-02224-5
“In principle, a universal XC term exists but it cannot be computed efficiently [10] and in practice, a range of density functional approximations (DFAs) are used instead [11].”
Position: The Inevitable Transition to Machine Learning in Quantum ChemistryPreprint
Sargsyan, K., & Hsu, C. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2607.18281
“This track record does not prove the relevant subset is QMA-hard, but it does suggest the subset resists hand-crafted specialization—which is what makes the decision-theoretic case for ML (Section 1.3) compelling rather than merely abstract.”
InfluentialOumarou, O. (2026) · Kölner Universitäts PublikationsServer (Universität zu Köln)
Ahsan, M., Yasir, M. A., Zafar, R., Tufail, F., Alburaih, H. A., Mumtaz, S., & Xie, F. (2026) · Research Square · doi:10.21203/rs.3.rs-10694014/v1
Spectra at speed: neural force fields for IR spectroscopy in ionic liquids
Oliaei, H. (2025) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign)
Albuquerque, E. L. (2026) · Annual reports in medicinal chemistry · doi:10.1016/bs.armc.2026.09.004
RANJAN, A., & Tiwari, D. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.41146
“As a result, exact diagonalization becomes computationally expensive on classical HPC systems [10], [11].”
Metadata
- Authors
- Schuch, N., & Verstraete, F.
- Affiliations
- Max Planck Institute of Quantum Optics (DE)
- University of Vienna (AT)
- Corresponding author
- Schuch, Norbert
- Verstraete, Frank
- Venue
- Nature Physics
- Published
- 2009-08-23
- Volume
- 5
- Issue
- 10
- Pages
- 732-735
- ISSN
- 1745-2473 (ISSN-L)
- 1745-2481
- OpenAlex
- W2153671025
- Cited by
- 260
- References
- 22
- Citations by year
- 2026: 16 · 2025: 27 · 2024: 14 · 2023: 16 · 2022: 17 · 2021: 22 · 2020: 13 · 2019: 10 · 2018: 11 · 2017: 15 · 2016: 17 · 2015: 15 · 2014: 21 · 2013: 14 · 2012: 11
- FWCI
- 11.19
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- www.springernature.com/gp/researchers/text-and-data-mining (tdm)
- www.springernature.com/gp/researchers/text-and-data-mining (vor)
- Locations
- Nature Physics (publishedVersion)
- arXiv (Cornell University) (acceptedVersion)
- Ghent University Academic Bibliography (Ghent University) (submittedVersion, other-oa)
- Max Planck Institute for Plasma Physics (submittedVersion)
- MPG.PuRe (Max Planck Society) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Kempe Foundation
- Austrian Science Fund
- 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 › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Advanced Chemical Physics Studies
- Keywords
- density functional theory, computational complexity, ground state energy, interacting electrons, Coulomb potential, Hubbard model, quantum computing, fundamental limits, NP-hardness
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.