Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2202.05864 · Science Advances

Grid-based methods for chemistry simulations on a quantum computer

Hans Hon Sang Chan, Richard Meister, Tyson Jones, David P. Tew, Simon C. Benjamin

Published Mar 1, 2023• 44 citations
arXivHTMLPDF

Abstract

First-quantized, grid-based methods for chemistry modeling are a natural and elegant fit for quantum computers. However, it is infeasible to use today's quantum prototypes to explore the power of this approach because it requires a substantial number of near-perfect qubits. Here, we use exactly emulated quantum computers with up to 36 qubits to execute deep yet resource-frugal algorithms that model 2D and 3D atoms with single and paired particles. A range of tasks is explored, from ground state preparation and energy estimation to the dynamics of scattering and ionization; we evaluate various methods within the split-operator QFT (SO-QFT) Hamiltonian simulation paradigm, including protocols previously described in theoretical papers and our own techniques. While we identify certain restrictions and caveats, generally, the grid-based method is found to perform very well; our results are consistent with the view that first-quantized paradigms will be dominant from the early fault-tolerant quantum computing era onward.

DOI
10.1126/sciadv.abo7484

Related papers

Quantum simulations of chemistry in first quantization with any basis set

Timothy N. Georges, Marius Bothe, Christoph Sünderhauf +3 more

Quantum computation of the energy of molecules and materials is one of the most promising applications of fault-tolerant quantum computers. Practical applications require development of quantum algorithms with reduced resource requirements. Previous work has mainly focused on quantum algorithms where the Hamiltonian is represented in second quantization with compact basis sets while existing methods in first quantization are limited to a grid-based basis. In this work, we present a new method to solve the generic ground-state chemistry problem in first quantization using any basis set. We achieve asymptotic speedup in Toffoli count for molecular orbitals, and orders of magnitude improvement using dual plane waves as compared to the second quantization counterparts. In some instances, our approach provides similar or even lower resources compared to previous first quantization plane wave algorithms that, unlike our approach, avoids the loading of the classical data. The developed methodology can be applied to variety of applications, where the matrix elements of a first quantized Hamiltonian lack simple circuit representation.

arXiv:2408.03145•npj Quantum Information•Apr 1, 2025•19 citations

End-to-End Simulation of Chemical Dynamics on a Quantum Computer

Elliot C. Eklund, Arkin Tikku, Patrick Sinnott +4 more

Simulations of chemical dynamics are a powerful means for understanding chemistry. However, classical computers struggle to simulate many chemical processes, especially non-adiabatic ones, where the Born-Oppenheimer approximation breaks down. Quantum computers could simulate quantum-chemical dynamics more efficiently than classical computers, but there is currently no complete quantum algorithm for calculating dynamical observables to within a known error. Here, we develop an efficient, end-to-end quantum algorithm for simulating chemical dynamics that avoids all uncontrolled approximations (including the Born-Oppenheimer approximation) and whose error is bounded subject to mild assumptions. To do so, we treat the nuclei and the electrons on an equal footing and simulate the full molecular wavefunction on a momentum-space grid in first quantization, including all algorithmic steps: initial-state preparation, time evolution using qubitization, and measurement of chemical observables such as reaction yields and rates. Our work gives the first algorithm for quantum simulation of chemistry whose end-to-end complexity achieves sublinear scaling in the size of the grid. We achieve this by developing an exponentially faster method for initial-state-preparation. Photochemistry is a likely early application of our algorithm and we estimate resources required for end-to-end simulations of non-adiabatic dynamics of atmospherically important molecules. Classically intractable photochemical computations could be performed using resources comparable to those required for other chemical applications of quantum computing.

quant-pharXiv:2603.19007•Mar 20, 2026•0 citations

Real-space chemistry on quantum computers: a fault-tolerant algorithm with adaptive grids and a transcorrelated extension

César Feniou, Christopher Cherfan, Julien Zylberman +3 more

Adaptive real-space grids and transcorrelated Hamiltonians reduce spatial overheads in first quantized quantum chemistry, enabling fault-tolerant workflows for molecular ground-state energy estimation.

arXiv:2507.20583•Digital Discovery•Jan 1, 2026•0 citations

Faster quantum simulation of quantum chemistry with tailored algorithms and Hamiltonians

Ian Kivlichan

