Interacting Boson Problems Can Be QMA Hard
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
Computing the ground-state energy of interacting electron problems has recently been shown to be hard for quantum Merlin Arthur (QMA), a quantum analogue of the complexity class NP. Fermionic problems are usually hard, a phenomenon widely attributed to the so-called sign problem. The corresponding bosonic problems are, according to conventional wisdom, tractable. Here, we demonstrate that the complexity of interacting boson problems is also QMA hard. Moreover, the bosonic version of N-representability problem is QMA complete. Consequently, these problems are unlikely to have efficient quantum algorithms.
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.
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
The Complexity of the Local Hamiltonian Problem
Kempe, J., Kitaev, A., & Regev, O. (2006) · SIAM Journal on Computing · doi:10.1137/s0097539704445226 · Cited by 648
Present State of Molecular Structure Calculations
Coulson, C. A. (1960) · Reviews of Modern Physics · doi:10.1103/revmodphys.32.170 · Cited by 275
Schuch, N., & Verstraete, F. (2009) · Nature Physics · doi:10.1038/nphys1370 · Cited by 260
Many-Electron Densities and Reduced Density Matrices
(2000) · Mathematical and Computational Chemistry · doi:10.1007/978-1-4615-4211-7 · Cited by 219
Quantum Computational Complexity of the N -Representability Problem: QMA Complete
Liu, Y.-K., Christandl, M., & Verstraete, F. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.110503 · Cited by 211
Cited by
Quantum Hamiltonian Complexity
Gharibian, S., Huang, Y., Landau, Z., & Shin, S. W. (2015) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000066 · Cited by 144
Computational complexity in electronic structure
Whitfield, J. D., Love, P. J., & Aspuru-Guzik, A. (2013) · Phys. Chem. Chem. Phys. · doi:10.1039/c2cp42695a · Cited by 71
Bookatz, A. D. (2014) · Quantum Information and Computation · doi:10.26421/qic14.5-6-1 · Cited by 26
Metadata
- Authors
- Wei, T.-C., Mosca, M., & Nayak, A.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2010-01-27
- Volume
- 104
- Issue
- 4
- Pages
- 040501-040501
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2026979651
- Cited by
- 55
- References
- 5
- FWCI
- 5.78
- Type
- journal article
- Language
- en
- Open access
- green
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.