Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 82

The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.

Calculating energy derivatives for quantum chemistry on a quantum computer

O’Brien, Thomas E., Senjean, Bruno, Sagastizabal, Ramiro, Bonet-Monroig, Xavier, Dutkiewicz, Alicja, Buda, Francesco, DiCarlo, Leonardo, Visscher, Lucas·2019·npj Quantum Information

Abstract

Modeling chemical reactions and complicated molecular systems has been proposed as the “killer application” of a future quantum computer. Accurate calculations of derivatives of molecular eigenenergies are essential toward this end, allowing for geometry optimization, transition state searches, predictions of the response to an applied electric or magnetic field, and molecular dynamics simulations. In this work, we survey methods to calculate energy derivatives, and present two new methods: one based on quantum phase estimation, the other on a low-order response approximation. We calculate asymptotic error bounds and approximate computational scalings for the methods presented. Implementing these methods, we perform geometry optimization on an experimental quantum processor, estimating the equilibrium bond length of the dihydrogen molecule to within $$0.014$$0.014 Å of the full configuration interaction value. Within the same experiment, we estimate the polarizability of the H$${}_{2}$$2 molecule, finding agreement at the equilibrium bond length to within $$0.06$$0.06 a.u. ($$2 \%$$2% relative error).

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1038/s41534-019-0213-4

Cites

28 of 28 references verified0 citation errors · 0 not checkable

Statistics

Figures

Fig. 1 Illustration of geometry optimization of the H 2 molecule. A classical optimization algorithm (Newton) minimizes the estimation of the true ground state energy (dark blue curve) on a superconducting transmon quantum computer (red crosses) as a function of the bond distance R H  H . To improve convergence, the quantum computer provides estimates of the FCI gradient (red arrows) and the Hessian calculated with the response method. Dashed vertical lines show the position of the FCI and estimated minima (error 0 : 014 Å). Light blue dashed lines show the median value of 100 density matrix simulations (Section IV O) of this optimization, with the shaded region the corresponding interquartile range.
Fig. 1 Illustration of geometry optimization of the H 2 molecule. A classical optimization algorithm (Newton) minimizes the estimation of the true ground state energy (dark blue curve) on a superconducting transmon quantum computer (red crosses) as a function of the bond distance R H H . To improve convergence, the quantum computer provides estimates of the FCI gradient (red arrows) and the Hessian calculated with the response method. Dashed vertical lines show the position of the FCI and estimated minima (error 0 : 014 Å). Light blue dashed lines show the median value of 100 density matrix simulations (Section IV O) of this optimization, with the shaded region the corresponding interquartile range.CC-BY · From the PDF
Fig. 2 Comparison of geometry optimization via different classical optimization routines, using a quantum computer to return energies and Jacobians as required, and estimating Hessians as required either via the ETA on the experimental device, or the Hartree -Fock (HF) approximation on a classical computer. Each algorithm was run till termination with a tolerance of 10  3 , so as to be comparable to the fi nal error in the system. (Inset) bar plot of the number of function evaluations of the four compared methods. Light blue points correspond to median N fev from 100 density-matrix simulations (Section IV O) of geometry optimization, and error bars to the interquartile ranges. 2
Fig. 2 Comparison of geometry optimization via different classical optimization routines, using a quantum computer to return energies and Jacobians as required, and estimating Hessians as required either via the ETA on the experimental device, or the Hartree -Fock (HF) approximation on a classical computer. Each algorithm was run till termination with a tolerance of 10 3 , so as to be comparable to the fi nal error in the system. (Inset) bar plot of the number of function evaluations of the four compared methods. Light blue points correspond to median N fev from 100 density-matrix simulations (Section IV O) of geometry optimization, and error bars to the interquartile ranges. 2CC-BY · From the PDF
Image 3
CC-BY · From the PDF
Fig. 4 Estimated polarizability of the hydrogen molecule as a function of the bond distance, in atomic units (1 a.u. = 0.14818471 Å 3 ).
Fig. 4 Estimated polarizability of the hydrogen molecule as a function of the bond distance, in atomic units (1 a.u. = 0.14818471 Å 3 ).CC-BY · From the PDF
Fig. 5 De fi nition of the circuit element MT used throughout this work to estimate the phase e i ϕ on a single qubit. This is done by repeatedly preparing and measuring the qubit along two different axis, by a combination of rotation and Hadamard gates and measurement MZ in the computational basis. The fi nal measurements may then be combined via Eq. (22).
Fig. 5 De fi nition of the circuit element MT used throughout this work to estimate the phase e i ϕ on a single qubit. This is done by repeatedly preparing and measuring the qubit along two different axis, by a combination of rotation and Hadamard gates and measurement MZ in the computational basis. The fi nal measurements may then be combined via Eq. (22).CC-BY · From the PDF
Fig. 6 A circuit to measure h Ψ j j ^ V j Ψ j i without preparing Ψ j on the system register. The tomography box MT is de fi ned in Fig. 5.
Fig. 6 A circuit to measure h Ψ j j ^ V j Ψ j i without preparing Ψ j on the system register. The tomography box MT is de fi ned in Fig. 5.CC-BY · From the PDF
Fig. 7 Circuits for calculating path amplitudes (Eq. (10)) for a second-order derivative on a quantum computer (individual units described throughout Section IV C), using either a VQE (top) or QPE (bottom) for state preparation. Both circuits require an N -qubit system register and a single ancilla qubit. Repeat measurements of these circuit at different values of k (top) or k 0 and k 1 (bottom) allow for the inference of the amplitude, as described in the text. MZ refers to a fi nal measurement of all qubits in the computational basis, which is required for post-selection.
Fig. 7 Circuits for calculating path amplitudes (Eq. (10)) for a second-order derivative on a quantum computer (individual units described throughout Section IV C), using either a VQE (top) or QPE (bottom) for state preparation. Both circuits require an N -qubit system register and a single ancilla qubit. Repeat measurements of these circuit at different values of k (top) or k 0 and k 1 (bottom) allow for the inference of the amplitude, as described in the text. MZ refers to a fi nal measurement of all qubits in the computational basis, which is required for post-selection.CC-BY · From the PDF

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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?

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

