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:2111.05324 · Communications in Mathematical Physics

Average-Case Speedup for Product Formulas

Chi-Fang Chen, Fernando G. S. L. Brandão

Published Feb 1, 2024• 38 citations
arXivHTMLPDF

Abstract

Abstract Quantum simulation is a promising application of future quantum computers. Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. For an accurate product formula approximation, the state-of-the-art gate complexity depends on the number of terms in the Hamiltonian and a local energy estimate. In this work, we give evidence that product formulas, in practice, may work much better than expected. We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states, while the existing estimate is for the worst states. For general k-local Hamiltonians and higher-order product formulas, we obtain gate count estimates for input states drawn from any orthogonal basis. The gate complexity significantly improves over the worst case for systems with large connectivity. Our typical-case results generalize to Hamiltonians with Fermionic terms, with input states drawn from a fixed-particle number subspace, and with Gaussian coefficients (e.g., the SYK models). Technically, we employ a family of simple but versatile inequalities from non-commutative martingales called uniform smoothness, which leads to Hypercontractivity, namely p-norm estimates for k-local operators. This delivers concentration bounds via Markov’s inequality. For optimality, we give analytic and numerical examples that simultaneously match our typical-case estimates and the existing worst-case estimates. Therefore, our improvement is due to asking a qualitatively different question, and our results open doors to the study of quantum algorithms in the average case.

DOI
10.1007/s00220-023-04912-5

Related papers

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

Concentration for Random Product Formulas

Chi-Fang Chen, Hsin-Yuan Huang, Richard Kueng +1 more

Quantum simulation has wide applications in quantum chemistry and physics.Recently, scientists have begun exploring the use of randomized methods for accelerating quantum simulation.Among them, a simple and powerful technique, called QDRIFT, is known to generate random product formulas for which the average quantum channel approximates the ideal evolution.QDRIFT achieves a gate count that does not explicitly depend on the number of terms in the Hamiltonian, which contrasts with Suzuki formulas.This work aims to understand the origin of this speedup by comprehensively analyzing a single realization of the random product formula produced by QDRIFT.The main results prove that a typical realization of the randomized product formula approximates the ideal unitary evolution up to a small diamond-norm error.The gate complexity is already independent of the number of terms in the Hamiltonian, but it depends on the system size and the sum of the interaction strengths in the Hamiltonian.Remarkably, the same random evolution starting from an arbitrary, but fixed, input state yields a much shorter circuit suitable for that input state.In contrast, in deterministic settings, such an improvement usually requires initial state knowledge.The proofs depend on concentration inequalities for vector and matrix martingales, and the framework is applicable to other randomized product formulas.Our bounds are saturated by certain commuting Hamiltonians.

arXiv:2008.11751•PRX Quantum•Oct 7, 2021•99 citations

Entanglement-Dependent Error Bounds for Hamiltonian Simulation

Prateek P. Kulkarni

We establish tight connections between entanglement entropy and the approximation error in Trotter-Suzuki product formulas for Hamiltonian simulation. Product formulas remain the workhorse of quantum simulation on near-term devices, yet standard error analyses yield worst-case bounds that can vastly overestimate the resources required for structured problems. For systems governed by geometrically local Hamiltonians with maximum entanglement entropy $S_\text{max}$ across all bipartitions, we prove that the first-order Trotter error scales as $\mathcal{O}(t^2 S_\text{max} \operatorname{polylog}(n)/r)$ rather than the worst-case $\mathcal{O}(t^2 n/r)$, where $n$ is the system size and $r$ is the number of Trotter steps. This yields improvements of $\tildeΩ(n^2)$ for one-dimensional area-law systems and $\tildeΩ(n^{3/2})$ for two-dimensional systems. We extend these bounds to higher-order Suzuki formulas, where the improvement factor involves $2^{pS^*/2}$ for the $p$-th order formula. We further establish a separation result demonstrating that volume-law entangled systems fundamentally require $\tildeΩ(n)$ more Trotter steps than area-law systems to achieve the same precision. This separation is tight up to logarithmic factors. Our analysis combines Lieb-Robinson bounds for locality, tensor network representations for entanglement structure, and novel commutator-entropy inequalities that bound the expectation value of nested commutators by the Schmidt rank of the state. These results have immediate applications to quantum chemistry, condensed matter simulation, and resource estimation for fault-tolerant quantum computing.

