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:2209.07918 · SciPost Physics Core

Recipes for the digital quantum simulation of lattice spin systems

Guido Burkard

Published Mar 10, 2025• 7 citations
arXivHTMLPDF

Abstract

We describe methods to construct digital quantum simulation algorithms for quantum spin systems on a regular lattice with local interactions. In addition to tools such as the Trotter-Suzuki expansion and graph coloring, we also discuss the efficiency gained by parallel execution of an extensive number of commuting terms. We provide resource estimates and quantum circuit elements for the most important cases and classes of spin systems. As resource estimates we indicate the total number of gates N N and simulation time T T , expressed in terms of the number n n of spin 1/2 lattice sites (qubits), target accuracy \epsilon ϵ , and simulated time t t . We provide circuit constructions that realize the simulation time T^{(1)}\propto nt^2/\epsilon T ( 1 ) ∝ n t 2 / ϵ and T^{(2q)}\propto t^{1+\eta}n^\eta/\epsilon^\eta T ( 2 q ) ∝ t 1 + η n η / ϵ η for arbitrarily small \eta = 1/2q η = 1 / 2 q for the first-order and higher-order Trotter expansions. We also discuss the potential impact of scaled gates, which have not yet been fully explored.

DOI
10.21468/scipostphyscore.8.1.030

Related papers

Optimizing digital quantum simulation of open quantum lattice models

Xie-Hang Yu, Hongchao Li, J. I. Cirac +1 more

Many-body systems arising in condensed matter physics and quantum optics inevitably couple to the environment and need to be modelled as open quantum systems. While near-optimal algorithms have been developed for simulating many-body quantum dynamics, algorithms for their open system counterparts remain less well investigated. We address the problem of simulating geometrically local many-body open quantum systems interacting with a stationary Gaussian environment. Under a smoothness assumption on the system-environment interaction, we develop near-optimal algorithms that, for a model with $N$ spins and evolution time $t$, attain a simulation error $δ$ in the system-state with $\mathcal{O}(Nt(Nt/δ)^{o(1)})$ gates, $\mathcal{O}(t(Nt/δ)^{o(1)})$ parallelized circuit depth and $\tilde{\mathcal{O}}(N(Nt/δ)^{o(1)})$ ancillas. We additionally show that, if only simulating local observables is of interest, then the circuit depth of the digital algorithm can be chosen to be independent of the system size $N$. This provides theoretical evidence for the utility of these algorithms for simulating physically relevant models, where typically local observables are of interest, on pre-fault tolerant devices. Finally, for the limiting case of Markovian dynamics with commuting jump operators, we propose two algorithms based on sampling a Wiener process and on a locally dilated Hamiltonian construction, respectively. These algorithms reduce the asymptotic gate complexity on $N$ compared to currently available algorithms in terms of the required number of geometrically local gates.

arXiv:2509.02268•Sep 2, 2025•5 citations

Improving quantum algorithms for quantum chemistry

Matthew B. Hastings, Dave Wecker, Bela Bauer +1 more

We present several improvements to the standard Trotter-Suzuki based algorithms used in the simulation of quantum chemistry on a quantum computer. First, we modify how Jordan-Wigner transformations are implemented to reduce their cost from linear or logarithmic in the number of orbitals to a constant. Our modification does not require additional ancilla qubits. Then, we demonstrate how many operations can be parallelized, leading to a further linear decrease in the parallel depth of the circuit, at the cost of a small constant factor increase in number of qubits required. Thirdly, we modify the term order in the Trotter-Suzuki decomposition, significantly reducing the error at given Trotter-Suzuki timestep. A final improvement modifies the Hamiltonian to reduce errors introduced by the non-zero Trotter-Suzuki timestep. All of these techniques are validated using numerical simulation and detailed gate counts are given for realistic molecules.

arXiv:1403.1539•Quantum Information and Computation•Jan 1, 2015•196 citations

Quantum Algorithms for Simulating the Lattice Schwinger Model

Alexander F. Shaw, Pavel Lougovski, Jesse R. Stryker +1 more

The Schwinger model (quantum electrodynamics in 1+1 dimensions) is a testbed for the study of quantum gauge field theories. We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In particular, we perform a tight analysis of low-order Trotter formula simulations of the Schwinger model, using recently derived commutator bounds, and give upper bounds on the resources needed for simulations in both scenarios. 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 / 2 Λ can be simulated on a quantum computer for time 2 x T using a number of T -gates or CNOTs in O ~ ( N 3 / 2 T 3 / 2 x Λ ) for fixed operator error. This scaling with the truncation Λ is better than that expected from algorithms such as qubitization or QDRIFT. Furthermore, we give scalable measurement schemes and algorithms to estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable–the mean pair density. Finally, we bound the root-mean-square error in estimating this observable via simulation as a function of the diamond distance between the ideal and actual CNOT channels. This work provides a rigorous analysis of simulating the Schwinger model, while also providing benchmarks against which subsequent simulation algorithms can be tested.

