Polynomial-time quantum algorithm for the simulation of chemical dynamics
By Ivan Kassal, S. Jordan, Peter J. Love, Masoud Mohseni, A. Aspuru‐Guzik. Proceedings of the National Academy of Sciences of the United States of America, 2008
379 citations recorded by the source corpus.
The computational cost of exact methods for quantum simulation using classical computers grows exponentially with system size. As a consequence, these techniques can be applied only to small systems. By contrast, we demonstrate that quantum computers could exactly simulate chemical reactions in polynomial time. Our algorithm uses the split-operator approach and explicitly simulates all electron-nuclear and interelectronic interactions in quadratic time. Surprisingly, this treatment is not only more accurate than the Born–Oppenheimer approximation but faster and more efficient as well, for all reactions with more than about four atoms. This is the case even though the entire electronic wave function is propagated on a grid with appropriately short time steps. Although the preparation and measurement of arbitrary states on a quantum computer is inefficient, here we demonstrate how to prepare states of chemical interest efficiently. We also show how to efficiently obtain chemically relevant observables, such as state-to-state transition probabilities and thermal reaction rates. Quantum computers using these techniques could outperform current classical computers with 100 qubits.
Subfields: Artificial Intelligence, Atomic and Molecular Physics, and Optics
View Paper: https://www.semanticscholar.org/paper/1c44e2260e1cb1840ee5cbffb35cece9a9472b5a
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Alán Aspuru-Guzik
- Jarrod R. McClean
- Ryan Babbush
- Nathan Wiebe
- Jonathan Romero
- Hartmut Neven
- Patrick J. Coles
- John Preskill
In Atomic and Molecular Physics, and Optics
- Alán Aspuru-Guzik
- Ryan Babbush
- Jarrod R. McClean
- Jonathan Romero
- Nathan Wiebe
- Yudong Cao
- Hartmut Neven
- John Preskill
Citations in the corpus
- Potential of quantum computing for drug discovery (2018, background): “Since the first introduction of quantum computing to quantum chemical applications [8], there has been substantial activity exploring quantum chemistry simulation in a variety of settings [88–92].”
- Amplitude estimation without phase estimation (2019, background): “, in chemistry [7, 8], finance [9, 10], and machine learning [11, 12, 13, 14].”
- Low-Depth Quantum Simulation of Materials (2017, methodology): “[10] Real space Trotter O(polyðNÞ) O(polyðNÞ) O(polyðNÞ) 2010 Whitfield et al.”
- Quantum simulation of the wavefunction to probe frustrated Heisenberg spin systems (2010, background): “This is of particular interest for quantum chemistry with small numbers of particles and might enable in the near future the simulation of aromatic systems and chemical reaction”
- Variational quantum algorithms for nonlinear problems (2019, background): “(S1) gives rise to turbulence when 1⌫ becomes large [11, 12].”
- Quantum computing and the entanglement frontier (2012, background): “Furthermore, a quantum computer may be able to simulate the evolution of excited states in cases where the simulation is classically hard, such as chemical reactions 34 or the scattering of particles described by quantum field theory.”