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:2302.04698 · Physical Review Research

Quantum simulation costs for Suzuki-Trotter decomposition of quantum many-body lattice models

Nathan M. Myers, Ryan Scott, Kwon Park, V. W. Scarola

Published Jun 28, 2023• 6 citations
arXivHTMLPDF

Abstract

Quantum computers offer the potential to efficiently simulate the dynamics of quantum systems, a task whose difficulty scales exponentially with system size on classical devices. To assess the potential for near-term quantum computers to simulate many-body systems we develop a formalism to straightforwardly compute bounds on the number of Trotter steps needed to accurately simulate the time evolution of fermionic lattice models based on the first-order commutator scaling. We apply this formalism to two closely related many-body models prominent in condensed matter physics, the Hubbard and t-J models. We find that, while a naive comparison of the Trotter depth first seems to favor the Hubbard model, careful consideration of the model parameters and the allowable error for accurate simulation leads to a substantial advantage in favor of the t-J model. These results and formalism set the stage for significant improvements in quantum simulation costs.

DOI
10.1103/physrevresearch.5.023199

Related papers

Efficient Trotter-Suzuki Schemes for Long-time Quantum Dynamics

Marko Maležič, Johann Ostmeyer

Accurately simulating long-time dynamics of many-body systems is a challenge in both classical and quantum computing due to the accumulation of Trotter errors. While low-order Trotter-Suzuki decompositions are straightforward to implement, their rapidly growing error limits access to long-time observables. We present a framework for constructing efficient high-order Trotter-Suzuki schemes by identifying their structure and directly optimizing their parameters over a high-dimensional space. This method enables the discovery of new schemes with significantly improved efficiency compared to traditional constructions, such as those by Suzuki and Yoshida. Based on the theoretical efficiency and practical performance, we recommend two novel highly efficient schemes at $4^{\textrm{th}}$ and $6^{\textrm{th}}$ order. We also demonstrate the effectiveness of these decompositions on the Heisenberg model and the quantum harmonic oscillator, and find that for a fixed final time they perform better across the computational cost. Even when using large time steps, they surpass established low-order schemes like the Leapfrog. Finally, we investigate the in-practice performance of different Trotter schemes and find the decompositions with more uniform coefficients tend to feature improved error accumulation over long times. We have included this observation into our choice of recommended schemes.

quant-pharXiv:2601.18756•Journal of Physics A Mathematical and Theoretical•Jan 27, 2026•6 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 utility in simulating the real-time dynamics of the Fermi–Hubbard model using superconducting quantum computers

Talal Ahmed Chowdhury, V. E. Korepin, Vincent Richard Pascuzzi +1 more

The Fermi–Hubbard model is a fundamental model in condensed matter physics that describes strongly correlated electrons. On the other hand, quantum computers are emerging as powerful tools for exploring the complex dynamics of these quantum many-body systems. In this work, we demonstrate the quantum simulation of the one-dimensional Fermi–Hubbard model using IBM's superconducting quantum computers, employing over 100 qubits. We introduce a first-order Trotterization scheme and extend it to an optimized second-order Trotterization for the time evolution in the Fermi–Hubbard model, specifically tailored for the limited qubit connectivity of quantum architectures, such as IBM's platforms. Notably, both Trotterization approaches are scalable and maintain a constant circuit depth at each Trotter step, regardless of the qubit count, enabling us to precisely investigate the relaxation dynamics in the Fermi–Hubbard model by measuring the expectation value of the Néel observable (staggered magnetization) for time-evolved quantum states. Finally, our successful measurement of expectation values in such large-scale quantum many-body systems, especially at longer time scales with larger entanglement, highlights the quantum utility of superconducting quantum platforms over conventional classical approximation methods.

arXiv:2509.14196•Applied Physics Reviews•Mar 1, 2026•16 citations

Trotterization is Substantially Efficient for Low-Energy States

Kaoru Mizuta, Tomotaka Kuwahara

Trotterization is one of the central approaches for simulating quantum many-body dynamics on quantum computers or tensor networks. In addition to its simple implementation, recent studies have revealed that its error and cost can be reduced if the initial state is closed in the low-energy subspace. However, the improvement by the low-energy property diminishes rapidly as the Trotter order grows in the previous studies, and thus, it is mysterious whether there exists a genuine advantage of low-energy initial states. In this Letter, we resolve this problem by proving the optimal error bound and cost of Trotterization for low-energy initial states. For generic local Hamiltonians composed of positive-semidefinite terms, we show that the Trotter error is at most linear in the initial state energy Δ and polylogarithmic in the system size N. As a result, the computational cost becomes substantially small for low-energy states with Δ∈o(Ng) compared to the one for arbitrary initial states, where g denotes the energy per site and Ng means the whole-system energy. Our error bound and cost of Trotterization achieve the theoretically best scaling in the initial state energy Δ. In addition, they can be partially extended to weakly correlated initial states having low-energy expectation values, which are not necessarily closed in the low-energy subspace. Our results will pave the way for fast and accurate simulations of low-energy states, which are one of the central targets in condensed matter physics and quantum chemistry.

