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:2610.35205

Basis-set error bounds for first-quantised quantum simulation of chemistry

Dominic W. Berry, Arkin Tikku, Sophia Simon, Ryan Babbush

quant-phSubmitted Oct 26, 2026• Announced Oct 27, 2026• 0 citations
arXivHTMLPDF

Abstract

In quantum simulation of electronic structure it is often expected that the estimate of the ground energy converges to the continuum basis limit at a rate of $\mathcal O(N^{-1})$ for a basis of size $N$. This has been found in analytical and numerical studies, but without a rigorous treatment of the error in the quantities considered in quantum algorithms. Here we show the $\mathcal O(N^{-1})$ scaling of the error for a wide range of cases needed for quantum simulation of chemistry. We show the error in the ground energy scales as $\mathcal O(N^{-1})$ for plane-wave as well as spatial grid bases. For the spatial grid we consider both a periodic system and a non-periodic system with open boundaries. For time evolution, our bound on the error in the state itself is weaker than $\mathcal O(N^{-1})$, but we show that the error in observables scales as $\widetilde{\mathcal O}(N^{-1})$ in important cases. In particular, we may consider a smoothed observable that describes the position of particles. We show that this error scales as $\mathcal O(N^{-5/3}+tN^{-1})$ for time $t$, again both for plane-wave and spatial grid bases. For the non-periodic grid case we use a condition that the true evolution would not result in significant leakage past the boundaries, which introduces basis error unrelated to the resolution of the discretisation. We also show the error in the kinetic energy of a particle scales as $\mathcal O((t+\log N)/N)$ for the plane-wave and grid bases. Together, these results show that $\mathcal O(N^{-1})$ scaling of the error holds for many of the relevant cases for quantum algorithms (with a trivial log factor for kinetic energy).

AI Summary

The paper asks when the commonly assumed $\mathcal O(N^{-1})$ basis-set error is valid for first-quantised simulations of interacting Coulomb systems, where $N$ counts spatial basis functions per particle. It treats plane-wave Galerkin projection and a spatial grid with a specified Fourier-truncated interaction, distinguishing discretisation errors from algorithmic implementation errors. At fixed periodic cell size, it proves ground-energy error $\mathcal O(N^{-1})$, including spin and clamped or quantum nuclei. For initial states in $D(H^2)$ with cutoff-independent Hamiltonian graph norms, smooth one-particle position expectations have error $\mathcal O(N^{-5/3}+tN^{-1})$, and individual-particle kinetic energies have error $\mathcal O((t+\log N)/N)$. These dynamical rates hold for both discretisations and also yield finite-window stopping-power error bounds. The energy proof combines Coulomb Fourier-tail estimates with the eigenvalue equation and a variational cancellation, giving discarded-state norm $\mathcal O(K^{-5/2})$ and energy error $\mathcal O(K^{-3})$, with $N=\Theta(K^3)$. Observable estimates use backward-evolved test states and duality; grid estimates additionally control omitted transfers and momentum aliasing. The kinetic-energy argument uses low-Hamiltonian-energy projections and dyadic spectral comparisons. For isolated systems, a range-truncated interaction separates resolution error from finite-cell error. Under free-space and finite-cell localisation assumptions, clamped-nucleus ground energies in a specified scalar exchange sector require sufficient basis size $\mathcal O(\epsilon^{-1}\log^3(1/\epsilon))$. Dynamical comparisons require exact-solution wavefunction and shell-gradient leakage bounds; regularity alone does not imply localisation. Constants are not optimised, sharpness is not generally established, and whether the kinetic-energy logarithm is necessary remains open.

Little sign of AI-generated textStrong assumptions

Error found: The abstract omits the D(H^2) initial-state regularity and fixed graph-norm assumptions required for its dynamical observable bounds. The abstract does not distinguish its isolated-system ground-energy guarantee, which requires clamped nuclei, a scalar exchange sector and two localisation assumptions and has total error O(L^3/N + exp(-gamma L)), from the fixed-cell O(N^(-1)) discretisation rate. The non-periodic dynamical bounds require small wavefunction leakage and small gradient leakage on the cutoff shell throughout evolution, a stronger condition than boundary probability alone.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
149 pages

Related papers

Spatial Discretization Error for Quantum Chemistry Simulation

Di Fang, Jiaqi Zhang