With quantum computers on the horizon, it is essential to understand what problems they can be used to solve. One potential application is simulating quantum systems, in particular, systems with many interacting electrons. However, there is a disparity between the computational resources required to study these problems and the capabilities of modern experimental quantum devices. In this thesis, we make progress toward closing this gap by reducing the cost of quantum simulation of quantum chemistry on a number of fronts. In the first half, we develop three improved quantum simulation algorithms by approximating time evolution under the Hamiltonian using a truncated Taylor series rather than the Trotter-Suzuki decomposition. We do this first for the molecular electronic structure Hamiltonian in two representations, obtaining asymptotic improvements in terms of both the number of orbitals and the required precision. We also apply the truncated Taylor series paradigm to quantum simulation in real space, where we consider simulation of general wave functions discretized on a uniform grid. In the second half, by working with Hamiltonians tailored specifically to quantum algorithms, we demonstrate that Trotter steps of the electronic structure Hamiltonian can be simulated in exactly N depth and with only linear connectivity, where N is the number of spin-orbitals. This resolves the problem of non-locality in fermion-to-qubit mappings, and has wide-ranging applications for variational and phase estimation-based quantum simulation of quantum chemistry. We further study this algorithm on an error-corrected quantum computer using the surface code. Benchmarking it alongside other product formula approaches, we show that quantum simulation of scientifically important instances of the electronic structure problem that are classically intractable can be performed with only a few hundred thousand physical qubits and fewer than one billion costly fault-tolerant gates. Finally, we study the effect of using randomized Hamiltonians in iterative phase estimation, and how this allows us to reduce the costs of simulation as well as to exploit knowledge of the ground state in how we design our simulation algorithm.

•Jan 8, 2020•0 citations

A comprehensive framework to simulate real-time chemical dynamics on a fault-tolerant quantum computer

Felipe H. da Jornada, Matteo Lostaglio, Sam Pallister +2 more

We present a comprehensive end-to-end framework for simulating the real-time dynamics of chemical systems on a fault-tolerant quantum computer, incorporating both electronic and nuclear quantum degrees of freedom. An all-particle simulation is nominally efficient on a quantum computer, but practically infeasible. Hence, central to our approach is the construction of a first-quantized plane-wave algorithm making use of pseudoions. The latter consolidate chemically inactive electrons and the nucleus into a single effective dynamical ionic entity, extending the well-established concept of pseudopotentials in quantum chemistry to a two-body interaction. We explicitly describe efficient quantum circuits for initial state preparation across all degrees of freedom, as well as for block-encoding the Hamiltonian describing interacting pseudoions and chemically active electrons, by leveraging recent advances in quantum rejection sampling to optimize the implementations. To extract useful chemical information, we first design molecular fingerprints by combining density-functional calculations with machine learning techniques, and subsequently validate them through surrogate classical molecular dynamics simulations. These fingerprints are then coherently encoded on a quantum computer for efficient molecular identification via amplitude estimation. We provide an extensive analysis of the cost of running the algorithm on a fault-tolerant quantum computer for several chemically interesting systems. As an illustration, simulating the interaction between $\mathrm{NH_3}$ and $\mathrm{BF_3}$ (a 40-particle system) requires 808 logical qubits to encode the problem, and approximately $10^{11}$ Toffoli gates per femtosecond of time evolution. Our results establish a foundation for further quantum algorithm development targeting chemical and material dynamics.

arXiv:2504.06348•Apr 8, 2025•1 citation

Grid-based split operator-quantum fourier transform algorithms for time-dependent quantum simulation

Xiaoning Feng

This thesis investigates the grid-based Split Operator–Quantum Fourier Transform (SO-QFT) scheme as a general-purpose backbone for time-dependent quantum simulation. We develop an end-to-end algorithmic framework that unifies state preparation on discretised grids, SO-QFT time propagation, and the extraction of observables via autocorrelation functions, with a focus on efficient quantum circuit construction. Classical emulation is used to evaluate the performance and resource demands of this framework across diverse chemical contexts. For vibronic dynamics arising from conical intersections, we assemble a complete workflow that reproduces absorption spectra and population transfer for a well-characterised prototypical polyatomic system. On this basis, we estimate the required quantum resources by mapping grid size, time resolution and spectral precision to qubit budgets, circuit depths and measurement counts. The framework is further tailored to infrared spectroscopy through probabilistic encoding of non-unitary dipole operators and explicit treatment of higher-order Hamiltonian terms via multi-controlled operations. To minimise gate depth, we optimise time discretisation and employ approximation strategies for initial states and dipole truncations, while preserving the fidelity of computed spectra. Importantly, the resource scaling relations derived from the vibronic and infrared simulations generalise to comparable molecular systems, providing a transferable template for predicting resource estimates beyond the specific benchmark studied. Finally, the methodology is extended to Coulombic systems, whose singular potentials challenge grid-based representations. We improve the simulation fidelity by proposing two correction schemes: a Hamiltonian correction that accounts for grid-basis structure, and a modification of the initial wavefunction to better match the discretised Hamiltonian. Both corrections are compatible with compact quantum encodings, and their representation in truncated Fourier or Walsh series offers an additional reduction in circuit depth. Collectively, these studies advance the grid-based SO-QFT scheme from a promising construct to a systematically assessed framework, establishing methodological guidance, algorithmic variants and quantitative resource benchmarks for future fault-tolerant quantum applications.

