Theory and practice of Trotter product formulas for quantum chemistry

• URL: http://arxiv.org/abs/2606.30741v1
• Date: Mon, 29 Jun 2026 18:00:08 GMT
• Title: Theory and practice of Trotter product formulas for quantum chemistry
• Abstract summary: We introduce a framework for building optimized Trotter product formulas for electronic structure Hamiltonians.<n>SPRINT integrates a generalization of classical near-integrability, randomization, symmetry protection, use of QROM, and other techniques into a thoroughly optimized methodology.<n>We show SPRINT reduces the Toffoli gate cost by a factor of $4.5$ relative to the previous state of the art for this problem.
• Score: 0.2538121404112091
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Trotter product formulas are a fundamental class of methods for Hamiltonian simulation, particularly attractive due to their low qubit requirements. However, they are often overlooked for use with fault-tolerant quantum algorithms, because of their perceived higher gate counts and the difficulty of estimating Trotter error. Here, we introduce Symmetry-Protected Randomized near-Integrable Trotter (SPRINT) formulas, a framework for building optimized product formulas for electronic structure Hamiltonians widely used in quantum chemistry. SPRINT integrates a generalization of classical near-integrability, randomization, symmetry protection, use of QROM, and other techniques into a thoroughly optimized methodology for Hamiltonian simulation. When applied to concrete simulation tasks, we find SPRINT leads to substantial reduction in gate count compared to previous approaches. Alongside SPRINT, we introduce and analyze a Generalized Rank Decomposition (GRADE) of electronic Hamiltonians that generalizes previous factorization methods. We apply these techniques to the task of simulating the X-ray absorption spectrum of Li$_4$Mn$_2$O, a candidate battery cathode material, leveraging recent advances in tight Trotter error estimation to carefully identify the best version of SPRINT for this problem. Using a Trotter error estimation tool developed in the PennyLane software platform, we show that SPRINT reduces the Toffoli gate cost by a factor of $4.5$ relative to the previous state of the art for this problem, with a gate cost only $\times 2.5$ higher than qubitization, while requiring a dramatic $\times 5.5$ fewer logical qubits. These results establish well-designed Trotter product formulas as an attractive Hamiltonian simulation method for industrially relevant problems in chemistry and materials science.

Related papers

• Scalable Lindblad Noise Learning via Stochastic Tensor-Network Simulation [48.887627688666974]
  Learning dissipation rates in large-scale open quantum systems is a major obstacle for near-term quantum technologies.<n>Here, we propose a scalable noise-learning framework for Lindblad dissipation rates that combines a simulation method, the Jump Method (TJM)<n>We demonstrate the approach on two noise models in the Ising model, in which independent dissipation rates are learned for each site up to $N_mathrmsite=16$.<n>This combination of scalable numerics and rigorous theoretical guarantees positions TJM-based noise learning as a practical foundation for characterizing dissipation in large quantum devices.
  arXiv  Detail & Related papers  (2026-08-25T15:07:11Z)
• Practical Estimation of Trotter Error for Hamiltonian Simulation [0.2538121404112091]
  Trotter product formulas are a leading approach for Hamiltonian simulation on quantum computers.<n>We develop new theoretical results, algorithms, and software tools that advance the state-of-the-art in Trottercal error estimation.
  arXiv  Detail & Related papers  (2026-06-29T18:00:06Z)
• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• Faster Algorithmic Quantum and Classical Simulations by Corrected Product Formulas [0.05653721146968206]
  Hamiltonian simulation using product formulas is arguably the most straightforward and practical approach for simulation on a quantum computer.<n>We present corrected product formulas (CPFs), a variation of product formulas achieved by injecting auxiliary terms called correctors into standard product formulas.<n>CPFs could be a valuable algorithmic tool for early fault-tolerant quantum computers with limited computing resources.
  arXiv  Detail & Related papers  (2024-09-12T17:56:43Z)
• Average-case Speedup for Product Formulas [69.68937033275746]
  Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states. Our results open doors to the study of quantum algorithms in the average case.
  arXiv  Detail & Related papers  (2021-11-09T18:49:48Z)
• Hamiltonian simulation with random inputs [74.82351543483588]
  Theory of average-case performance of Hamiltonian simulation with random initial states. Numerical evidence suggests that this theory accurately characterizes the average error for concrete models.
  arXiv  Detail & Related papers  (2021-11-08T19:08:42Z)
• Accurate methods for the analysis of strong-drive effects in parametric gates [94.70553167084388]
  We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach. We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
  arXiv  Detail & Related papers  (2021-07-06T02:02:54Z)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)
• Hamiltonian Simulation Algorithms for Near-Term Quantum Hardware [6.445605125467574]
  We develop quantum algorithms for Hamiltonian simulation "one level below" the circuit model. We analyse the impact of these techniques under the standard error model. We derive analytic circuit identities for efficiently synthesising multi-qubit evolutions from two-qubit interactions.
  arXiv  Detail & Related papers  (2020-03-15T18:22:02Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)
• Term Grouping and Travelling Salesperson for Digital Quantum Simulation [6.945601123742983]
  Digital simulation of quantum dynamics by evaluating the time evolution of a Hamiltonian is the initially proposed application of quantum computing. The large number of quantum gates required for emulating the complete second quantization form of the Hamiltonian makes such an approach unsuitable for near-term devices. We propose a new term ordering strategy, max-commute-tsp, that simultaneously mitigates both algorithmic and physical errors.
  arXiv  Detail & Related papers  (2020-01-16T18:33:24Z)

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.