arXiv:2504.20746•Physical Review Letters•Aug 20, 2025•17 citations

Quantum simulation of many-body dynamics with noise-robust Trotter decomposition based on symmetric structures

Bo Yang, Naoki Negishi

The Suzuki–Trotter decomposition, which digitalizes quantum time evolution, provides a promising framework for simulating quantum dynamics on quantum hardware and exploring quantum advantage over classical computation. However, conventional Trotter circuits require a large number of non-local gates, lowering their faithfulness to the ideal dynamics when implemented on current noisy quantum hardware. While most previous studies have focused on circuit optimization, we instead propose a new Trotter decomposition that is intrinsically circuit-efficient for simulating quantum dynamics on near-term devices. Our method substantially reduces both the residual error by Trotter decomposition and the number of CNOT operations compared to conventional Trotter decompositions by exploiting the symmetry of the target model to construct an effective Hamiltonian with fewer two-qubit gates. We demonstrate the noise robustness of the proposed approach through numerical simulations of a nine-site Heisenberg model under realistic noise and further validate its experimental practicality on the IBM superconducting device, achieving a state fidelity exceeding 0.98 when combined with quantum error mitigation in the three-site case. The proposed circuit design is also compatible with existing circuit optimization techniques. Our results establish a practical route toward noise-resilient quantum simulation in many-body dynamics.

arXiv:2505.04552•AVS Quantum Science•Feb 9, 2026•2 citations

Mitigating algorithmic errors in a Hamiltonian simulation

Suguru Endo, Qi Zhao, Ying Li +2 more

Quantum computers can efficiently simulate many-body systems. As a widely used Hamiltonian simulation tool, the Trotter-Suzuki scheme splits the evolution into the number of Trotter steps $N$ and approximates the evolution of each step by a product of exponentials of each individual term of the total Hamiltonian. The algorithmic error due to the approximation can be reduced by increasing $N$, which however requires a longer circuit and hence inevitably introduces more physical errors. In this work, we first study such a trade-off and numerically find the optimal number of Trotter steps ${N}_{\mathrm{opt}}$ given a physical error model in a near-term quantum hardware. Practically, physical errors can be suppressed using recently proposed error mitigation methods. We then extend physical error mitigation methods to suppress the algorithmic error in Hamiltonian simulation. By exploiting the simulation results with different numbers of Trotter steps $N\ensuremath{\le}{N}_{\mathrm{opt}}$, we can infer the exact simulation result within a higher accuracy and hence mitigate algorithmic errors. We numerically test our scheme with a five-qubit system and show significant improvements in the simulation accuracy by applying both physical and algorithmic error mitigations.