•Jan 1, 2025•0 citations
First-quantized, grid-based methods for chemistry modeling are a natural and elegant fit for quantum computers. However, it is infeasible to use today's quantum prototypes to explore the power of this approach because it requires a substantial number of near-perfect qubits. Here, we use exactly emulated quantum computers with up to 36 qubits to execute deep yet resource-frugal algorithms that model 2D and 3D atoms with single and paired particles. A range of tasks is explored, from ground state preparation and energy estimation to the dynamics of scattering and ionization; we evaluate various methods within the split-operator QFT (SO-QFT) Hamiltonian simulation paradigm, including protocols previously described in theoretical papers and our own techniques. While we identify certain restrictions and caveats, generally, the grid-based method is found to perform very well; our results are consistent with the view that first-quantized paradigms will be dominant from the early fault-tolerant quantum computing era onward.
Quantum computation of the energy of molecules and materials is one of the most promising applications of fault-tolerant quantum computers. Practical applications require development of quantum algorithms with reduced resource requirements. Previous work has mainly focused on quantum algorithms where the Hamiltonian is represented in second quantization with compact basis sets while existing methods in first quantization are limited to a grid-based basis. In this work, we present a new method to solve the generic ground-state chemistry problem in first quantization using any basis set. We achieve asymptotic speedup in Toffoli count for molecular orbitals, and orders of magnitude improvement using dual plane waves as compared to the second quantization counterparts. In some instances, our approach provides similar or even lower resources compared to previous first quantization plane wave algorithms that, unlike our approach, avoids the loading of the classical data. The developed methodology can be applied to variety of applications, where the matrix elements of a first quantized Hamiltonian lack simple circuit representation.
Simulations of chemical dynamics are a powerful means for understanding chemistry. However, classical computers struggle to simulate many chemical processes, especially non-adiabatic ones, where the Born-Oppenheimer approximation breaks down. Quantum computers could simulate quantum-chemical dynamics more efficiently than classical computers, but there is currently no complete quantum algorithm for calculating dynamical observables to within a known error. Here, we develop an efficient, end-to-end quantum algorithm for simulating chemical dynamics that avoids all uncontrolled approximations (including the Born-Oppenheimer approximation) and whose error is bounded subject to mild assumptions. To do so, we treat the nuclei and the electrons on an equal footing and simulate the full molecular wavefunction on a momentum-space grid in first quantization, including all algorithmic steps: initial-state preparation, time evolution using qubitization, and measurement of chemical observables such as reaction yields and rates. Our work gives the first algorithm for quantum simulation of chemistry whose end-to-end complexity achieves sublinear scaling in the size of the grid. We achieve this by developing an exponentially faster method for initial-state-preparation. Photochemistry is a likely early application of our algorithm and we estimate resources required for end-to-end simulations of non-adiabatic dynamics of atmospherically important molecules. Classically intractable photochemical computations could be performed using resources comparable to those required for other chemical applications of quantum computing.
With quantum computers on the horizon, it is essential to understand what problems they can be used to solve. One potential application is simulating quantum systems, in particular, systems with many interacting electrons. However, there is a disparity between the computational resources required to study these problems and the capabilities of modern experimental quantum devices. In this thesis, we make progress toward closing this gap by reducing the cost of quantum simulation of quantum chemistry on a number of fronts. In the first half, we develop three improved quantum simulation algorithms by approximating time evolution under the Hamiltonian using a truncated Taylor series rather than the Trotter-Suzuki decomposition. We do this first for the molecular electronic structure Hamiltonian in two representations, obtaining asymptotic improvements in terms of both the number of orbitals and the required precision. We also apply the truncated Taylor series paradigm to quantum simulation in real space, where we consider simulation of general wave functions discretized on a uniform grid. In the second half, by working with Hamiltonians tailored specifically to quantum algorithms, we demonstrate that Trotter steps of the electronic structure Hamiltonian can be simulated in exactly N depth and with only linear connectivity, where N is the number of spin-orbitals. This resolves the problem of non-locality in fermion-to-qubit mappings, and has wide-ranging applications for variational and phase estimation-based quantum simulation of quantum chemistry. We further study this algorithm on an error-corrected quantum computer using the surface code. Benchmarking it alongside other product formula approaches, we show that quantum simulation of scientifically important instances of the electronic structure problem that are classically intractable can be performed with only a few hundred thousand physical qubits and fewer than one billion costly fault-tolerant gates. Finally, we study the effect of using randomized Hamiltonians in iterative phase estimation, and how this allows us to reduce the costs of simulation as well as to exploit knowledge of the ground state in how we design our simulation algorithm.
We present a comprehensive end-to-end framework for simulating the real-time dynamics of chemical systems on a fault-tolerant quantum computer, incorporating both electronic and nuclear quantum degrees of freedom. An all-particle simulation is nominally efficient on a quantum computer, but practically infeasible. Hence, central to our approach is the construction of a first-quantized plane-wave algorithm making use of pseudoions. The latter consolidate chemically inactive electrons and the nucleus into a single effective dynamical ionic entity, extending the well-established concept of pseudopotentials in quantum chemistry to a two-body interaction. We explicitly describe efficient quantum circuits for initial state preparation across all degrees of freedom, as well as for block-encoding the Hamiltonian describing interacting pseudoions and chemically active electrons, by leveraging recent advances in quantum rejection sampling to optimize the implementations. To extract useful chemical information, we first design molecular fingerprints by combining density-functional calculations with machine learning techniques, and subsequently validate them through surrogate classical molecular dynamics simulations. These fingerprints are then coherently encoded on a quantum computer for efficient molecular identification via amplitude estimation. We provide an extensive analysis of the cost of running the algorithm on a fault-tolerant quantum computer for several chemically interesting systems. As an illustration, simulating the interaction between NH3\mathrm{NH_3}NH3​ and BF3\mathrm{BF_3}BF3​ (a 40-particle system) requires 808 logical qubits to encode the problem, and approximately 101110^{11}1011 Toffoli gates per femtosecond of time evolution. Our results establish a foundation for further quantum algorithm development targeting chemical and material dynamics.
This thesis investigates the grid-based Split Operator–Quantum Fourier Transform (SO-QFT) scheme as a general-purpose backbone for time-dependent quantum simulation. We develop an end-to-end algorithmic framework that unifies state preparation on discretised grids, SO-QFT time propagation, and the extraction of observables via autocorrelation functions, with a focus on efficient quantum circuit construction. Classical emulation is used to evaluate the performance and resource demands of this framework across diverse chemical contexts. For vibronic dynamics arising from conical intersections, we assemble a complete workflow that reproduces absorption spectra and population transfer for a well-characterised prototypical polyatomic system. On this basis, we estimate the required quantum resources by mapping grid size, time resolution and spectral precision to qubit budgets, circuit depths and measurement counts. The framework is further tailored to infrared spectroscopy through probabilistic encoding of non-unitary dipole operators and explicit treatment of higher-order Hamiltonian terms via multi-controlled operations. To minimise gate depth, we optimise time discretisation and employ approximation strategies for initial states and dipole truncations, while preserving the fidelity of computed spectra. Importantly, the resource scaling relations derived from the vibronic and infrared simulations generalise to comparable molecular systems, providing a transferable template for predicting resource estimates beyond the specific benchmark studied. Finally, the methodology is extended to Coulombic systems, whose singular potentials challenge grid-based representations. We improve the simulation fidelity by proposing two correction schemes: a Hamiltonian correction that accounts for grid-basis structure, and a modification of the initial wavefunction to better match the discretised Hamiltonian. Both corrections are compatible with compact quantum encodings, and their representation in truncated Fourier or Walsh series offers an additional reduction in circuit depth. Collectively, these studies advance the grid-based SO-QFT scheme from a promising construct to a systematically assessed framework, establishing methodological guidance, algorithmic variants and quantitative resource benchmarks for future fault-tolerant quantum applications.