Exploiting Locality in Quantum Computation for Quantum Chemistry
Open accessThe DOI matches its Crossref record; 73 of the 73 references it cites were found in a registry or an index.
Abstract
Accurate prediction of chemical and material properties from first-principles quantum chemistry is a challenging task on traditional computers. Recent developments in quantum computation offer a route toward highly accurate solutions with polynomial cost; however, this solution still carries a large overhead. In this Perspective, we aim to bring together known results about the locality of physical interactions from quantum chemistry with ideas from quantum computation. We show that the utilization of spatial locality combined with the Bravyi–Kitaev transformation offers an improvement in the scaling of known quantum algorithms for quantum chemistry and provides numerical examples to help illustrate this point. We combine these developments to improve the outlook for the future of quantum chemistry on quantum computers.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“Given the inherent advantage in implementing the ansatz as well as the high accuracies of CC methods, the application of the UCC ansatz truncated up to single and double excitations (UCCSD) has been investigated both theoretically and experimentally 52,53,59,325-330 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [327]
In the citing paper
“UCCSD has been implemented in combination with different basis set representations of the chemistry Hamiltonian, including the particle/hole basis 327 and the Bogoliubov basis 326 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [327]
In the citing paper
“In general, in order to approach the accuracy of methods like UCCSD, the number of layers has to grow rapidly, even to an extent that the number of parameters approaches or surpasses the size of the Hilbert space 327 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [327]
In the citing paper
“The accuracy of HEA have been tested both experimentally 56 and numerically 327 for small molecular systems including H 2 , LiH, BeH 2 and H 2 O.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [327]
In the citing paper
“The third type of entangling block introduced by Barkoutsos et al. 327 is similar to the original proposal (Equation 68), with E ent being a circuit with all-to-all CNOT gates and with single-qubit rotations corresponding to R z .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [327]
3 more claims about this paper
Create a free account to see every claim other papers make about this one.
Citations
Cites
Unified Approach for Molecular Dynamics and Density-Functional Theory
Car, R., & Parrinello, M. (1985) · Physical Review Letters · doi:10.1103/physrevlett.55.2471 · Cited by 10,754
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
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
Self-citationLöwdin, P.-O. (1950) · The Journal of Chemical Physics · doi:10.1063/1.1747632 · Cited by 3,175
Georgescu, I. M., Ashhab, S., & Nori, F. (2014) · Reviews of Modern Physics · doi:10.1103/revmodphys.86.153 · Cited by 2,932
Advances in methods and algorithms in a modern quantum chemistry program package
Shao, Y., Molnar, L. F., Jung, Y., Kussmann, J., Ochsenfeld, C., Brown, S. T., Gilbert, A. T. B., Slipchenko, L. V., Levchenko, S. V., O’Neill, D. P., et al. (2006) · Phys. Chem. Chem. Phys. · doi:10.1039/b517914a · Cited by 2,799
�ber das Paulische �quivalenzverbot
Jordan, P., & Wigner, E. (1928) · Zeitschrift f�r Physik · doi:10.1007/bf01331938 · Cited by 2,597
On the product of semi-groups of operators
Trotter, H. F. (1959) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1959-0108732-6 · Cited by 2,282
Simulated Quantum Computation of Molecular Energies
Aspuru-Guzik, A., Dutoi, A. D., Love, P. J., & Head-Gordon, M. (2005) · Science · doi:10.1126/science.1113479 · Cited by 1,418
Self-citation
Research works printed but not linked: 7
- Babbush, 2014, Advances in Chemical Physics, 201
- Yung, 2014, From Transistor to Trapped-Ion Computers for Quantum Chemistry, Sci. Rep, 3589/1
- Helgaker, 2002, Molecular Electronic Structure Theory
- Werner, 2006, Annual Reports in Computational Chemistry, 53
- Ochsenfeld, 2007, Reviews in Computational Chemistry, 1
- Jordan, 2008, Perturbative Gadgets at Arbitrary Orders, Phys. Rev. A, 77, 1, 10.1103/PhysRevA.77.062329 · DOI · Paper page
- Biamonte, 2008, Non-Perturbative k-Body to Two-Body Commuting Conversion Hamiltonians and Embedding Problem Instances into Ising Spins, Phys. Rev. A, 77, 1
Cited by
Barren plateaus in quantum neural network training landscapes
McClean, J. R., Boixo, S., Smelyanskiy, V. N., Babbush, R., & Neven, H. (2018) · Nature Communications · doi:10.1038/s41467-018-07090-4 · Cited by 2,329
“In quantum simulation, there is often a choice inspired by physical domain knowledge [3, 17, 25– 29].”
BackgroundSelf-citationThe theory of variational hybrid quantum-classical algorithms
McClean, J. R., Romero, J., Babbush, R., & Aspuru-Guzik, A. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/2/023023 · Cited by 2,227
Self-citationQuantum computational chemistry
McArdle, S., Endo, S., Aspuru-Guzik, A., Benjamin, S. C., & Yuan, X. (2020) · Reviews of Modern Physics · doi:10.1103/revmodphys.92.015003 · Cited by 1,621
Self-citationQuantum 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
Self-citationScalable Quantum Simulation of Molecular Energies
O’Malley, P. J. J., Babbush, R., Kivlichan, I. D., Romero, J., McClean, J. R., Barends, R., Kelly, J., Roushan, P., Tranter, A., Ding, N., et al. (2016) · Physical Review X · doi:10.1103/physrevx.6.031007 · Cited by 1,059
Self-citation
Metadata
- Authors
- McClean, J. R., Babbush, R., Love, P. J., & Aspuru-Guzik, A.
- Affiliations
- Harvard University (US)
- Haverford College (US)
- Harvard University , , , ,
- Venue
- The Journal of Physical Chemistry Letters
- Publisher
- American Chemical Society (ACS)
- Published
- 2014-11-25
- Volume
- 5
- Issue
- 24
- Pages
- 4368-4380
- ISSN
- 1948-7185 (ISSN-L)
- OpenAlex
- W2135246499
- Cited by
- 125
- References
- 71
- Citations by year
- 2026: 4 · 2025: 8 · 2024: 7 · 2023: 11 · 2022: 17 · 2021: 16 · 2020: 16 · 2019: 8 · 2018: 14 · 2017: 7 · 2016: 9 · 2015: 6 · 2014: 2
- FWCI
- 7.98
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Locations
- The Journal of Physical Chemistry Letters (publishedVersion, other-oa)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- Digital Access to Scholarship at Harvard (DASH) (Harvard University) (submittedVersion, cc-by)
- OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (submittedVersion)
- arXiv (Cornell University)
- Funders
- U.S. Department of Energy (DE-FG02-97ER25308)
- Division of Chemistry (CHE-1152291)
- Division of Physics (PHY-0955518)
- Air Force Office of Scientific Research (FA9550-12-1-0046)
- 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
- quantum chemistry, quantum computing, locality, spatial locality, quantum algorithms, algorithm scaling, first-principles calculations, quantum simulation
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Exploiting Locality in Quantum Computation for Quantum Chemistry. https://app.cochat.ai/papers/10.1021/jz501649m
- The paper
- McClean, J. R., Babbush, R., Love, P. J., & Aspuru-Guzik, A. (2014). Exploiting Locality in Quantum Computation for Quantum Chemistry. The Journal of Physical Chemistry Letters. https://doi.org/10.1021/jz501649m
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.