Show all 28 references

Research works printed but not linked: 60

  1. Abrams, D. S. & Lloyd, S. Simulation of many-body fermi systems on a universal quantum computer. Phys. Rev. Lett. 79, 2586 (1997). · DOI · Paper page
  2. Zalka, C. Simulating quantum systems on a quantum computer. Proc. Royal Soc. Lond. A 454, 313–322 (1998). · DOI · Paper page
  3. Aspuru-Guzik, A., Dutoi, A. D., Love, P. J. & Head-Gordon, M. Simulated quantum computation of molecular energies. Science 309, 1704–1707 (2005). · DOI · Paper page
  4. Kitaev, A. Y. Quantum Measurements and the Abelian Stabilizer Problem. Preprint at: arXiv:quant-ph/9511026. https://arxiv.org/abs/quant-ph/9511026 (1995). · arXiv
  5. Colless, J. I. et al. Computation of molecular spectra on a quantum processor with an error-resilient algorithm. Phys. Rev. X 8, 011021 (2018).
  6. Dreizler, R. M. & Gross, E. K. U. Density Functional Theory: An Approach to the Quantum Many-Body Problem (Springer: Berlin. Heidelberg, 1990).
  7. Shavitt, I. & Bartlett, R. J. Many-Body Methods in Chemistry and Physics: MBPT and Coupled-Cluster Theory (Cambridge University Press, 2009). · DOI · Paper page
  8. Booth, G. H., Thom, A. J. & Alavi, A. Fermion monte carlo without fixed nodes: a game of life, death, and annihilation in slater determinant space. J. Chem. Phys. 131, 054106 (2009). · DOI · Paper page
  9. Jensen, F. Introduction to Computational Chemistry, 2nd ed. (John Wiley & Sons, 2007).
  10. Norman, P., Ruud, K. & Saue, T. Principles and Practices of Molecular Properties: Theory, Modeling, and Simulations. https://doi.org/10.1002/9781118794821 (John Wiley & Sons, 2018). · DOI
  11. Schlegel, H. B. Geometry optimization. Wiley Interdiscip. Rev. Comput. Mol. Sci. 1, 790–809 (2011). · DOI · Paper page
  12. Marx, D. & Hutter, J. Ab Initio Molecular Dynamics: Basic Theory and Advance Methods. https://www.cambridge.org/nl/academic/subjects/physics/mathematical-methods/ab-initio-molecular-dynamics-basic-theory-and-advanced-methods?format=PB (Cambridge University Press, 2009). · DOI · Paper page
  13. Tully, J. C. Molecular dynamics with electronic transitions. J. Chem. Phys. 93, 1061–1071 (1990). · DOI · Paper page
  14. Behler, J. Perspective: machine learning potentials for atomistic simulations. J. Chem. Phys. 145, 170901 (2016). · DOI · Paper page
  15. Li, Z. & Liu, W. First-order nonadiabatic coupling matrix elements between excited states: a lagrangian formulation at the cis, rpa, td-hf, and td-dft levels. J. Chem. Phys. 141, 014110 (2014). · DOI
  16. Curchod, B. F., Rothlisberger, U. & Tavernelli, I. Trajectory-based nonadiabatic dynamics with time-dependent density functional theory. ChemPhysChem 14, 1314–1340 (2013). · DOI · Paper page
  17. Faraji, S., Matsika, S. & Krylov, A. I. Calculations of non-adiabatic couplings within equation-of-motion coupled-cluster framework: theory, implementation, and validation against multi-reference methods. J. Chem. Phys. 148, 044103 (2018). · DOI
  18. Jordan, S. P. Fast quantum algorithm for numerical gradient estimation. Phys. Rev. Lett. 95, 050501 (2005). · DOI
  19. Gilyén, A., Arunachalam, S. & Wiebe, N. Optimizing quantum optimization algorithms via faster quantum gradient computation. Proc. Symp. Disc. Alg. 30, 1425–1444 (2019).
  20. Harrow, A. & Napp, J. Low-Depth Gradient Measurements Can Improve Convergence in Variational Hybrid Quantum-Classical Algorithms. Preprint at arXiv:1901.05374. https://arxiv.org/abs/1901.05374 (2019). · arXiv
  21. Guerreschi, G. G. & Smelyanskiy, M. Practical Optimization for Hybrid Quantum-Classical Algorithms. Preprint at: arXiv:1701.01450. https://arxiv.org/abs/1701.01450 (2017). · arXiv
  22. McArdle, S. Mayorov, A. Shan, X. Benjamin, S. & Yuan, X. Quantum Computation of Molecular Vibrations. Chem. Sci. 10, 5725–5735 (2019). · DOI
  23. Roggero, A. Carlson, J. Linear Response on a Quantum Computer. Phys. Rev. C 100, 034610 (2019). · DOI
  24. Visscher, L. The Dirac equation in quantum chemistry: strategies to overcome the current computational problems. J. Comp. Chem. 23, 759–766 (2002). · DOI
  25. Knill, E., Ortiz, G. & Somma, R. D. Optimal quantum measurements of expectation values of observables. Phys. Rev. A 75, 012328 (2007). · DOI · Paper page
  26. Dallaire-Demers, P.-L. & Wilhelm, F. K. Method to efficiently simulate the thermodynamic properties of the fermi-hubbard model on a quantum computer. Phys. Rev. A 93, 032303 (2016). · DOI · Paper page
  27. Bauer, B., Wecker, D., Millis, A. J., Hastings, M. B. & Troyer, M. Hybrid quantum-classical approach to correlated materials. Phys. Rev. X 6, 031045 (2016).
  28. Bartlett, R. J. Coupled cluster theory and its equation of motion extensions. Wiley Interdiscip. Rev. 2, 126–211 (2011).
  29. Kassal, I., Jordan, S. P., Love, P. J., Mohseni, M. & Aspuru-Guzik, A. Polynomial-time quantum algorithm for the simulation of chemical dynamics. Proc. Natl Acad. Sci. USA 105, 18681 (2008). · DOI · Paper page
  30. O’Brien, T., Tarasinski, B. & DiCarlo, L. Density-matrix simulation of small surface codes under current and projected experimental noise. npj Quant. Inf. 3. https://doi.org/10.1038/s41534-017-0039-x (2017). · DOI
  31. Nocedal, J. & Wright, S. Numerical Optimization (Springer Science & Business Media, 2006).
  32. McClean, J. R. et al. Openfermion: the electronic structure package for quantum computers. Preprint at: arXiv:1710.07629. https://arxiv.org/abs/1710.07629 (2017). · arXiv
  33. Ortiz, G., Gubernatis, J., Knill, E. & Laflamme, R. Quantum algorithms for fermionic simulations. Phys. Rev. A 64, 022319 (2001). · DOI · Paper page
  34. Seeley, J. T., Richard, M. J. & Love, P. J. The Bravyi-Kitaev transformation for quantum computation of electronic structure. J. Chem. Phys. 137, 224109 (2012). · DOI · Paper page
  35. Whitfield, J. D., Havlíček, V. & Troyer, M. Local spin operators for fermion simulations. Phys. Rev. A 94, 030301 (2016). · DOI
  36. Steudtner, M. & Wehner, S. Fermion-to-qubit mappings with varying resource requirements for quantum simulation. New J. Phys. 20, 063010 (2018). · DOI
  37. Setia, K., Bravyi, S., Mezzacapo, A. & Whitfield, J. D. Superfast encodings for Fermionic quantum simulation. Phys. Rev. Res. 1, 033033 (2019). · DOI
  38. Setia, K. & Whitfield, J. D. Bravyi-Kitaev superfast simulation of electronic structure on a quantum computer. J. Chem. Phys. 148, 164104 (2018). · DOI
  39. Tranter, A., Love, P. J., Mintert, F. & Coveney, P. V. A comparison of the Bravyi-Kitaev and Jordan-Wigner transformations for the quantum simulation of quantum chemistry. J. Chem. Theory Comput. 14, 5617–5630 (2018). · DOI
  40. O’Brien, T., Rożek, P. & Akhmerov, A. Majorana-based fermionic quantum computation. Phys. Rev. Lett. 120, 220504 (2018). · DOI
  41. Hastings, M. B., Wecker, D., Bauer, B. & Troyer, M. Improving quantum algorithms for quantum chemistry. Quant. Inf. Comp. 15, 1 (2015). · DOI
  42. Low, G. & Wiebe, N. Hamiltonian Simulation in the Interaction Picture. Preprint at: arXiv:1805.00675. https://arxiv.org/abs/1805.00675 (2018). · arXiv
  43. Motzoi, F., Kaicher, M. & Wilhelm, F. Linear and logarithmic time compositions of quantum many-body operators. Phys. Rev. Lett. 119, 160503 (2017). · DOI
  44. Babbush, R., Berry, D., McClean, J. & Neven, H. Quantum simulation of chemistry with sublinear scaling to the continuum. npj Quant. Inf. 5, 92 (2019). · DOI
  45. Motta, M. et al. Low Rank Representations for Quantum Simulation of Electronic Structure. Preprint at: arXiv:1808.02625. https://arxiv.org/abs/1808.02625 (2018). · arXiv
  46. Campbell, E. A Random Compiler for Fast Hamiltonian Simulation. Phys. Rev. Lett. 123, 070503 (2019). · DOI · Paper page
  47. Kivlichan, I. et al. Improved fault-tolerant quantum simulation of condensed-phase correlated electrons via trotterization. Preprint at: arXiv:1902.10673. https://arxiv.org/abs/1902.10673 (2019). · DOI · Paper page
  48. Wu, L.-A. Byrd, M. & Lidar, D. Polynomial-time simulation of pairing models on a quantum computer. Phys. Rev. Lett. 89. https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.89.057904 (2002). · DOI
  49. Motta, M. et al. Quantum Imaginary Time Evolution, Quantum Lanczos, and Quantum Thermal Averaging. Preprint at: arXiv:1901.07653. https://arxiv.org/abs/1901.07653 (2019). · arXiv
  50. Kyriienko, O. Quantum inverse iteration algorithm for near-term quantum devices. Preprint at: arXiv:1901.09988. https://arxiv.org/abs/1901.09988 (2019). · arXiv
  51. Higgins, B. L. et al. Demonstrating Heisenberg-limited unambiguous phase estimation without adaptive measurements. New J. Phys. 11, 073023 (2009). · DOI
  52. Ryabinkin, I. G. & Genin, S. N. Iterative Qubit Coupled Cluster Method: A Systematic Approach to the Full-ci Limit in Quantum Chemistry Calculations on Nisq Devices. Preprint at: arXiv:1906.11192. https://arxiv.org/abs/1906.11192 (2019). · arXiv
  53. Herasymenko, Y. & O’Brien, T.E. A Diagrammatic Approach to Variational Quantum Ansatz Construction. Preprint at: arXiv:1907.08157. https://arxiv.org/abs/1907.08157 (2019). · arXiv
  54. Svore, K., Hastings, M. & Freedman, M. Faster phase estimation. Quant. Inf. Comp. 14, 306–328 (2013).
  55. Kimmel, S., Low, G. H. & Yoder, T. J. Robust calibration of a universal single-qubit gate set via robust phase estimation. Phys. Rev. A 92, 062315 (2015). · DOI
  56. Wiebe, N. & Granade, C. Efficient bayesian phase estimation. Phys. Rev. Lett. 117, 010503 (2016). · DOI · Paper page
  57. O’Brien, T., Tarasinski, B. & Terhal, B. Quantum phase estimation of multiple eigenvalues for small-scale (noisy) experiments. New J. Phys. 21 https://iopscience.iop.org/article/10.1088/1367-2630/aafb8e (2019). · DOI · Paper page
  58. Sagastizabal, R. et al. Error Mitigation by symmetry verification on a variational quantum Eigensolver. Phys. Rev. A 100, 010302(R) (2019). · DOI
  59. Saira, O.-P. et al. Entanglement genesis by ancilla-based parity measurement in 2D circuit QED. Phys. Rev. Lett. 112, 070502 (2014). · DOI
  60. Fu, X. et al. eQASM: an executable quantum instruction set architecture. In Proceedings of 25th IEEE International Symposium on High-Performance Computer Architecture (HPCA), 224–237 (IEEE, 2019). · DOI

Cited by

See all 82

Metadata

Authors
O’Brien, T. E., Senjean, B., Sagastizabal, R., Bonet-Monroig, X., Dutkiewicz, A., Buda, F., DiCarlo, L., & Visscher, L.
Venue
npj Quantum Information
Published
2019-12-11
Volume
5
Issue
1
ISSN
2056-6387
Cited by
82
References
28
Language
en
Licence

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: Calculating energy derivatives for quantum chemistry on a quantum computer. https://app.cochat.ai/papers/10.1038/s41534-019-0213-4
The paper
O’Brien, T. E., Senjean, B., Sagastizabal, R., Bonet-Monroig, X., Dutkiewicz, A., Buda, F., DiCarlo, L., & Visscher, L. (2019). Calculating energy derivatives for quantum chemistry on a quantum computer. npj Quantum Information. https://doi.org/10.1038/s41534-019-0213-4

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.