arXiv:2002.11146•Quantum•Aug 10, 2020•180 citations

Exponential Improvements in the Simulation of Lattice Gauge Theories Using Near-Optimal Techniques

Mason L. Rhodes, Michael Kreshchuk, Shivesh Pathak

We report a first-of-its-kind analysis on post-Trotter simulation of U(1), SU(2), and SU(3) lattice gauge theories including fermions in arbitrary spatial dimension. We provide explicit circuit constructions as well as T -gate counts and logical qubit counts for Hamiltonian simulation. We find a reduction of up to 25 orders of magnitude in space-time volume over Trotter methods for simulations of non-Abelian lattice gauge theories relevant to the standard model. This improvement results from our algorithm having polynomial scaling with the number of colors in the gauge theory, achieved by utilizing oracle constructions relying on the sparsity of physical operators, in contrast to the exponential scaling seen in state-of-the-art Trotter methods, which employ explicit mappings onto Pauli operators. Our work demonstrates that the use of advanced algorithmic techniques leads to dramatic reductions in the cost of simulating fundamental interactions, bringing it in step with resources required for first-principles quantum simulation of chemistry. Published by the American Physical Society 2024

arXiv:2405.10416•PRX Quantum•Dec 23, 2024•59 citations

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

Nathan M. Myers, Ryan Scott, Kwon Park +1 more

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.

arXiv:2302.04698•Physical Review Research•Jun 28, 2023•6 citations

Efficient Quantum Circuit Implementations of The qDRIFT Algorithm via Linear Combinations of Unitaries and Quantum Forking

I. J. David, Ilya Sinayskiy, Francesco Petruccione

Abstract Quantum computers can be used to simulate the evolution of quantum systems via the discretization of this evolution into unitary gate sequences. While Trotter-Suzuki (TS) methods stand as the most prevalent approach for quantum simulation, their effectiveness is contingent upon the sparsity of the Hamiltonian system. This is due to the precision and gate complexity of the TS method being dependent on the number of terms within the Hamiltonian. Despite attempts to mitigate this dependence through the random permutation of terms within TS methods, scalability issues persist. To address this, Campbell introduced the qDRIFT algorithm, leveraging random compilation to alleviate the reliance on the Hamiltonian’s term count. However, the initial implementation of this algorithm necessitated the involvement of classical computing resources for gate set compilation. Our study presents two novel quantum circuit implementations of the qDRIFT algorithm, eliminating the need for classical computing resources. We employ the Linear Combination of Unitaries (LCU) approach and the Quantum Forking (QF) procedure to construct efficient circuits to implement the qDRIFT algorithm. Furthermore, we conduct a comparative analysis of the gate complexities between our proposed circuits and TS methods, identifying the scenarios in which our circuits exhibit superior performance.