quant-pharXiv:2602.00555•Feb 3, 2026•1 citation

Randomized product formulas beyond optimal deterministic scaling

Leeseok Kim, Luis Pedro García-Pintos

Product formulas, also known as Trotter formulas, are among the most widely used and practical methods for simulating quantum systems on quantum computers. Here we introduce two new classes of randomized product formulas for simulating Hamiltonians with separated energy scales, $H=A+αB$, where $α$ is small. In the standard access model, where one can implement exponentials of $A$ and $B$ separately, our randomized formulas achieve $\mathcal O(α^2)$ error scaling at the cost of only doubling the gate depth of the corresponding deterministic formula. We further prove an $Ω(α)$ lower bound for deterministic product formulas. In a stronger access model, allowing exponentials of $A+αB_\ell$ for $B = \sum_{\ell}B_\ell$, our randomized formula, based on Trotter Heuristic Resource Improved Formulas for Time-dynamics (THRIFT)~[J. L. Bosse et al., Nat. Commun. 16, 2673 (2025)], achieves $\mathcal O(α^3)$ error scaling with only constant-factor expected gate overhead. We also establish an $Ω(α^2)$ lower bound for deterministic product formulas in this access model. Numerical simulations confirm gate-count reductions for simulating physically motivated systems.

quant-pharXiv:2608.07720•Aug 11, 2026•1 citation

Better product formulas for quantum phase estimation

Kasra Hejazi, Soni, Jay, Modjtaba Shokrian Zini +1 more

Quantum phase estimation requires simulating the evolution of the Hamiltonian, for which product formulas are attractive due to their smaller qubit cost and ease of implementation. However, the estimation of the error incurred by product formulas is usually pessimistic and task-agnostic, which poses problems for assessing their performance in practice for problems of interest. In this work, we study the error of product formulas for the specific task of quantum energy estimation. To this end, we employ the theory of Trotter error with a Magnus-based expansion of the effectively simulated Hamiltonian. The result is a generalization of previous energy estimation error analysis of gapped eigenstates to arbitrary order product formulas. As an application, we discover a 9-term second-order product formula with an energy estimation error that is quadratically better than Trotter-Suzuki. Furthermore, by leveraging recent work on low-energy dynamics of product formulas, we provide tighter bounds for energy estimation error in the low-energy subspace. We show that for Hamiltonians with some locality and positivity properties, the cost can achieve up to a quadratic asymptotic speedup in terms of the target error.

arXiv:2412.16811•Dec 22, 2024•4 citations

Theory of Trotter Errors for Time-Dependent Product and Multi-product Formulas

Anonymous, Tatsuhiko N. Ikeda, Keisuke Fujii

Product formula (PF), which approximates the time evolution under a many-body Hamiltonian by the product of local time-evolution operators, is one of the central approaches for simulating quantum dynamics by quantum computers. It has been of great interest whether the errors of PFs can be expressed by commutators among local terms, since it brings the substantial suppression of the computational cost in the system size reflecting the locality of Hamiltonians. Although recent studies have revealed such error bounds for generic time-independent systems, it remains to be a difficult problem for time-dependent Hamiltonians except for low-order PFs. In this paper, we derive an error bound of generic PFs for smooth time-dependent Hamiltonians, which is expressed explicitly by nested commutators and their time derivatives. It indicates the substantial error suppression in the system size for generic local Hamiltonians, thereby giving a much better estimate of gate counts. Our derivation employs Floquet theory originally developed for time-periodic systems, with which we analyze the time-dependent PF errors by mapping them to those for time-independent PFs defined on an infinite-dimensional space. This approach is also applicable to a family of time-dependent PFs, such as the one for non-unitary dynamics. In particular, we clarify the error bound of a time-dependent multi-product formula, with which we can achieve exponentially better scaling with respect to the target accuracy than the PF. Our results will shed light on applications of near-term and future quantum computers, ranging from quantum simulation of nonequilibrium materials to faster algorithms exploiting time-dependent Hamiltonians such as adiabatic state preparation.

