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:quant-ph/0510027 · Physical Review A

Simulating lattice gauge theories on a quantum computer

Tim Byrnes, Y. Yamamoto

Published Feb 17, 2006• 221 citations
arXivHTMLPDF

Abstract

We examine the problem of simulating lattice gauge theories on a universal quantum computer. The basic strategy of our approach is to transcribe lattice gauge theories in the Hamiltonian formulation into a Hamiltonian involving only Pauli spin operators such that the simulation can be performed on a quantum computer using only one- and two-qubit manipulations. We examine three models, the U(1), SU(2), and SU(3) lattice gauge theories, which are transcribed into a spin Hamiltonian up to a cutoff in the Hilbert space of the gauge fields on the lattice. The number of qubits required for storing a particular state is found to have a linear dependence on the total number of lattice sites. The number of qubit operations required for performing the time evolution corresponding to the Hamiltonian is found to be between a linear to quadratic function of the number of lattice sites, depending on the arrangement of qubits in the quantum computer. We remark that our results may also be easily generalized to higher $\mathrm{SU}(N)$ gauge theories.

DOI
10.1103/physreva.73.022328

Related papers

Lattice Quantum Chromodynamics and Electrodynamics on a Universal Quantum Computer

Angus Kan, Yunseong Nam

It is widely anticipated that a large-scale quantum computer will offer an evermore accurate simulation of nature, opening the floodgates for exciting scientific breakthroughs and technological innovations. Here, we show a complete, instruction-by-instruction rubric to simulate U(1), SU(2), and SU(3) lattice gauge theories on a quantum computer. These theories describe quantum electrodynamics and chromodynamics, the key ingredients that form the fabric of our universe. We further provide a concrete estimate of the quantum computational resources required for an accurate simulation of lattice gauge theories using a second-order product formula. We show that lattice gauge theories in any spatial dimension can be simulated using $\tilde{O}(T^{3/2}N^{3/2}Λ/ε^{1/2})$ T gates, where $N$ is the number of lattice sites, $Λ$ is the bosonic gauge field truncation, and $T$ is the simulation time.

arXiv:2107.12769•Jul 27, 2021•20 citations

Quantum Simulation of Large N Lattice Gauge Theories

Anthony N. Ciavarella, C. Bauer

A Hamiltonian lattice formulation of lattice gauge theories opens the possibility for quantum simulations of the non-perturbative dynamics of QCD. By parametrizing the gauge invariant Hilbert space in terms of plaquette degrees of freedom, we show how the Hilbert space and interactions can be expanded in inverse powers of N. At leading order in this expansion, the Hamiltonian simplifies dramatically, both in the required size of the Hilbert space as well as the type of interactions involved. Adding a truncation of the resulting Hilbert space in terms of local electric energy states we give explicit constructions that allow simple representations of SU(3) gauge fields on qubits and qutrits to leading order in large N.

arXiv:2411.16704•International Symposium on Lattice Field Theory (LATTICE)•Dec 5, 2024•1 citation

Investigating how to simulate lattice gauge theories on a quantum computer

Emanuele Mendicelli

Quantum computers have the potential to expand the utility of lattice gauge theory to investigate non-perturbative particle physics phenomena that cannot be accessed using a standard Monte Carlo method due to the sign problem. Thanks to the qubit, quantum computers can store Hilbert space in a more efficient way compared to classical computers. This allows the Hamiltonian approach to be computationally feasible, leading to absolute freedom from the sign-problem. But what the current noisy intermediate scale quantum hardware can achieve is under investigation, and therefore we chose to study the energy spectrum and the time evolution of an SU(2) theory using two kinds of quantum hardware: the D-Wave quantum annealer and the IBM gate-based quantum hardware.

arXiv:2308.15421•Aug 29, 2023•0 citations

Quantum circuits for SU(3) lattice gauge theory

Praveen Balaji, Cianán Conefrey-Shinozaki, Patrick Draper +5 more

