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:2602.18913 · Molecular Physics

Trotter Error and Orbital Transformations in Quantum Phase Estimation

Marvin Kronenberger, Mihael Erakovic, Markus Reiher

quant-phphysics.chem-phphysics.comp-phSubmitted Feb 21, 2026• Announced Feb 24, 2026• 0 citations
arXivHTMLPDF

Abstract

Quantum computation with Trotter product formulae is straightforward and requires little overhead in terms of logical qubits. The choice of the orbital basis significantly affects circuit depth, with localised orbitals yielding lowest circuit depths. However, literature results point to large Trotter errors incurred by localised orbitals. Here, we therefore investigate the effect of orbital transformations on Trotter error. We consider three strategies to reduce Trotter error by orbital transformation: (i) The a priori selection of an orbital basis that produces low Trotter error. (ii) The derivation of an orbital basis that produces a ground state energy free of Trotter error (as we observed that the Trotter error is a continuous function in the Givens-rotation parameter, from which continuity of this error upon orbital transformation can be deduced). (iii) Application of propagators that change the computational basis between Trotter steps. Our numerical results show that reliably reducing Trotter error by orbital transformations is challenging. General recipes to produce low Trotter errors cannot be easily derived, despite analytical expressions which suggest ways to decrease Trotter error. Importantly, we found that localised orbital bases do not produce large Trotter errors in molecular calculations, which is an important result for efficient QPE set-ups.

Comments
33 pages, 8 figures, 2 tables

Related papers

Trotter error and orbital transformations in quantum phase estimation

Marvin L. Kronenberger, Mihael Eraković, Markus Reiher

Quantum computation with Trotter product formulae is straightforward and requires little overhead in terms of logical qubits. The choice of the orbital basis significantly affects circuit depth, with localised orbitals yielding lowest circuit depths. However, literature results point to large Trotter errors incurred by localised orbitals. Here, we therefore investigate the effect of orbital transformations on Trotter error. We consider three strategies to reduce Trotter error by orbital transformation: (i) The a priori selection of an orbital basis that produces low Trotter error. (ii) The derivation of an orbital basis that produces a ground state energy free of Trotter error (as we observed that the Trotter error is a continuous function in the Givens-rotation parameter for index-based Trotter series-orderings, from which continuity of this error upon orbital transformation can be deduced). (iii) Application of propagators that change the computational basis between Trotter steps. Our numerical results show that reliably reducing Trotter error by orbital transformations is challenging. General recipes to produce low Trotter errors cannot be easily derived, despite analytical expressions which suggest ways to decrease Trotter error. Importantly, we found that localised orbital bases do not produce large Trotter errors in molecular calculations, which is an important result for efficient QPE set-ups.

•Jun 11, 2026•0 citations

Chemical basis of Trotter-Suzuki errors in quantum chemistry simulation

Ryan Babbush, Jarrod R. McClean, Dave Wecker +2 more

Although the simulation of quantum chemistry is one of the most anticipated applications of quantum computing, the scaling of known upper bounds on the complexity of these algorithms is daunting. Prior work has bounded errors due to discretization of the time evolution (known as ``Trotterization'') in terms of the norm of the error operator and analyzed scaling with respect to the number of spin orbitals. However, we find that these error bounds can be loose by up to 16 orders of magnitude for some molecules. Furthermore, numerical results for small systems fail to reveal any clear correlation between ground-state error and number of spin orbitals. We instead argue that chemical properties, such as the maximum nuclear charge in a molecule and the filling fraction of orbitals, can be decisive for determining the cost of a quantum simulation. Our analysis motivates several strategies to use classical processing to further reduce the required Trotter step size and estimate the necessary number of steps, without requiring additional quantum resources. Finally, we demonstrate improved methods for state preparation techniques which are asymptotically superior to proposals in the simulation literature.

arXiv:1410.8159•Physical Review A•Feb 17, 2015•209 citations

Quantum simulation of nanographenes and Trotter error cancellation

Andreas Juul Bay-Smidt, Nina Glaser, Marcel D. Fabian +3 more