arXiv:1808.03623•Physical Review A•Jan 18, 2019•83 citations
Quantum computers offer the potential to efficiently simulate the dynamics of quantum systems, a task whose difficulty scales exponentially with system size on classical devices. To assess the potential for near-term quantum computers to simulate many-body systems we develop a formalism to straightforwardly compute bounds on the number of Trotter steps needed to accurately simulate the time evolution of fermionic lattice models based on the first-order commutator scaling. We apply this formalism to two closely related many-body models prominent in condensed matter physics, the Hubbard and t-J models. We find that, while a naive comparison of the Trotter depth first seems to favor the Hubbard model, careful consideration of the model parameters and the allowable error for accurate simulation leads to a substantial advantage in favor of the t-J model. These results and formalism set the stage for significant improvements in quantum simulation costs.
Accurately simulating long-time dynamics of many-body systems is a challenge in both classical and quantum computing due to the accumulation of Trotter errors. While low-order Trotter-Suzuki decompositions are straightforward to implement, their rapidly growing error limits access to long-time observables. We present a framework for constructing efficient high-order Trotter-Suzuki schemes by identifying their structure and directly optimizing their parameters over a high-dimensional space. This method enables the discovery of new schemes with significantly improved efficiency compared to traditional constructions, such as those by Suzuki and Yoshida. Based on the theoretical efficiency and practical performance, we recommend two novel highly efficient schemes at 4th4^{\textrm{th}}4th and 6th6^{\textrm{th}}6th order. We also demonstrate the effectiveness of these decompositions on the Heisenberg model and the quantum harmonic oscillator, and find that for a fixed final time they perform better across the computational cost. Even when using large time steps, they surpass established low-order schemes like the Leapfrog. Finally, we investigate the in-practice performance of different Trotter schemes and find the decompositions with more uniform coefficients tend to feature improved error accumulation over long times. We have included this observation into our choice of recommended schemes.
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.
The Fermi–Hubbard model is a fundamental model in condensed matter physics that describes strongly correlated electrons. On the other hand, quantum computers are emerging as powerful tools for exploring the complex dynamics of these quantum many-body systems. In this work, we demonstrate the quantum simulation of the one-dimensional Fermi–Hubbard model using IBM's superconducting quantum computers, employing over 100 qubits. We introduce a first-order Trotterization scheme and extend it to an optimized second-order Trotterization for the time evolution in the Fermi–Hubbard model, specifically tailored for the limited qubit connectivity of quantum architectures, such as IBM's platforms. Notably, both Trotterization approaches are scalable and maintain a constant circuit depth at each Trotter step, regardless of the qubit count, enabling us to precisely investigate the relaxation dynamics in the Fermi–Hubbard model by measuring the expectation value of the Néel observable (staggered magnetization) for time-evolved quantum states. Finally, our successful measurement of expectation values in such large-scale quantum many-body systems, especially at longer time scales with larger entanglement, highlights the quantum utility of superconducting quantum platforms over conventional classical approximation methods.
Trotterization is one of the central approaches for simulating quantum many-body dynamics on quantum computers or tensor networks. In addition to its simple implementation, recent studies have revealed that its error and cost can be reduced if the initial state is closed in the low-energy subspace. However, the improvement by the low-energy property diminishes rapidly as the Trotter order grows in the previous studies, and thus, it is mysterious whether there exists a genuine advantage of low-energy initial states. In this Letter, we resolve this problem by proving the optimal error bound and cost of Trotterization for low-energy initial states. For generic local Hamiltonians composed of positive-semidefinite terms, we show that the Trotter error is at most linear in the initial state energy Δ and polylogarithmic in the system size N. As a result, the computational cost becomes substantially small for low-energy states with Δ∈o(Ng) compared to the one for arbitrary initial states, where g denotes the energy per site and Ng means the whole-system energy. Our error bound and cost of Trotterization achieve the theoretically best scaling in the initial state energy Δ. In addition, they can be partially extended to weakly correlated initial states having low-energy expectation values, which are not necessarily closed in the low-energy subspace. Our results will pave the way for fast and accurate simulations of low-energy states, which are one of the central targets in condensed matter physics and quantum chemistry.
The Suzuki–Trotter decomposition, which digitalizes quantum time evolution, provides a promising framework for simulating quantum dynamics on quantum hardware and exploring quantum advantage over classical computation. However, conventional Trotter circuits require a large number of non-local gates, lowering their faithfulness to the ideal dynamics when implemented on current noisy quantum hardware. While most previous studies have focused on circuit optimization, we instead propose a new Trotter decomposition that is intrinsically circuit-efficient for simulating quantum dynamics on near-term devices. Our method substantially reduces both the residual error by Trotter decomposition and the number of CNOT operations compared to conventional Trotter decompositions by exploiting the symmetry of the target model to construct an effective Hamiltonian with fewer two-qubit gates. We demonstrate the noise robustness of the proposed approach through numerical simulations of a nine-site Heisenberg model under realistic noise and further validate its experimental practicality on the IBM superconducting device, achieving a state fidelity exceeding 0.98 when combined with quantum error mitigation in the three-site case. The proposed circuit design is also compatible with existing circuit optimization techniques. Our results establish a practical route toward noise-resilient quantum simulation in many-body dynamics.
Quantum computers can efficiently simulate many-body systems. As a widely used Hamiltonian simulation tool, the Trotter-Suzuki scheme splits the evolution into the number of Trotter steps NNN and approximates the evolution of each step by a product of exponentials of each individual term of the total Hamiltonian. The algorithmic error due to the approximation can be reduced by increasing NNN, which however requires a longer circuit and hence inevitably introduces more physical errors. In this work, we first study such a trade-off and numerically find the optimal number of Trotter steps Nopt{N}_{\mathrm{opt}}Nopt​ given a physical error model in a near-term quantum hardware. Practically, physical errors can be suppressed using recently proposed error mitigation methods. We then extend physical error mitigation methods to suppress the algorithmic error in Hamiltonian simulation. By exploiting the simulation results with different numbers of Trotter steps $N\ensuremath{\le}{N}_{\mathrm{opt}}$, we can infer the exact simulation result within a higher accuracy and hence mitigate algorithmic errors. We numerically test our scheme with a five-qubit system and show significant improvements in the simulation accuracy by applying both physical and algorithmic error mitigations.