Quick Navigation
Topics
Quantum Chemistry
Quantum Error Correction Fault Tolerance
Efficient Simulation of Pre-Born-Oppenheimer Dynamics on a Quantum Computer
arXiv
Authors: Matthew Pocrnic, Ignacio Loaiza, Juan Miguel Arrazola, Nathan Wiebe, Danial Motlagh
Year
2026
Paper ID
110
Status
Preprint
Abstract Read
~2 min
Abstract Words
145
Citations
N/A
Abstract
In this work, we present a quantum algorithm for direct first-principles simulation of electron-nuclear dynamics on a first-quantized real-space grid. Our algorithm achieves best-in-class efficiency for block-encoding the pre-Born-Oppenheimer molecular Hamiltonian by harnessing the linear scaling of swap networks for implementing the quadratic number of particle interactions, while using a novel alternating sign implementation of the Coulomb interaction that exploits highly optimized arithmetic routines. We benchmark our approach for a series of scientifically and industrially relevant chemical reactions. We demonstrate over an order-of-magnitude reduction in costs compared to previous state-of-the-art for the $\rm NH_3+BF_3$ reaction, achieving a Toffoli cost of $8.7\times10^{9}$ per femtosecond using $1362$ logical qubits (system + ancillas). Our results significantly lower the resources required for fault-tolerant simulations of photochemical reactions, while providing a suite of algorithmic primitives that are expected to serve as foundational building blocks for a broader class of quantum algorithms.
Paper Tools
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.