arXiv:2410.14243•PRX Quantum•Aug 4, 2026•13 citations
Abstract Quantum simulation is a promising application of future quantum computers. Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. For an accurate product formula approximation, the state-of-the-art gate complexity depends on the number of terms in the Hamiltonian and a local energy estimate. In this work, we give evidence that product formulas, in practice, may work much better than expected. We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states, while the existing estimate is for the worst states. For general k-local Hamiltonians and higher-order product formulas, we obtain gate count estimates for input states drawn from any orthogonal basis. The gate complexity significantly improves over the worst case for systems with large connectivity. Our typical-case results generalize to Hamiltonians with Fermionic terms, with input states drawn from a fixed-particle number subspace, and with Gaussian coefficients (e.g., the SYK models). Technically, we employ a family of simple but versatile inequalities from non-commutative martingales called uniform smoothness, which leads to Hypercontractivity, namely p-norm estimates for k-local operators. This delivers concentration bounds via Markov’s inequality. For optimality, we give analytic and numerical examples that simultaneously match our typical-case estimates and the existing worst-case estimates. Therefore, our improvement is due to asking a qualitatively different question, and our results open doors to the study of quantum algorithms in the average case.
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.
Quantum simulation has wide applications in quantum chemistry and physics.Recently, scientists have begun exploring the use of randomized methods for accelerating quantum simulation.Among them, a simple and powerful technique, called QDRIFT, is known to generate random product formulas for which the average quantum channel approximates the ideal evolution.QDRIFT achieves a gate count that does not explicitly depend on the number of terms in the Hamiltonian, which contrasts with Suzuki formulas.This work aims to understand the origin of this speedup by comprehensively analyzing a single realization of the random product formula produced by QDRIFT.The main results prove that a typical realization of the randomized product formula approximates the ideal unitary evolution up to a small diamond-norm error.The gate complexity is already independent of the number of terms in the Hamiltonian, but it depends on the system size and the sum of the interaction strengths in the Hamiltonian.Remarkably, the same random evolution starting from an arbitrary, but fixed, input state yields a much shorter circuit suitable for that input state.In contrast, in deterministic settings, such an improvement usually requires initial state knowledge.The proofs depend on concentration inequalities for vector and matrix martingales, and the framework is applicable to other randomized product formulas.Our bounds are saturated by certain commuting Hamiltonians.
We establish tight connections between entanglement entropy and the approximation error in Trotter-Suzuki product formulas for Hamiltonian simulation. Product formulas remain the workhorse of quantum simulation on near-term devices, yet standard error analyses yield worst-case bounds that can vastly overestimate the resources required for structured problems. For systems governed by geometrically local Hamiltonians with maximum entanglement entropy SmaxS_\text{max}Smax​ across all bipartitions, we prove that the first-order Trotter error scales as O(t2Smaxpolylog⁡(n)/r)\mathcal{O}(t^2 S_\text{max} \operatorname{polylog}(n)/r)O(t2Smax​polylog(n)/r) rather than the worst-case O(t2n/r)\mathcal{O}(t^2 n/r)O(t2n/r), where nnn is the system size and rrr is the number of Trotter steps. This yields improvements of Ω~(n2)\tildeΩ(n^2)Ω~(n2) for one-dimensional area-law systems and Ω~(n3/2)\tildeΩ(n^{3/2})Ω~(n3/2) for two-dimensional systems. We extend these bounds to higher-order Suzuki formulas, where the improvement factor involves 2pS∗/22^{pS^*/2}2pS∗/2 for the ppp-th order formula. We further establish a separation result demonstrating that volume-law entangled systems fundamentally require Ω~(n)\tildeΩ(n)Ω~(n) more Trotter steps than area-law systems to achieve the same precision. This separation is tight up to logarithmic factors. Our analysis combines Lieb-Robinson bounds for locality, tensor network representations for entanglement structure, and novel commutator-entropy inequalities that bound the expectation value of nested commutators by the Schmidt rank of the state. These results have immediate applications to quantum chemistry, condensed matter simulation, and resource estimation for fault-tolerant quantum computing.
Product formulas, also known as Trotter formulas, are among the most widely used and practical methods for simulating quantum systems on quantum computers. Here we introduce two new classes of randomized product formulas for simulating Hamiltonians with separated energy scales, H=A+αBH=A+αBH=A+αB, where ααα is small. In the standard access model, where one can implement exponentials of AAA and BBB separately, our randomized formulas achieve O(α2)\mathcal O(α^2)O(α2) error scaling at the cost of only doubling the gate depth of the corresponding deterministic formula. We further prove an Ω(α)Ω(α)Ω(α) lower bound for deterministic product formulas. In a stronger access model, allowing exponentials of A+αBℓA+αB_\ellA+αBℓ​ for B=∑ℓBℓB = \sum_{\ell}B_\ellB=∑ℓ​Bℓ​, our randomized formula, based on Trotter Heuristic Resource Improved Formulas for Time-dynamics (THRIFT)~[J. L. Bosse et al., Nat. Commun. 16, 2673 (2025)], achieves O(α3)\mathcal O(α^3)O(α3) error scaling with only constant-factor expected gate overhead. We also establish an Ω(α2)Ω(α^2)Ω(α2) lower bound for deterministic product formulas in this access model. Numerical simulations confirm gate-count reductions for simulating physically motivated systems.
Quantum phase estimation requires simulating the evolution of the Hamiltonian, for which product formulas are attractive due to their smaller qubit cost and ease of implementation. However, the estimation of the error incurred by product formulas is usually pessimistic and task-agnostic, which poses problems for assessing their performance in practice for problems of interest. In this work, we study the error of product formulas for the specific task of quantum energy estimation. To this end, we employ the theory of Trotter error with a Magnus-based expansion of the effectively simulated Hamiltonian. The result is a generalization of previous energy estimation error analysis of gapped eigenstates to arbitrary order product formulas. As an application, we discover a 9-term second-order product formula with an energy estimation error that is quadratically better than Trotter-Suzuki. Furthermore, by leveraging recent work on low-energy dynamics of product formulas, we provide tighter bounds for energy estimation error in the low-energy subspace. We show that for Hamiltonians with some locality and positivity properties, the cost can achieve up to a quadratic asymptotic speedup in terms of the target error.
Product formula (PF), which approximates the time evolution under a many-body Hamiltonian by the product of local time-evolution operators, is one of the central approaches for simulating quantum dynamics by quantum computers. It has been of great interest whether the errors of PFs can be expressed by commutators among local terms, since it brings the substantial suppression of the computational cost in the system size reflecting the locality of Hamiltonians. Although recent studies have revealed such error bounds for generic time-independent systems, it remains to be a difficult problem for time-dependent Hamiltonians except for low-order PFs. In this paper, we derive an error bound of generic PFs for smooth time-dependent Hamiltonians, which is expressed explicitly by nested commutators and their time derivatives. It indicates the substantial error suppression in the system size for generic local Hamiltonians, thereby giving a much better estimate of gate counts. Our derivation employs Floquet theory originally developed for time-periodic systems, with which we analyze the time-dependent PF errors by mapping them to those for time-independent PFs defined on an infinite-dimensional space. This approach is also applicable to a family of time-dependent PFs, such as the one for non-unitary dynamics. In particular, we clarify the error bound of a time-dependent multi-product formula, with which we can achieve exponentially better scaling with respect to the target accuracy than the PF. Our results will shed light on applications of near-term and future quantum computers, ranging from quantum simulation of nonequilibrium materials to faster algorithms exploiting time-dependent Hamiltonians such as adiabatic state preparation.