Fault-tolerant quantum computing is a promising tool for simulating molecules and materials, but frequently-considered applications require substantial resources, and the gap between hardware capabilities and requirements remains significant. We propose quantum simulation of nanographene $π$-systems as relevant and scalable problems to span the gap between early and large-scale fault-tolerant quantum computing. We examine the efficiency of Trotterized quantum simulation, present a detailed analysis of worst-case, average-case and energy eigenvalue Trotter errors, and show that these Trotter error estimates vary by orders of magnitude. Trotter eigenvalue errors are obtained from a novel tensor-network-based approach which allows spectral analysis of product formulas for systems beyond brute-force calculation. Notably, we observe a Trotter error cancellation phenomenon whereby the Trotter error for energy differences between low-lying eigenstates is significantly smaller than the Trotter error for absolute energies, resulting in approximately an order of magnitude circuit depth reduction for quantum phase estimation calculation of energy gaps. This is a significant result because for most chemical applications, only energy differences are of practical relevance. We estimate that calculation of energy gaps to chemical accuracy between the ground- and excited-states within the Pariser--Parr--Pople model for large 2D nanographenes (up to 140 spin orbitals) requires circuits with $< 3.2 \times 10^7$ Toffoli gates. This work shows that considering details of chemically-relevant applications and exploiting error cancellation can lead to substantial reductions in resource requirements.

quant-pharXiv:2605.00745•May 4, 2026•6 citations

Strong error bounds for Trotter and strang-splittings and their implications for quantum chemistry

Daniel Klaus Burgarth, Paolo Facchi A, Alexander Hahn +2 more

Efficient error estimates for the Trotter product formula are central in quantum computing, mathematical physics, and numerical simulations. However, the Trotter error's dependency on the input state and its application to unbounded operators remains unclear. Here, we present a general theory for error estimation, including higher-order product formulas, with explicit input state dependency. Our approach overcomes two limitations of the existing operator-norm estimates in the literature. First, previous bounds are too pessimistic as they quantify the worst-case scenario. Second, previous bounds become trivial for unbounded operators and cannot be applied to a wide class of Trotter scenarios, including atomic and molecular Hamiltonians. Our method enables analytical treatment of Trotter errors in chemistry simulations, illustrated through a case study on the hydrogen atom. Our findings reveal the following: (i) for states with fat-tailed energy distribution, such as low-angular-momentum states of the hydrogen atom, the Trotter error scales worse than expected (sublinearly) in the number of Trotter steps; (ii) certain states do not admit an advantage in the scaling from higher-order Trotterization and, thus, the higher-order Trotter hierarchy breaks down for these states, including the hydrogen atom's ground state; (iii) the scaling of higher-order Trotter bounds might depend on the order of the Hamiltonians in the Trotter product for states with fat-tailed energy distribution. Physically, the enlarged Trotter error is caused by the atom's ionization due to the Trotter dynamics. Mathematically, we find that certain domain conditions are not satisfied by some states so higher moments of the potential and kinetic energies diverge. Our analytical error analysis agrees with numerical simulations, indicating that we can estimate the state-dependent Trotter error scaling genuinely. Published by the American Physical Society 2024

arXiv:2312.08044•Physical Review Research•Nov 18, 2024•35 citations

Practical Estimation of Trotter Error for Hamiltonian Simulation

William Maxwell, Pablo A. M. Casares, Robert A. Lang +7 more

Trotter product formulas are a leading approach for Hamiltonian simulation on quantum computers, yet their practical performance has remained difficult to assess due to the challenge of accurately estimating the Trotter error. In this work, we develop new theoretical results, algorithms, and software tools that advance the state-of-the-art in Trotter error estimation by orders of magnitude in both scale and accuracy. On the theoretical side, we prove that in the asymptotic limit the error of a product formula depends on the diagonal elements of the Baker-Campbell-Hausdorff (BCH) error operator in the eigenbasis of the Hamiltonian, rather than its full spectral norm -- yielding an improved scaling for Hamiltonian simulation using product formulas. On the algorithmic side, we introduce a compact representation of the BCH expansion that reduces the number of commutators from $\mathcal{O}(n^3)$ to $\mathcal{O}(n)$ for second-order, and from $\mathcal{O}(n^5)$ to $\mathcal{O}(n^2)$ for fourth-order formulas on $n$ fragments, complemented by an importance sampling scheme to further reduce the computational cost. We provide implementations of these techniques in software and demonstrate their power on two applications: (i) X-ray absorption spectroscopy of an electronic Hamiltonian (Li$_4$Mn$_2$O) at up to 56 qubits using tensor networks; and (ii) vibronic dynamics of naphthalene at over 100 qubits using ML-MCTDH, where we find that naive analytical bounds overestimate the required number of Trotter steps by nearly five orders of magnitude. Our framework enables, for the first time, the accurate estimation of Trotter error at practically relevant system sizes, providing a foundation for fair algorithmic comparisons and rational design of product formulas.

quant-pharXiv:2606.30738•Jul 1, 2026•7 citations

Trotter error mitigation by error profiling with shallow quantum circuit

Sangjin Lee, Young‐Seok Kim, Seungwoo Lee