Lattice gauge theories in varying dimensions, lattice volumes, and truncations offer a rich family of targets for Hamiltonian simulation on quantum devices. In return, formulating quantum simulations can provide new ways of thinking about the quantum structure of gauge theories. In this work, we consider pure S U ( 3 ) gauge theory in two and three spatial dimensions in a streamlined version of the electric basis. We use a formulation of the theory that balances locality of the Hamiltonian and size of the gauge-invariant state space, and we classically pre-compute dictionaries of plaquette operator matrix elements for use in circuit construction. We build circuits for simulating time evolution on arbitrary lattice volumes, spanning circuits suitable for Noisy Intermediate-Scale Quantum era hardware to future fault-tolerant devices. Relative to spin models, time evolution in lattice gauge theories involves more complex local unitaries, and the Hilbert space of all quantum registers may have large unphysical subspaces. Based on these features, we develop general, volume-scalable tools for optimizing circuit depth, including pruning and fusion algorithms for collections of large multicontrolled unitaries. We describe scalings of quantum resources needed to simulate larger circuits and some directions for future algorithmic development.

arXiv:2503.08866•Physical review. D/Physical review. D.•Aug 26, 2025•12 citations

Toward scalable simulations of lattice gauge theories on quantum computers

Simon V. Mathis, Guglielmo Mazzola, Ivano Tavernelli

The simulation of real-time dynamics in lattice gauge theories is particularly hard for classical computing due to the exponential scaling of the required resources. On the other hand, quantum algorithms can potentially perform the same calculation with a polynomial dependence on the number of degrees of freedom. A precise estimation is however particularly challenging for the simulation of lattice gauge theories in arbitrary dimensions, where gauge fields are dynamical variables, in addition to the particle fields. Moreover, there exist several choices for discretizing particles and gauge fields on a lattice, each of them coming at different prices in terms of qubit register size and circuit depth. Here we provide a resource counting for real-time evolution of $U(1)$ gauge theories, such as quantum electrodynamics, on arbitrary dimension using the Wilson fermion representation for the particles, and the quantum link model approach for the gauge fields. We study the phenomena of flux-string breaking up to a genuine bidimensional model using classical simulations of the quantum circuits and discuss the advantages of our discretization choice in simulation of more challenging $SU(N)$ gauge theories such as quantum chromodynamics.

arXiv:2005.10271•Physical review. D/Physical review. D.•Nov 4, 2020•68 citations

Gauss's Law, Duality, and the Hamiltonian Framework of Lattice Gauge Theory

Jesse R. Stryker, David B. Kaplan

Quantum computers have the potential to solve certain problems in lattice gauge theory that are thought to be exponentially hard for classical computers. The proposed starting point for such computations has been the Kogut-Susskind Hamiltonian supplemented by the Gauss law constraint, with a cutoff on electric field values. There are several disadvantages to this approach, including having to simulate the vast unphysical part of the Hilbert space. We consider pure U(1) gauge theory, and, motivated to restrict the calculation to purely physical states, are immediately led to a duality transformation. We highlight the potential advantages this formulation of lattice gauge theory could have for simulations on quantum computers.