Journal of Physics Conference Series•Mar 1, 2025•0 citations
We describe methods to construct digital quantum simulation algorithms for quantum spin systems on a regular lattice with local interactions. In addition to tools such as the Trotter-Suzuki expansion and graph coloring, we also discuss the efficiency gained by parallel execution of an extensive number of commuting terms. We provide resource estimates and quantum circuit elements for the most important cases and classes of spin systems. As resource estimates we indicate the total number of gates N N and simulation time T T , expressed in terms of the number n n of spin 1/2 lattice sites (qubits), target accuracy \epsilon ϵ , and simulated time t t . We provide circuit constructions that realize the simulation time T^{(1)}\propto nt^2/\epsilon T ( 1 ) ∝ n t 2 / ϵ and T^{(2q)}\propto t^{1+\eta}n^\eta/\epsilon^\eta T ( 2 q ) ∝ t 1 + η n η / ϵ η for arbitrarily small \eta = 1/2q η = 1 / 2 q for the first-order and higher-order Trotter expansions. We also discuss the potential impact of scaled gates, which have not yet been fully explored.
Many-body systems arising in condensed matter physics and quantum optics inevitably couple to the environment and need to be modelled as open quantum systems. While near-optimal algorithms have been developed for simulating many-body quantum dynamics, algorithms for their open system counterparts remain less well investigated. We address the problem of simulating geometrically local many-body open quantum systems interacting with a stationary Gaussian environment. Under a smoothness assumption on the system-environment interaction, we develop near-optimal algorithms that, for a model with NNN spins and evolution time ttt, attain a simulation error δδδ in the system-state with O(Nt(Nt/δ)o(1))\mathcal{O}(Nt(Nt/δ)^{o(1)})O(Nt(Nt/δ)o(1)) gates, O(t(Nt/δ)o(1))\mathcal{O}(t(Nt/δ)^{o(1)})O(t(Nt/δ)o(1)) parallelized circuit depth and O~(N(Nt/δ)o(1))\tilde{\mathcal{O}}(N(Nt/δ)^{o(1)})O~(N(Nt/δ)o(1)) ancillas. We additionally show that, if only simulating local observables is of interest, then the circuit depth of the digital algorithm can be chosen to be independent of the system size NNN. This provides theoretical evidence for the utility of these algorithms for simulating physically relevant models, where typically local observables are of interest, on pre-fault tolerant devices. Finally, for the limiting case of Markovian dynamics with commuting jump operators, we propose two algorithms based on sampling a Wiener process and on a locally dilated Hamiltonian construction, respectively. These algorithms reduce the asymptotic gate complexity on NNN compared to currently available algorithms in terms of the required number of geometrically local gates.
We present several improvements to the standard Trotter-Suzuki based algorithms used in the simulation of quantum chemistry on a quantum computer. First, we modify how Jordan-Wigner transformations are implemented to reduce their cost from linear or logarithmic in the number of orbitals to a constant. Our modification does not require additional ancilla qubits. Then, we demonstrate how many operations can be parallelized, leading to a further linear decrease in the parallel depth of the circuit, at the cost of a small constant factor increase in number of qubits required. Thirdly, we modify the term order in the Trotter-Suzuki decomposition, significantly reducing the error at given Trotter-Suzuki timestep. A final improvement modifies the Hamiltonian to reduce errors introduced by the non-zero Trotter-Suzuki timestep. All of these techniques are validated using numerical simulation and detailed gate counts are given for realistic molecules.
The Schwinger model (quantum electrodynamics in 1+1 dimensions) is a testbed for the study of quantum gauge field theories. We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In particular, we perform a tight analysis of low-order Trotter formula simulations of the Schwinger model, using recently derived commutator bounds, and give upper bounds on the resources needed for simulations in both scenarios. 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 / 2 Λ can be simulated on a quantum computer for time 2 x T using a number of T -gates or CNOTs in O ~ ( N 3 / 2 T 3 / 2 x Λ ) for fixed operator error. This scaling with the truncation Λ is better than that expected from algorithms such as qubitization or QDRIFT. Furthermore, we give scalable measurement schemes and algorithms to estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable–the mean pair density. Finally, we bound the root-mean-square error in estimating this observable via simulation as a function of the diamond distance between the ideal and actual CNOT channels. This work provides a rigorous analysis of simulating the Schwinger model, while also providing benchmarks against which subsequent simulation algorithms can be tested.
We report a first-of-its-kind analysis on post-Trotter simulation of U(1), SU(2), and SU(3) lattice gauge theories including fermions in arbitrary spatial dimension. We provide explicit circuit constructions as well as T -gate counts and logical qubit counts for Hamiltonian simulation. We find a reduction of up to 25 orders of magnitude in space-time volume over Trotter methods for simulations of non-Abelian lattice gauge theories relevant to the standard model. This improvement results from our algorithm having polynomial scaling with the number of colors in the gauge theory, achieved by utilizing oracle constructions relying on the sparsity of physical operators, in contrast to the exponential scaling seen in state-of-the-art Trotter methods, which employ explicit mappings onto Pauli operators. Our work demonstrates that the use of advanced algorithmic techniques leads to dramatic reductions in the cost of simulating fundamental interactions, bringing it in step with resources required for first-principles quantum simulation of chemistry. Published by the American Physical Society 2024
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.
Abstract Quantum computers can be used to simulate the evolution of quantum systems via the discretization of this evolution into unitary gate sequences. While Trotter-Suzuki (TS) methods stand as the most prevalent approach for quantum simulation, their effectiveness is contingent upon the sparsity of the Hamiltonian system. This is due to the precision and gate complexity of the TS method being dependent on the number of terms within the Hamiltonian. Despite attempts to mitigate this dependence through the random permutation of terms within TS methods, scalability issues persist. To address this, Campbell introduced the qDRIFT algorithm, leveraging random compilation to alleviate the reliance on the Hamiltonian’s term count. However, the initial implementation of this algorithm necessitated the involvement of classical computing resources for gate set compilation. Our study presents two novel quantum circuit implementations of the qDRIFT algorithm, eliminating the need for classical computing resources. We employ the Linear Combination of Unitaries (LCU) approach and the Quantum Forking (QF) procedure to construct efficient circuits to implement the qDRIFT algorithm. Furthermore, we conduct a comparative analysis of the gate complexities between our proposed circuits and TS methods, identifying the scenarios in which our circuits exhibit superior performance.