Nonrelativistic quantum chemistry is based on the Schrödinger equation in continuous, unbounded space. Computational approaches on classical and quantum computers often truncate the spatial domain and introduce a finite-dimensional basis, reducing the continuum problem to a finite-dimensional one. There is therefore a fundamental question: to what extent does this approximation capture the original continuum problem? In this work, we develop a general Sobolev-Galerkin framework for estimating spatial discretization errors in quantum simulation with unbounded Hamiltonians. We apply this framework to many-body Coulomb systems and establish both periodization and Galerkin error estimates for wave-function dynamics and ground-state energies. For dynamics, the finite-basis projection error of the exact wave function does not capture the full basis-discretization error: an additional dynamical projection error enters our bound at a different rate, and we introduce an inner-product argument to control this contribution. Interestingly, the spatial convergence rates for wave-function dynamics and ground-state energies differ quantitatively. For ground-state energies, we establish a sharp $M^{-1}$ convergence rate at fixed cell size, where $M$ is the number of one-particle basis functions. We also show that a uniform $M^{-1}$ convergence rate is impossible for the corresponding real-time wave-function error with general $H^2$ initial data. The analysis relies on many-body Sobolev estimates with explicit polynomial dependence on system size. Combining these estimates with state-of-the-art quantum algorithms, we obtain, to our knowledge, the first rigorous end-to-end complexity bounds for quantum simulation of molecular and electronic dynamics with all spatial errors explicitly controlled. The number of basis functions is determined directly from the continuum problem, without regularization.

quant-pharXiv:2610.25260•Oct 20, 2026•0 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

Quantum simulation of chemistry with sublinear scaling in basis size

Ryan Babbush, Dominic William Berry, Jarrod R. McClean +1 more

Abstract We present a quantum algorithm for simulating quantum chemistry with gate complexity $$\tilde {\cal{O}}(N^{1/3}\eta ^{8/3})$$ O ̃ ( N 1 ∕ 3 η 8 ∕ 3 ) where η is the number of electrons and N is the number of plane wave orbitals. In comparison, the most efficient prior algorithms for simulating electronic structure using plane waves (which are at least as efficient as algorithms using any other basis) have complexity $$\tilde {\cal{O}}(N^{8/3}{\mathrm{/}}\eta ^{2/3})$$ O ̃ ( N 8 ∕ 3 ∕ η 2 ∕ 3 ) . We achieve our scaling in first quantization by performing simulation in the rotating frame of the kinetic operator using interaction picture techniques. Our algorithm is far more efficient than all prior approaches when N ≫ η , as is needed to suppress discretization error when representing molecules in the plane wave basis, or when simulating without the Born-Oppenheimer approximation.

arXiv:1807.09802•npj Quantum Information•Nov 1, 2019•104 citations

Efficient State Preparation for the Quantum Simulation of Molecules in First Quantization

William J. Huggins, Oskar Leimkuhler, Torin F. Stetina +1 more

The quantum simulation of real molecules and materials is one of the most highly anticipated applications of quantum computing. Algorithms for simulating electronic structure using a first-quantized plane-wave representation are especially promising due to their asymptotic efficiency. However, previous proposals for preparing initial states for these simulation algorithms scale poorly with the size of the basis set. We address this shortcoming by showing how to efficiently map states defined in a Gaussian-type orbital basis to a plane-wave basis with a scaling that is logarithmic in the number of plane waves. Our key technical result is a proof that molecular orbitals constructed from Gaussian-type basis functions can be compactly represented in a plane-wave basis using matrix product states. While we expect that other approaches could achieve the same logarithmic scaling with respect to basis-set size, our proposed state-preparation technique is also highly efficient in practice. For example, in a series of numerical experiments on small molecules, we find that our approach allows us to prepare an approximation to the Hartree-Fock state using orders of magnitude fewer non-Clifford gates than a naive approach. By resolving the issue of state preparation, our work allows for the first quantum simulation of molecular systems the end-to-end complexity of which is truly sublinear in the basis-set size.

arXiv:2407.00249•PRX Quantum•Apr 28, 2025•11 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

Bounding the costs of quantum simulation of many-body physics in real space

Ian D Kivlichan, Nathan Wiebe, Ryan Babbush +1 more

