Trotter Error and Orbital Transformations in Quantum Phase Estimation

• URL: http://arxiv.org/abs/2602.18913v1
• Date: Sat, 21 Feb 2026 17:39:26 GMT
• Title: Trotter Error and Orbital Transformations in Quantum Phase Estimation
• Authors: Marvin Kronenberger, Mihael Erakovic, Markus Reiher,
• Abstract summary: We investigate the effect of orbital transformations on Trotter error.<n>We consider three strategies to reduce Trotter error by orbital transformation.<n>We find that localised orbital bases do not produce large Trotter errors in molecular calculations.
• Score: 1.2744523252873352
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Lower Bounds for the Trotter Error [39.58317527488534]
  The Trotter product formula is the most common approximation scheme. It is currently unknown what the minimum possible error is. This is an important quantity because upper bounds for the Trotter error are known to often be vast overestimates.
  arXiv  Detail & Related papers  (2024-10-04T00:39:42Z)
• Optimal-order Trotter-Suzuki decomposition for quantum simulation on noisy quantum computers [0.05343200742664294]
  We show that when the gate error is decreased by approximately an order of magnitude relative to typical modern values, higher-order Trotterization becomes advantageous.<n>This form of Trotterization yields a global minimum of the overall simulation error.
  arXiv  Detail & Related papers  (2024-05-02T09:48:52Z)
• Strong Error Bounds for Trotter & Strang-Splittings and Their Implications for Quantum Chemistry [39.58317527488534]
  We present a theory for error estimation, including higher-order product formulas, with explicit input state dependency.<n>Our approach overcomes two limitations of the existing operator-norm estimates in the literature.
  arXiv  Detail & Related papers  (2023-12-13T10:54:07Z)
• Measuring Trotter error and its application to precision-guaranteed Hamiltonian simulations [0.8009842832476994]
  We develop a method for measuring the Trotter error without ancillary qubits on quantum circuits. We make Trotterization precision-guaranteed, developing an algorithm named Trotter$(m,n)$. We find the adaptively chosen $mathrmdt$ to be about ten times larger than that inferred from known upper bounds of Trotter errors.
  arXiv  Detail & Related papers  (2023-07-11T16:12:38Z)
• Improved Accuracy for Trotter Simulations Using Chebyshev Interpolation [0.5729426778193399]
  We show how errors due to Trotterized time evolution can be mitigated through the use of algorithmic techniques. Our approach is to extrapolate to zero Trotter step size, akin to zero-noise extrapolation techniques for mitigating hardware errors.
  arXiv  Detail & Related papers  (2022-12-29T01:21:26Z)
• Assessment of various Hamiltonian partitionings for the electronic structure problem on a quantum computer using the Trotter approximation [0.0]
  We use fermionic and qubit algebras for the Trotterization of the electronic Hamiltonian. Use of symmetries of the electronic Hamiltonian and its fragments significantly reduces the Trotter error. Fermionic methods tend to introduce quantum circuits with a greater number of T-gates at each Trotter step.
  arXiv  Detail & Related papers  (2022-10-18T22:22:54Z)
• Simulating scalar field theories on quantum computers with limited resources [62.997667081978825]
  We present a quantum algorithm for implementing $phi4$ lattice scalar field theory on qubit computers. The algorithm allows efficient $phi4$ state preparation for a large range of input parameters in both the normal and broken symmetry phases.
  arXiv  Detail & Related papers  (2022-10-14T17:28:15Z)
• Self-healing of Trotter error in digital adiabatic state preparation [52.77024349608834]
  We prove that the first-order Trotterization of a complete adiabatic evolution has a cumulative infidelity that scales as $mathcal O(T-2 delta t2)$ instead of $mathcal O(T2delta t2)$ expected from general Trotter error bounds. This result suggests a self-healing mechanism and explains why, despite increasing $T$, infidelities for fixed-$delta t$ digitized evolutions still decrease for a wide variety of Hamiltonians.
  arXiv  Detail & Related papers  (2022-09-13T18:05:07Z)
• Quantum Error Correction with Gauge Symmetries [69.02115180674885]
  Quantum simulations of Lattice Gauge Theories (LGTs) are often formulated on an enlarged Hilbert space containing both physical and unphysical sectors. We provide simple fault-tolerant procedures that exploit such redundancy by combining a phase flip error correction code with the Gauss' law constraint.
  arXiv  Detail & Related papers  (2021-12-09T19:29:34Z)
• Realizing Repeated Quantum Error Correction in a Distance-Three Surface Code [42.394110572265376]
  We demonstrate quantum error correction using the surface code, which is known for its exceptionally high tolerance to errors. In an error correction cycle taking only $1.1,mu$s, we demonstrate the preservation of four cardinal states of the logical qubit.
  arXiv  Detail & Related papers  (2021-12-07T13:58:44Z)
• Pathologies in priors and inference for Bayesian transformers [71.97183475225215]
  No successful attempts to improve transformer models in terms of predictive uncertainty using Bayesian inference exist. We find that weight-space inference in transformers does not work well, regardless of the approximate posterior. We propose a novel method based on the implicit reparameterization of the Dirichlet distribution to apply variational inference directly to the attention weights.
  arXiv  Detail & Related papers  (2021-10-08T10:35:27Z)
• Exploiting fermion number in factorized decompositions of the electronic structure Hamiltonian [0.0]
  Previous resource analyses failed to exploit low fermionic number information in quantum chemistry simulation. We propose techniques that solve both problems by using various factorized decompositions of the electronic structure Hamiltonian.
  arXiv  Detail & Related papers  (2021-07-15T10:46:32Z)
• Exponential suppression of bit or phase flip errors with repetitive error correction [56.362599585843085]
  State-of-the-art quantum platforms typically have physical error rates near $10-3$. Quantum error correction (QEC) promises to bridge this divide by distributing quantum logical information across many physical qubits. We implement 1D repetition codes embedded in a 2D grid of superconducting qubits which demonstrate exponential suppression of bit or phase-flip errors.
  arXiv  Detail & Related papers  (2021-02-11T17:11:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.