Understanding the dynamics of quantum systems is crucial in many areas of physics, but simulating many-body systems presents significant challenges due to the large Hilbert space to navigate and the exponential growth of computational overhead. Quantum computers offer a promising platform to overcome these challenges, particularly for simulating the time evolution with Hamiltonians. Trotterization is a widely used approach among available algorithms in this regard, and well suited for near-term quantum devices. However, it introduces algorithmic Trotter errors due to the non-commutativity of Hamiltonian components. Several techniques such as multi-product formulas have been developed to mitigate Trotter errors, but often require deep quantum circuits, which can introduce additional physical errors. In this work, we propose a resource-efficient scheme to reduce the algorithmic Trotter error with relatively shallow circuit depth. We develop a profiling method by introducing an auxiliary parameter to estimate the error effects in expectation values, enabling significant error suppression with a fixed number of Trotter steps. Our approach offers an efficient way of quantum simulation on near-term quantum processors with shallow circuits.

arXiv:2503.09710•Mar 12, 2025•4 citations
Quantum computation with Trotter product formulae is straightforward and requires little overhead in terms of logical qubits. The choice of the orbital basis significantly affects circuit depth, with localised orbitals yielding lowest circuit depths. However, literature results point to large Trotter errors incurred by localised orbitals. Here, we therefore investigate the effect of orbital transformations on Trotter error. We consider three strategies to reduce Trotter error by orbital transformation: (i) The a priori selection of an orbital basis that produces low Trotter error. (ii) The derivation of an orbital basis that produces a ground state energy free of Trotter error (as we observed that the Trotter error is a continuous function in the Givens-rotation parameter, from which continuity of this error upon orbital transformation can be deduced). (iii) Application of propagators that change the computational basis between Trotter steps. Our numerical results show that reliably reducing Trotter error by orbital transformations is challenging. General recipes to produce low Trotter errors cannot be easily derived, despite analytical expressions which suggest ways to decrease Trotter error. Importantly, we found that localised orbital bases do not produce large Trotter errors in molecular calculations, which is an important result for efficient QPE set-ups.
Quantum computation with Trotter product formulae is straightforward and requires little overhead in terms of logical qubits. The choice of the orbital basis significantly affects circuit depth, with localised orbitals yielding lowest circuit depths. However, literature results point to large Trotter errors incurred by localised orbitals. Here, we therefore investigate the effect of orbital transformations on Trotter error. We consider three strategies to reduce Trotter error by orbital transformation: (i) The a priori selection of an orbital basis that produces low Trotter error. (ii) The derivation of an orbital basis that produces a ground state energy free of Trotter error (as we observed that the Trotter error is a continuous function in the Givens-rotation parameter for index-based Trotter series-orderings, from which continuity of this error upon orbital transformation can be deduced). (iii) Application of propagators that change the computational basis between Trotter steps. Our numerical results show that reliably reducing Trotter error by orbital transformations is challenging. General recipes to produce low Trotter errors cannot be easily derived, despite analytical expressions which suggest ways to decrease Trotter error. Importantly, we found that localised orbital bases do not produce large Trotter errors in molecular calculations, which is an important result for efficient QPE set-ups.
Although the simulation of quantum chemistry is one of the most anticipated applications of quantum computing, the scaling of known upper bounds on the complexity of these algorithms is daunting. Prior work has bounded errors due to discretization of the time evolution (known as ``Trotterization'') in terms of the norm of the error operator and analyzed scaling with respect to the number of spin orbitals. However, we find that these error bounds can be loose by up to 16 orders of magnitude for some molecules. Furthermore, numerical results for small systems fail to reveal any clear correlation between ground-state error and number of spin orbitals. We instead argue that chemical properties, such as the maximum nuclear charge in a molecule and the filling fraction of orbitals, can be decisive for determining the cost of a quantum simulation. Our analysis motivates several strategies to use classical processing to further reduce the required Trotter step size and estimate the necessary number of steps, without requiring additional quantum resources. Finally, we demonstrate improved methods for state preparation techniques which are asymptotically superior to proposals in the simulation literature.
Fault-tolerant quantum computing is a promising tool for simulating molecules and materials, but frequently-considered applications require substantial resources, and the gap between hardware capabilities and requirements remains significant. We propose quantum simulation of nanographene πππ-systems as relevant and scalable problems to span the gap between early and large-scale fault-tolerant quantum computing. We examine the efficiency of Trotterized quantum simulation, present a detailed analysis of worst-case, average-case and energy eigenvalue Trotter errors, and show that these Trotter error estimates vary by orders of magnitude. Trotter eigenvalue errors are obtained from a novel tensor-network-based approach which allows spectral analysis of product formulas for systems beyond brute-force calculation. Notably, we observe a Trotter error cancellation phenomenon whereby the Trotter error for energy differences between low-lying eigenstates is significantly smaller than the Trotter error for absolute energies, resulting in approximately an order of magnitude circuit depth reduction for quantum phase estimation calculation of energy gaps. This is a significant result because for most chemical applications, only energy differences are of practical relevance. We estimate that calculation of energy gaps to chemical accuracy between the ground- and excited-states within the Pariser--Parr--Pople model for large 2D nanographenes (up to 140 spin orbitals) requires circuits with <3.2×107< 3.2 \times 10^7<3.2×107 Toffoli gates. This work shows that considering details of chemically-relevant applications and exploiting error cancellation can lead to substantial reductions in resource requirements.
Efficient error estimates for the Trotter product formula are central in quantum computing, mathematical physics, and numerical simulations. However, the Trotter error's dependency on the input state and its application to unbounded operators remains unclear. Here, we present a general theory for error estimation, including higher-order product formulas, with explicit input state dependency. Our approach overcomes two limitations of the existing operator-norm estimates in the literature. First, previous bounds are too pessimistic as they quantify the worst-case scenario. Second, previous bounds become trivial for unbounded operators and cannot be applied to a wide class of Trotter scenarios, including atomic and molecular Hamiltonians. Our method enables analytical treatment of Trotter errors in chemistry simulations, illustrated through a case study on the hydrogen atom. Our findings reveal the following: (i) for states with fat-tailed energy distribution, such as low-angular-momentum states of the hydrogen atom, the Trotter error scales worse than expected (sublinearly) in the number of Trotter steps; (ii) certain states do not admit an advantage in the scaling from higher-order Trotterization and, thus, the higher-order Trotter hierarchy breaks down for these states, including the hydrogen atom's ground state; (iii) the scaling of higher-order Trotter bounds might depend on the order of the Hamiltonians in the Trotter product for states with fat-tailed energy distribution. Physically, the enlarged Trotter error is caused by the atom's ionization due to the Trotter dynamics. Mathematically, we find that certain domain conditions are not satisfied by some states so higher moments of the potential and kinetic energies diverge. Our analytical error analysis agrees with numerical simulations, indicating that we can estimate the state-dependent Trotter error scaling genuinely. Published by the American Physical Society 2024
Trotter product formulas are a leading approach for Hamiltonian simulation on quantum computers, yet their practical performance has remained difficult to assess due to the challenge of accurately estimating the Trotter error. In this work, we develop new theoretical results, algorithms, and software tools that advance the state-of-the-art in Trotter error estimation by orders of magnitude in both scale and accuracy. On the theoretical side, we prove that in the asymptotic limit the error of a product formula depends on the diagonal elements of the Baker-Campbell-Hausdorff (BCH) error operator in the eigenbasis of the Hamiltonian, rather than its full spectral norm -- yielding an improved scaling for Hamiltonian simulation using product formulas. On the algorithmic side, we introduce a compact representation of the BCH expansion that reduces the number of commutators from O(n3)\mathcal{O}(n^3)O(n3) to O(n)\mathcal{O}(n)O(n) for second-order, and from O(n5)\mathcal{O}(n^5)O(n5) to O(n2)\mathcal{O}(n^2)O(n2) for fourth-order formulas on nnn fragments, complemented by an importance sampling scheme to further reduce the computational cost. We provide implementations of these techniques in software and demonstrate their power on two applications: (i) X-ray absorption spectroscopy of an electronic Hamiltonian (Li4_44​Mn2_22​O) at up to 56 qubits using tensor networks; and (ii) vibronic dynamics of naphthalene at over 100 qubits using ML-MCTDH, where we find that naive analytical bounds overestimate the required number of Trotter steps by nearly five orders of magnitude. Our framework enables, for the first time, the accurate estimation of Trotter error at practically relevant system sizes, providing a foundation for fair algorithmic comparisons and rational design of product formulas.
Understanding the dynamics of quantum systems is crucial in many areas of physics, but simulating many-body systems presents significant challenges due to the large Hilbert space to navigate and the exponential growth of computational overhead. Quantum computers offer a promising platform to overcome these challenges, particularly for simulating the time evolution with Hamiltonians. Trotterization is a widely used approach among available algorithms in this regard, and well suited for near-term quantum devices. However, it introduces algorithmic Trotter errors due to the non-commutativity of Hamiltonian components. Several techniques such as multi-product formulas have been developed to mitigate Trotter errors, but often require deep quantum circuits, which can introduce additional physical errors. In this work, we propose a resource-efficient scheme to reduce the algorithmic Trotter error with relatively shallow circuit depth. We develop a profiling method by introducing an auxiliary parameter to estimate the error effects in expectation values, enabling significant error suppression with a fixed number of Trotter steps. Our approach offers an efficient way of quantum simulation on near-term quantum processors with shallow circuits.