Abstract We present a quantum algorithm for simulating the dynamics of a first-quantized Hamiltonian in real space based on the truncated Taylor series algorithm. We avoid the possibility of singularities by applying various cutoffs to the system and using a high-order finite difference approximation to the kinetic energy operator. We find that our algorithm can simulate η interacting particles using a number of calculations of the pairwise interactions that scales, for a fixed spatial grid spacing, as O ~ ( η 2 ) , versus the O ~ ( η 5 ) time required by previous methods (assuming the number of orbitals is proportional to η ), and scales super-polynomially better with the error tolerance than algorithms based on the Lie–Trotter–Suzuki product formula. Finally, we analyze discretization errors that arise from the spatial grid and show that under some circumstances these errors can remove the exponential speedups typically afforded by quantum simulation.

arXiv:1608.05696•Journal of Physics A Mathematical and Theoretical•Jun 7, 2017•68 citations
In quantum simulation of electronic structure it is often expected that the estimate of the ground energy converges to the continuum basis limit at a rate of O(N−1)\mathcal O(N^{-1})O(N−1) for a basis of size NNN. This has been found in analytical and numerical studies, but without a rigorous treatment of the error in the quantities considered in quantum algorithms. Here we show the O(N−1)\mathcal O(N^{-1})O(N−1) scaling of the error for a wide range of cases needed for quantum simulation of chemistry. We show the error in the ground energy scales as O(N−1)\mathcal O(N^{-1})O(N−1) for plane-wave as well as spatial grid bases. For the spatial grid we consider both a periodic system and a non-periodic system with open boundaries. For time evolution, our bound on the error in the state itself is weaker than O(N−1)\mathcal O(N^{-1})O(N−1), but we show that the error in observables scales as O~(N−1)\widetilde{\mathcal O}(N^{-1})O(N−1) in important cases. In particular, we may consider a smoothed observable that describes the position of particles. We show that this error scales as O(N−5/3+tN−1)\mathcal O(N^{-5/3}+tN^{-1})O(N−5/3+tN−1) for time ttt, again both for plane-wave and spatial grid bases. For the non-periodic grid case we use a condition that the true evolution would not result in significant leakage past the boundaries, which introduces basis error unrelated to the resolution of the discretisation. We also show the error in the kinetic energy of a particle scales as O((t+log⁡N)/N)\mathcal O((t+\log N)/N)O((t+logN)/N) for the plane-wave and grid bases. Together, these results show that O(N−1)\mathcal O(N^{-1})O(N−1) scaling of the error holds for many of the relevant cases for quantum algorithms (with a trivial log factor for kinetic energy).
The paper asks when the commonly assumed O(N−1)\mathcal O(N^{-1})O(N−1) basis-set error is valid for first-quantised simulations of interacting Coulomb systems, where NNN counts spatial basis functions per particle. It treats plane-wave Galerkin projection and a spatial grid with a specified Fourier-truncated interaction, distinguishing discretisation errors from algorithmic implementation errors.
At fixed periodic cell size, it proves ground-energy error O(N−1)\mathcal O(N^{-1})O(N−1), including spin and clamped or quantum nuclei. For initial states in D(H2)D(H^2)D(H2) with cutoff-independent Hamiltonian graph norms, smooth one-particle position expectations have error O(N−5/3+tN−1)\mathcal O(N^{-5/3}+tN^{-1})O(N−5/3+tN−1), and individual-particle kinetic energies have error O((t+log⁡N)/N)\mathcal O((t+\log N)/N)O((t+logN)/N). These dynamical rates hold for both discretisations and also yield finite-window stopping-power error bounds.
The energy proof combines Coulomb Fourier-tail estimates with the eigenvalue equation and a variational cancellation, giving discarded-state norm O(K−5/2)\mathcal O(K^{-5/2})O(K−5/2) and energy error O(K−3)\mathcal O(K^{-3})O(K−3), with N=Θ(K3)N=\Theta(K^3)N=Θ(K3). Observable estimates use backward-evolved test states and duality; grid estimates additionally control omitted transfers and momentum aliasing. The kinetic-energy argument uses low-Hamiltonian-energy projections and dyadic spectral comparisons.
For isolated systems, a range-truncated interaction separates resolution error from finite-cell error. Under free-space and finite-cell localisation assumptions, clamped-nucleus ground energies in a specified scalar exchange sector require sufficient basis size O(ϵ−1log⁡3(1/ϵ))\mathcal O(\epsilon^{-1}\log^3(1/\epsilon))O(ϵ−1log3(1/ϵ)). Dynamical comparisons require exact-solution wavefunction and shell-gradient leakage bounds; regularity alone does not imply localisation. Constants are not optimised, sharpness is not generally established, and whether the kinetic-energy logarithm is necessary remains open.
Nonrelativistic quantum chemistry is based on the Schrödinger equation in continuous, unbounded space. Computational approaches on classical and quantum computers often truncate the spatial domain and introduce a finite-dimensional basis, reducing the continuum problem to a finite-dimensional one. There is therefore a fundamental question: to what extent does this approximation capture the original continuum problem? In this work, we develop a general Sobolev-Galerkin framework for estimating spatial discretization errors in quantum simulation with unbounded Hamiltonians. We apply this framework to many-body Coulomb systems and establish both periodization and Galerkin error estimates for wave-function dynamics and ground-state energies. For dynamics, the finite-basis projection error of the exact wave function does not capture the full basis-discretization error: an additional dynamical projection error enters our bound at a different rate, and we introduce an inner-product argument to control this contribution. Interestingly, the spatial convergence rates for wave-function dynamics and ground-state energies differ quantitatively. For ground-state energies, we establish a sharp M−1M^{-1}M−1 convergence rate at fixed cell size, where MMM is the number of one-particle basis functions. We also show that a uniform M−1M^{-1}M−1 convergence rate is impossible for the corresponding real-time wave-function error with general H2H^2H2 initial data. The analysis relies on many-body Sobolev estimates with explicit polynomial dependence on system size. Combining these estimates with state-of-the-art quantum algorithms, we obtain, to our knowledge, the first rigorous end-to-end complexity bounds for quantum simulation of molecular and electronic dynamics with all spatial errors explicitly controlled. The number of basis functions is determined directly from the continuum problem, without regularization.
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.
Abstract We present a quantum algorithm for simulating quantum chemistry with gate complexity O~(N1/3η8/3)\tilde {\cal{O}}(N^{1/3}\eta ^{8/3})O~(N1/3η8/3) O ̃ ( N 1 ∕ 3 η 8 ∕ 3 ) where η is the number of electrons and N is the number of plane wave orbitals. In comparison, the most efficient prior algorithms for simulating electronic structure using plane waves (which are at least as efficient as algorithms using any other basis) have complexity O~(N8/3/η2/3)\tilde {\cal{O}}(N^{8/3}{\mathrm{/}}\eta ^{2/3})O~(N8/3/η2/3) O ̃ ( N 8 ∕ 3 ∕ η 2 ∕ 3 ) . We achieve our scaling in first quantization by performing simulation in the rotating frame of the kinetic operator using interaction picture techniques. Our algorithm is far more efficient than all prior approaches when N ≫ η , as is needed to suppress discretization error when representing molecules in the plane wave basis, or when simulating without the Born-Oppenheimer approximation.
The quantum simulation of real molecules and materials is one of the most highly anticipated applications of quantum computing. Algorithms for simulating electronic structure using a first-quantized plane-wave representation are especially promising due to their asymptotic efficiency. However, previous proposals for preparing initial states for these simulation algorithms scale poorly with the size of the basis set. We address this shortcoming by showing how to efficiently map states defined in a Gaussian-type orbital basis to a plane-wave basis with a scaling that is logarithmic in the number of plane waves. Our key technical result is a proof that molecular orbitals constructed from Gaussian-type basis functions can be compactly represented in a plane-wave basis using matrix product states. While we expect that other approaches could achieve the same logarithmic scaling with respect to basis-set size, our proposed state-preparation technique is also highly efficient in practice. For example, in a series of numerical experiments on small molecules, we find that our approach allows us to prepare an approximation to the Hartree-Fock state using orders of magnitude fewer non-Clifford gates than a naive approach. By resolving the issue of state preparation, our work allows for the first quantum simulation of molecular systems the end-to-end complexity of which is truly sublinear in the basis-set size.
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.
Abstract We present a quantum algorithm for simulating the dynamics of a first-quantized Hamiltonian in real space based on the truncated Taylor series algorithm. We avoid the possibility of singularities by applying various cutoffs to the system and using a high-order finite difference approximation to the kinetic energy operator. We find that our algorithm can simulate η interacting particles using a number of calculations of the pairwise interactions that scales, for a fixed spatial grid spacing, as O ~ ( η 2 ) , versus the O ~ ( η 5 ) time required by previous methods (assuming the number of orbitals is proportional to η ), and scales super-polynomially better with the error tolerance than algorithms based on the Lie–Trotter–Suzuki product formula. Finally, we analyze discretization errors that arise from the spatial grid and show that under some circumstances these errors can remove the exponential speedups typically afforded by quantum simulation.