International Symposium on Lattice Field Theory (LATTICE)•May 29, 2019•3 citations
We examine the problem of simulating lattice gauge theories on a universal quantum computer. The basic strategy of our approach is to transcribe lattice gauge theories in the Hamiltonian formulation into a Hamiltonian involving only Pauli spin operators such that the simulation can be performed on a quantum computer using only one- and two-qubit manipulations. We examine three models, the U(1), SU(2), and SU(3) lattice gauge theories, which are transcribed into a spin Hamiltonian up to a cutoff in the Hilbert space of the gauge fields on the lattice. The number of qubits required for storing a particular state is found to have a linear dependence on the total number of lattice sites. The number of qubit operations required for performing the time evolution corresponding to the Hamiltonian is found to be between a linear to quadratic function of the number of lattice sites, depending on the arrangement of qubits in the quantum computer. We remark that our results may also be easily generalized to higher SU(N)\mathrm{SU}(N)SU(N) gauge theories.
It is widely anticipated that a large-scale quantum computer will offer an evermore accurate simulation of nature, opening the floodgates for exciting scientific breakthroughs and technological innovations. Here, we show a complete, instruction-by-instruction rubric to simulate U(1), SU(2), and SU(3) lattice gauge theories on a quantum computer. These theories describe quantum electrodynamics and chromodynamics, the key ingredients that form the fabric of our universe. We further provide a concrete estimate of the quantum computational resources required for an accurate simulation of lattice gauge theories using a second-order product formula. We show that lattice gauge theories in any spatial dimension can be simulated using O~(T3/2N3/2Λ/ε1/2)\tilde{O}(T^{3/2}N^{3/2}Λ/ε^{1/2})O~(T3/2N3/2Λ/ε1/2) T gates, where NNN is the number of lattice sites, ΛΛΛ is the bosonic gauge field truncation, and TTT is the simulation time.
A Hamiltonian lattice formulation of lattice gauge theories opens the possibility for quantum simulations of the non-perturbative dynamics of QCD. By parametrizing the gauge invariant Hilbert space in terms of plaquette degrees of freedom, we show how the Hilbert space and interactions can be expanded in inverse powers of N. At leading order in this expansion, the Hamiltonian simplifies dramatically, both in the required size of the Hilbert space as well as the type of interactions involved. Adding a truncation of the resulting Hilbert space in terms of local electric energy states we give explicit constructions that allow simple representations of SU(3) gauge fields on qubits and qutrits to leading order in large N.
Quantum computers have the potential to expand the utility of lattice gauge theory to investigate non-perturbative particle physics phenomena that cannot be accessed using a standard Monte Carlo method due to the sign problem. Thanks to the qubit, quantum computers can store Hilbert space in a more efficient way compared to classical computers. This allows the Hamiltonian approach to be computationally feasible, leading to absolute freedom from the sign-problem. But what the current noisy intermediate scale quantum hardware can achieve is under investigation, and therefore we chose to study the energy spectrum and the time evolution of an SU(2) theory using two kinds of quantum hardware: the D-Wave quantum annealer and the IBM gate-based quantum hardware.
Lattice gauge theories in varying dimensions, lattice volumes, and truncations offer a rich family of targets for Hamiltonian simulation on quantum devices. In return, formulating quantum simulations can provide new ways of thinking about the quantum structure of gauge theories. In this work, we consider pure S U ( 3 ) gauge theory in two and three spatial dimensions in a streamlined version of the electric basis. We use a formulation of the theory that balances locality of the Hamiltonian and size of the gauge-invariant state space, and we classically pre-compute dictionaries of plaquette operator matrix elements for use in circuit construction. We build circuits for simulating time evolution on arbitrary lattice volumes, spanning circuits suitable for Noisy Intermediate-Scale Quantum era hardware to future fault-tolerant devices. Relative to spin models, time evolution in lattice gauge theories involves more complex local unitaries, and the Hilbert space of all quantum registers may have large unphysical subspaces. Based on these features, we develop general, volume-scalable tools for optimizing circuit depth, including pruning and fusion algorithms for collections of large multicontrolled unitaries. We describe scalings of quantum resources needed to simulate larger circuits and some directions for future algorithmic development.
The simulation of real-time dynamics in lattice gauge theories is particularly hard for classical computing due to the exponential scaling of the required resources. On the other hand, quantum algorithms can potentially perform the same calculation with a polynomial dependence on the number of degrees of freedom. A precise estimation is however particularly challenging for the simulation of lattice gauge theories in arbitrary dimensions, where gauge fields are dynamical variables, in addition to the particle fields. Moreover, there exist several choices for discretizing particles and gauge fields on a lattice, each of them coming at different prices in terms of qubit register size and circuit depth. Here we provide a resource counting for real-time evolution of U(1)U(1)U(1) gauge theories, such as quantum electrodynamics, on arbitrary dimension using the Wilson fermion representation for the particles, and the quantum link model approach for the gauge fields. We study the phenomena of flux-string breaking up to a genuine bidimensional model using classical simulations of the quantum circuits and discuss the advantages of our discretization choice in simulation of more challenging SU(N)SU(N)SU(N) gauge theories such as quantum chromodynamics.
Quantum computers have the potential to solve certain problems in lattice gauge theory that are thought to be exponentially hard for classical computers. The proposed starting point for such computations has been the Kogut-Susskind Hamiltonian supplemented by the Gauss law constraint, with a cutoff on electric field values. There are several disadvantages to this approach, including having to simulate the vast unphysical part of the Hilbert space. We consider pure U(1) gauge theory, and, motivated to restrict the calculation to purely physical states, are immediately led to a duality transformation. We highlight the potential advantages this formulation of lattice gauge theory could have for simulations on quantum computers.