Efficient quantum computation of molecular forces and other energy gradients
Open accessThe DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
Abstract
While most work on the quantum simulation of chemistry has focused on computing energy surfaces, a similarly important application requiring subtly different algorithms is the computation of energy derivatives. Almost all molecular properties can be expressed an energy derivative, including molecular forces, which are essential for applications such as molecular dynamics simulations. Here, we introduce new quantum algorithms for computing molecular energy derivatives with significantly lower complexity than prior methods. Under cost models appropriate for noisy-intermediate scale quantum devices, we demonstrate how low-rank factorization and other tomography schemes can be optimized for energy derivative calculations. We numerically demonstrate that our techniques reduce the number of circuit repetitions required by many orders of magnitude for even modest systems, and that the cost of estimating an entire force vector may in some systems be lower than the cost of estimating the energy. In the context of fault-tolerant algorithms, we develop new methods of estimating energy derivatives with Heisenberg limited scaling, incorporating state-of-the-art techniques for block encoding fermionic operators. In contrast to our near-term results, we find that the cost of estimating forces with any of our Heisenberg-limited methods is bounded by the cost of estimating energies, due to inner loops requiring either energy estimation or reflections around the ground state. This implies that applications such as geometry optimization, coupling parameter estimation, and spectral prediction may be practical on fault-tolerant quantum devices, but tractable molecular dynamics simulations of large-scale systems requires further algorithmic advances.
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
1 retracted
Quantum computational quantification of protein–ligand interactions
Kirsopp, J. J. M., Di Paola, C., Manrique, D. Z., Krompiec, M., Greene‐Diniz, G., Guba, W., Meyder, A., Wolf, D., Strahm, M., & Muñoz Ramo, D. (2022) · International Journal of Quantum Chemistry · doi:10.1002/qua.26975 · Cited by 59
RetractedQuantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720
Self-citationA 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
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088
Surface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059
Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets
Kandala, A., Mezzacapo, A., Temme, K., Takita, M., Brink, M., Chow, J. M., & Gambetta, J. M. (2017) · Nature · doi:10.1038/nature23879 · Cited by 2,982
Noisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
Self-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 amplitude amplification and estimation
Brassard, G., Høyer, P., Mosca, M., & Tapp, A. (2002) · Contemporary Mathematics · doi:10.1090/conm/305/05215 · Cited by 1,680
Mitarai, K., Negoro, M., Kitagawa, M., & Fujii, K. (2018) · Physical Review A · doi:10.1103/physreva.98.032309 · Cited by 1,639
Cited by
The Variational Quantum Eigensolver: A review of methods and best practices
Tilly, J., Chen, H., Cao, S., Picozzi, D., Setia, K., Li, Y., Grant, E., Wossnig, L., Rungger, I., Booth, G. H., et al. (2022) · Physics Reports · doi:10.1016/j.physrep.2022.08.003 · Cited by 1,031
Drug design on quantum computers
(2024) · doi:10.1038/s41567-024-02411-5 · Cited by 132
Early Fault-Tolerant Quantum Computing
Katabarwa, A., Gratsea, K., Caesura, A., & Johnson, P. D. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.020101 · Cited by 103
“Phase Estimation Time-Series Estimator [98] Robust Fourier Estimation [92, 99] Modified Robust Phase Estimation [100] Multiple-Eigenvalue Estimation Adaptive Multi-Order Phase Estimation [101] Robust Multiple-Phase Estimation [93] Multi-Modal, Multi-Level QCELS [102] Observable Dynamic Mode…”
MethodQuantum computing for near-term applications in generative chemistry and drug discovery.
Pyrkov, A., Aliper, A., Bezrukov, D., Lin, Y.-C., Polykovskiy, D., Kamya, P., Ren, F., & Zhavoronkov, A. (2023) · Drug Discovery Today · doi:10.1016/j.drudis.2023.103675 · Cited by 100
A hybrid quantum computing pipeline for real world drug discovery
Li, W., Yin, Z., Li, X., Ma, D., Yi, S., Zhang, Z., Zou, C., Bu, K., Dai, M., Yue, J., et al. (2024) · Scientific Reports · doi:10.1038/s41598-024-67897-8 · Cited by 67
Metadata
- Authors
- O'Brien, T. E., Streif, M., Rubin, N. C., Santagati, R., Su, Y., Huggins, W. J., Goings, J. J., Moll, N., Kyoseva, E., Degroote, M., Tautermann, C. S., Lee, J., Berry, D. W., Wiebe, N., & Babbush, R.
- Venue
- Physical Review Research
- Publisher
- American Physical Society (APS)
- Published
- 2022-12-26
- Volume
- 4
- Issue
- 4
- ISSN
- 2643-1564 (ISSN-L)
- OpenAlex
- W3217227730
- Cited by
- 50
- References
- 44
- FWCI
- 3.31
- Type
- journal article
- Language
- en
- Open access
- gold
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.