Spiers Memorial Lecture: Quantum chemistry, classical heuristics, and quantum advantage
Open accessThe DOI matches its Crossref record; 72 of the 81 references it cites were found in a registry or an index.
Abstract
We describe the problems of quantum chemistry, the intuition behind classical heuristic methods used to solve them, a conjectured form of the classical complexity of quantum chemistry problems, and the subsequent opportunities for quantum advantage. This article is written for both quantum chemists and quantum information theorists. In particular, we attempt to summarize the domain of quantum chemistry problems as well as the chemical intuition that is applied to solve them within concrete statements (such as a classical heuristic cost conjecture) in the hope that this may stimulate future analysis.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Quantum Computation and Quantum Information: Bibliography
Nielsen, M. A., & Chuang, I. (2010) · doi:10.1017/cbo9780511976667.023 · Cited by 12,065
Introduction to Computational Chemistry
Jensen, F. (1998) · Cited by 4,812
A variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552
Density-matrix algorithms for quantum renormalization groups
White, S. R. (1993) · Physical Review B · doi:10.1103/physrevb.48.10345 · Cited by 3,244
Colloquium : Area laws for the entanglement entropy
Eisert, J., Cramer, M., & Plenio, M. B. (2010) · Reviews of Modern Physics · doi:10.1103/revmodphys.82.277 · Cited by 2,873
Molecular Electronic‐Structure Theory
Helgaker, T., Jørgensen, P., & Olsen, J. (2000) · doi:10.1002/9781119019572 · Cited by 2,594
Mardirossian, N., & Head-Gordon, M. (2017) · Molecular Physics · doi:10.1080/00268976.2017.1333644 · Cited by 2,307
Quantum mechanics of many-electron systems
Dirac, P. A. M. (1929) · Proceedings of the Royal Society of London. Series A, Containing Papers of a Mathematical and Physical Character · doi:10.1098/rspa.1929.0094 · Cited by 1,778
Verstraete, F., Murg, V., & Cirac, J. I. (2008) · Advances in Physics · doi:10.1080/14789940801912366 · Cited by 1,762
Computational Complexity: A Modern Approach
Arora, S., & Barak, B. (2009) · doi:10.1017/cbo9780511804090 · Cited by 1,690
Research works printed but not linked: 7
- Schmid, 2023, Phys. Rev. X, 13, 041036
- Babbush, 2018, Phys. Rev. X, 8, 011044
- Cremer, 2011, Wiley Interdiscip. Rev.: Comput. Mol. Sci., 1, 509
- Hastings, 2007, J. Stat. Mech.: Theory Exp., 2007, P08024
- Motta, 2018, Wiley Interdiscip. Rev.: Comput. Mol. Sci., 8, e1364
- W.-Y.Liu , H.Zhai , R.Peng , Z.-C.Gu and G. K.-L.Chan , arXiv , 2024 , preprint
- Haghshenas, 2022, Phys. Rev. X, 12, 011047
Cited by
Pei, Z. (2024) · Cell Reports Physical Science · doi:10.1016/j.xcrp.2024.102334 · Cited by 52
HamLib: A library of Hamiltonians for benchmarking quantum algorithms and hardware
Sawaya, N. P. D., Marti-Dafcik, D., Ho, Y., Tabor, D. P., Bernal, D. E., Magann, A. B., Premaratne, S., Dubey, P. K., Matsuura, A. Y., Bishop, N. C., et al. (2024) · Quantum · doi:10.22331/q-2024-12-11-1559 · Cited by 58
Multiscale Embedding for Quantum Computing
Weisburn, L. P., Cho, M., Bensberg, M., Meitei, O. R., Reiher, M., & Voorhis, T. V. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5c00241 · Cited by 21
Dissipative preparation of many-body quantum states: Toward practical quantum advantage
Lin, L. (2025) · APL Computational Physics · doi:10.1063/5.0283315 · Cited by 43
Weaving, T., Ralli, A., Love, P. J., Succi, S., & Coveney, P. V. (2025) · npj Quantum Information · doi:10.1038/s41534-024-00952-4 · Cited by 35
Grand Challenge of Quantum Applications
Babbush, R., King, R., Boixo, S., Huggins, W. J., Khattar, T., Low, G. H., McClean, J. R., O’Brien, T. E., & Rubin, N. C. (2026) · PRX Quantum · doi:10.1103/6r9l-lynr · Cited by 70
Simulating Electronic Structure on Bosonic Quantum Computers
Dutta, R., Vu, N. P., Xu, C. F., Cabral, D. G. A., Lyu, N., Soudackov, A. V., Dan, X., Li, H., Wang, C., & Batista, V. S. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.4c01400 · Cited by 19
Motta, M., Sung, K. J., & Shee, J. (2024) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.4c02847 · Cited by 15
Projected entangled pair states with flexible geometry
Patra, S., Singh, S., & Orús, R. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.l012002 · Cited by 13
Quantum Computing for Quantum Chemistry
Schleich, P., Calderón, L. M., Sun, C., Bagherimehrab, M., Aldossary, A., Kottmann, J. S., & Aspuru‐Guzik, A. (2025) · ACS in focus · doi:10.1021/acsinfocus.7e9012 · Cited by 10
Quantum machine learning of molecular energies with hybrid quantum-neural wavefunction
Li, W., Zhang, S., Sheng, Z., Gong, C., Chen, J., & Shuai, Z. (2025) · Digital Discovery · doi:10.1039/d5dd00222b · Cited by 12
Feasibility of performing quantum chemistry calculations on quantum computers
Louvet, T., Ayral, T., & Waintal, X. (2025) · Physical review. B./Physical review. B · doi:10.1103/hpt6-9tnk · Cited by 21
Classical and quantum algorithms for many-body problems
Ayral, T. (2025) · Comptes Rendus Physique · doi:10.5802/crphys.229 · Cited by 8
Unification of finite symmetries in the simulation of many-body systems on quantum computers
Bastidas, V. M., Fitzpatrick, N., Joven, K. J., Rossi, Z. M., Islam, S., Voorhis, T. V., Chuang, I. L., & Liu, Y. (2025) · Physical Review A · doi:10.1103/physreva.111.052433 · Cited by 4
Joven, K. J., Das, E. R., Bierman, J., Majumdar, A., Heris, M. H., & Liu, Y. (2026) · APL Computational Physics · doi:10.1063/5.0312254 · Cited by 11
Faster Algorithmic Quantum and Classical Simulations by Corrected Product Formulas
Bagherimehrab, M., Calderón, L. M., Berry, D. W., Schleich, P., Vakili, M. G., Aldossary, A., Campos-Gonzalez-Angulo, J. A., Gorgulla, C., & Aspuru‐Guzik, A. (2026) · PRX Quantum · doi:10.1103/phk5-slkl · Cited by 13
Quantum many-body linear algebra, Hamiltonian moments, and a coupled-cluster inspired framework
Ai, Y., Zhai, H., Tölle, J., & Chan, G. K. (2025) · The Journal of Chemical Physics · doi:10.1063/5.0273952 · Cited by 2
Self-citationLearning the Closest Product State
Bakshi, A., Bostanci, J., Kretschmer, W., Landau, Z. A., Li, J. Z., Liu, A., O'Donnell, R., & Tang, E. (2025) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3717823.3718207 · Cited by 27
Patra, C., Mondal, D., Halder, S., Halder, D., Laskar, M. R., Goel, R., & Maitra, R. (2026) · Quantum Science and Technology · doi:10.1088/2058-9565/ae917f · Cited by 16
Energy Spectra of Compressed Quantum States
Wang, D. (2026) · Physical Review Letters · doi:10.1103/q5fz-4hzy · Cited by 1
Metadata
- Authors
- Chan, G. K.-L.
- Affiliations
- California Institute of Technology (US)
- Corresponding author
- Chan, Garnet Kin-Lic
- ORCID
- Chan, Garnet Kin-Lic
- Venue
- Faraday Discussions
- Publisher
- Royal Society of Chemistry (RSC)
- Published
- 2024
- Volume
- 254
- Issue
- 0
- Pages
- 11-52
- ISSN
- 1359-6640 (ISSN-L)
- 1364-5498
- OpenAlex
- W4400566659
- Cited by
- 20
- References
- 81
- Citations by year
- 2026: 5 · 2025: 12 · 2024: 3
- FWCI
- 2.96
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- Locations
- Faraday Discussions (publishedVersion, cc-by-nc)
- PubMed (publishedVersion)
- OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (submittedVersion)
- Funders
- U.S. Department of Energy
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Advanced Chemical Physics Studies
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- quantum chemistry, quantum advantage, computational complexity, chemical intuition, quantum information
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.