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:1906.11213 · Physical review. D/Physical review. D.

Gluon field digitization for quantum computers

Andrei Alexandru, Paulo F. Bedaque, Siddhartha Harmalkar, Henry Lamm, Scott Lawrence, Neill C. Warrington

Published Dec 3, 2019• 167 citations
arXivHTMLPDF

Abstract

Simulations of gauge theories on quantum computers require the digitization of continuous field variables. Digitization schemes that use the minimum amount of qubits are desirable. We present a practical scheme for digitizing $SU(3)$ gauge theories via its discrete subgroup $S(1080)$. The $S(1080)$ standard Wilson action cannot be used since a phase transition occurs as the coupling is decreased, well before the scaling regime. We propose a modified action that allows simulations in the scaling window and carry out classical Monte Carlo calculations down to lattice spacings of order $a\ensuremath{\approx}0.08\text{ }\text{ }\mathrm{fm}$. We compute a set of observables with subpercent precision at multiple lattice spacings and show that the continuum extrapolated value agrees with the full $SU(3)$ results. This suggests that this digitization scheme provides sufficient precision for noisy intermediate-scale quantum era QCD simulations.

DOI
10.1103/physrevd.100.114501

Related papers

Gluon field digitization via group space decimation for quantum computers

Ji Yao, Henry Lamm, Shuchen Zhu

Efficient digitization is required for quantum simulations of gauge theories. Schemes based on discrete subgroups use fewer qubits at the cost of systematic errors. We systematize this approach by deriving a single plaquette action for approximating general continuous gauge groups through integrating out field fluctuations. This provides insight into the effectiveness of these approximations, and how they could be improved. We accompany the scheme by simulations of pure gauge over the largest discrete subgroup of $SU(3)$ up to the third order.

arXiv:2005.14221•Physical review. D/Physical review. D.•Dec 21, 2020•87 citations

Gluon digitization via character expansion for quantum computers

Ji Yao, Henry Lamm, Shuchen Zhu

Efficient digitization is required for quantum simulations of gauge theories. Schemes based on discrete subgroups use a smaller, fixed number of qubits at the cost of systematic errors. We systematize this approach by deriving the single plaquette action through matching the continuous group action to that of a discrete one via group character expansions modulo the field fluctuation contributions. We accompany this scheme by simulations of pure gauge over the largest discrete crystal-like subgroup of $SU(3)$ up to the fifth order in the coupling constant.

arXiv:2203.02330•Physical review. D/Physical review. D.•Jun 8, 2023•38 citations

Digitizing gauge fields: Lattice Monte Carlo results for future quantum computers

Daniel C. Hackett, Kiel Howe, Ciaran Hughes +3 more

In the near-future noisy intermediate-scale quantum era of quantum computing technology, applications of quantum computing will be limited to calculations of very modest scales in terms of the number of qubits used. The need to represent numeric quantities using limited resources leads to digitization errors which must be taken into account. As a first step towards quantum simulations of realistic high-energy physics problems, we use ensembles of SU(2) lattice gauge fields generated with standard classical computing to explore the effects of digitizing elements of the gauge group to a finite set. We consider several methods for digitizing the group, finding the best performance from an action-preserving projection onto a mesh. Working in $(3+1)$ dimensions, we find that using $\ensuremath{\sim}7$ (qu)bits to represent each $\mathrm{SU}(2)$ gauge link induces a digitization error of the order of $10%$ in short-distance observables and $2%$ in long-distance observables. Promisingly, our results indicate that each $\mathrm{SU}(2)$ gauge link can be represented by $O(10)$ (qu)bits, from which we estimate that a ${16}^{3}\phantom{\rule{4pt}{0ex}}\mathrm{SU}(2)$ lattice could be simulated with no more than $O({10}^{5})$ (qu)bits. Our results on digitization are also of interest as a form of lossy compression that could be used in high-performance classical computing to alleviate communications bottlenecks.

arXiv:1811.03629•Physical Review A•Jun 28, 2019•79 citations

Efficient Quantum Simulations of Yang-Mills theory with Maximal-tree Gauge

Tianyin Li, Ying-Ying Li, Xiaoyang Wang +1 more

We develop a quantum algorithmic framework for the efficient simulation of Yang--Mills theories, including the $\mathrm{SU}(3)$ gauge theory in Quantum Chromodynamics (QCD). The framework uses maximal-tree gauge in terms of gauge field variables that removes all local gauge redundancies. In the resulting gauge-fixed formulation and digitization in the field-amplitude basis, we show that Hamiltonian time evolution admits an efficient implementation based on quantum singular value transformation (QSVT). We derive upper bounds on the total number of qubits and gate complexity, finding polynomial scaling with the inverse simulation precision $1/\varepsilon_s$, lattice volume $\mathcal{V}$, gauge coupling $g$, and target energy scale $E$. Our results provide a rigorous complexity-theoretic demonstration that non-Abelian Yang--Mills theories can be simulated efficiently on quantum computers, paving the way toward first-principles quantum simulations of non-perturbative QCD dynamics.

hep-latCross-listedarXiv:2608.27267•Aug 28, 2026•5 citations

Gauge field digitization in the Hamiltonian limit

Attila Pásztor, Dávid Pesznyák

Quantum computers can circumvent the numerical sign problem in gauge theories at finite density or in real time. Quantum simulations of gauge theories require a finite-dimensional representation of continuous gauge fields. Replacing a continuous gauge group by a finite subgroup can substantially reduce the required quantum resources, but introduces digitization errors that must be controlled in the Hamiltonian, or continuous-time, limit. Previous studies, using the isotropic Euclidean lattices showed that the freezing transition of the discrete subgroup can make it a bad approximation for the continuous group at large Euclidean couplings. Here, we study the digitization of U(1) by its Z($N$) subgroups in 2+1 dimensions using anisotropic Euclidean lattices. We derive the trajectories of the spatial and temporal gauge couplings along which the Hamiltonian limit is approached at fixed Hamiltonian coupling. While the temporal coupling exhibits power-law scaling in the continuous U(1) theory, it grows only logarithmically for finite Z($N$). Using classical lattice simulations and exact diagonalization, we verify that these trajectories reproduce the corresponding Hamiltonian theories. We find that the freezing transition persists in the Hamiltonian limit of discrete gauge groups and that finite-$N$ theories can differ substantially from U(1) even outside the frozen regime, in contrast to the behavior on isotropic Euclidean lattices, where for small couplings, the discrete group provides a very accurate approximation of the continuous group. Our results provide a classical benchmark for quantifying the systematic errors due to gauge-field digitization in quantum simulations.

arXiv:2609.07886•Sep 7, 2026•1 citation

Digital Quantum Simulation of Dynamics in Interacting Fields

Zhiyao Li

Matter under extreme conditions behaves as a non-equilibrium, strongly-interacting quantum system. Such systems are in the non-perturbative regime of quantum chromodynamics (QCD), where their time evolution is classically intractable. Quantum computing offers a promising alternative, but present-day devices are limited in qubit count and circuit depth, so efficient formulations and algorithms are key to scaling toward experimentally relevant QCD simulations. A scalable framework is established for simulating energy loss and hadronization in 1+1-dimensional SU(2) lattice gauge theory, in which a heavy quark traverses a lattice of light quarks. Classical lattice QCD methods are translated into physics-informed circuits to prepare the interacting ground state. The evolution is run on IBM's quantum processor ibm_pittsburgh, where the charge distribution and energy loss are measured. A further study develops the quantum simulation of the fully gauge-fixed SU(2) Hamiltonian in a mixed basis, a formulation that is expected to remain efficient at all gauge couplings. Digitizing the continuous gauge fields with as few as three qubits per plaquette reproduces low-energy observables with $10^{-3}$ precision. Scaling to larger systems is limited by resource overhead, which motivates truncations that preserve the relevant observables. Sequency Hierarchy Truncation (SeqHT) exploits the hierarchy in basis-operator contributions. Demonstrated on the adiabatic preparation of the $λφ^4$ ground state on ibm_sherbrooke, SeqHT reduces circuit depth by ~30%, suppressing hardware noise in the extracted observables. All simulations in this dissertation are validated on quantum hardware against classical benchmarks. These studies advance quantum simulations of real-time QCD dynamics.

quant-pharXiv:2610.28993•Oct 22, 2026•0 citations
Simulations of gauge theories on quantum computers require the digitization of continuous field variables. Digitization schemes that use the minimum amount of qubits are desirable. We present a practical scheme for digitizing SU(3)SU(3)SU(3) gauge theories via its discrete subgroup S(1080)S(1080)S(1080). The S(1080)S(1080)S(1080) standard Wilson action cannot be used since a phase transition occurs as the coupling is decreased, well before the scaling regime. We propose a modified action that allows simulations in the scaling window and carry out classical Monte Carlo calculations down to lattice spacings of order a\ensuremath≈0.08  fma\ensuremath{\approx}0.08\text{ }\text{ }\mathrm{fm}a\ensuremath≈0.08  fm. We compute a set of observables with subpercent precision at multiple lattice spacings and show that the continuum extrapolated value agrees with the full SU(3)SU(3)SU(3) results. This suggests that this digitization scheme provides sufficient precision for noisy intermediate-scale quantum era QCD simulations.
Efficient digitization is required for quantum simulations of gauge theories. Schemes based on discrete subgroups use fewer qubits at the cost of systematic errors. We systematize this approach by deriving a single plaquette action for approximating general continuous gauge groups through integrating out field fluctuations. This provides insight into the effectiveness of these approximations, and how they could be improved. We accompany the scheme by simulations of pure gauge over the largest discrete subgroup of SU(3)SU(3)SU(3) up to the third order.
Efficient digitization is required for quantum simulations of gauge theories. Schemes based on discrete subgroups use a smaller, fixed number of qubits at the cost of systematic errors. We systematize this approach by deriving the single plaquette action through matching the continuous group action to that of a discrete one via group character expansions modulo the field fluctuation contributions. We accompany this scheme by simulations of pure gauge over the largest discrete crystal-like subgroup of SU(3)SU(3)SU(3) up to the fifth order in the coupling constant.
In the near-future noisy intermediate-scale quantum era of quantum computing technology, applications of quantum computing will be limited to calculations of very modest scales in terms of the number of qubits used. The need to represent numeric quantities using limited resources leads to digitization errors which must be taken into account. As a first step towards quantum simulations of realistic high-energy physics problems, we use ensembles of SU(2) lattice gauge fields generated with standard classical computing to explore the effects of digitizing elements of the gauge group to a finite set. We consider several methods for digitizing the group, finding the best performance from an action-preserving projection onto a mesh. Working in (3+1)(3+1)(3+1) dimensions, we find that using $\ensuremath{\sim}7$ (qu)bits to represent each SU(2)\mathrm{SU}(2)SU(2) gauge link induces a digitization error of the order of 1010%10 in short-distance observables and 22%2 in long-distance observables. Promisingly, our results indicate that each SU(2)\mathrm{SU}(2)SU(2) gauge link can be represented by O(10)O(10)O(10) (qu)bits, from which we estimate that a 163SU(2){16}^{3}\phantom{\rule{4pt}{0ex}}\mathrm{SU}(2)163SU(2) lattice could be simulated with no more than O(105)O({10}^{5})O(105) (qu)bits. Our results on digitization are also of interest as a form of lossy compression that could be used in high-performance classical computing to alleviate communications bottlenecks.
We develop a quantum algorithmic framework for the efficient simulation of Yang--Mills theories, including the SU(3)\mathrm{SU}(3)SU(3) gauge theory in Quantum Chromodynamics (QCD). The framework uses maximal-tree gauge in terms of gauge field variables that removes all local gauge redundancies. In the resulting gauge-fixed formulation and digitization in the field-amplitude basis, we show that Hamiltonian time evolution admits an efficient implementation based on quantum singular value transformation (QSVT). We derive upper bounds on the total number of qubits and gate complexity, finding polynomial scaling with the inverse simulation precision 1/εs1/\varepsilon_s1/εs​, lattice volume V\mathcal{V}V, gauge coupling ggg, and target energy scale EEE. Our results provide a rigorous complexity-theoretic demonstration that non-Abelian Yang--Mills theories can be simulated efficiently on quantum computers, paving the way toward first-principles quantum simulations of non-perturbative QCD dynamics.
Quantum computers can circumvent the numerical sign problem in gauge theories at finite density or in real time. Quantum simulations of gauge theories require a finite-dimensional representation of continuous gauge fields. Replacing a continuous gauge group by a finite subgroup can substantially reduce the required quantum resources, but introduces digitization errors that must be controlled in the Hamiltonian, or continuous-time, limit. Previous studies, using the isotropic Euclidean lattices showed that the freezing transition of the discrete subgroup can make it a bad approximation for the continuous group at large Euclidean couplings. Here, we study the digitization of U(1) by its Z(NNN) subgroups in 2+1 dimensions using anisotropic Euclidean lattices. We derive the trajectories of the spatial and temporal gauge couplings along which the Hamiltonian limit is approached at fixed Hamiltonian coupling. While the temporal coupling exhibits power-law scaling in the continuous U(1) theory, it grows only logarithmically for finite Z(NNN). Using classical lattice simulations and exact diagonalization, we verify that these trajectories reproduce the corresponding Hamiltonian theories. We find that the freezing transition persists in the Hamiltonian limit of discrete gauge groups and that finite-NNN theories can differ substantially from U(1) even outside the frozen regime, in contrast to the behavior on isotropic Euclidean lattices, where for small couplings, the discrete group provides a very accurate approximation of the continuous group. Our results provide a classical benchmark for quantifying the systematic errors due to gauge-field digitization in quantum simulations.
Matter under extreme conditions behaves as a non-equilibrium, strongly-interacting quantum system. Such systems are in the non-perturbative regime of quantum chromodynamics (QCD), where their time evolution is classically intractable. Quantum computing offers a promising alternative, but present-day devices are limited in qubit count and circuit depth, so efficient formulations and algorithms are key to scaling toward experimentally relevant QCD simulations. A scalable framework is established for simulating energy loss and hadronization in 1+1-dimensional SU(2) lattice gauge theory, in which a heavy quark traverses a lattice of light quarks. Classical lattice QCD methods are translated into physics-informed circuits to prepare the interacting ground state. The evolution is run on IBM's quantum processor ibm_pittsburgh, where the charge distribution and energy loss are measured. A further study develops the quantum simulation of the fully gauge-fixed SU(2) Hamiltonian in a mixed basis, a formulation that is expected to remain efficient at all gauge couplings. Digitizing the continuous gauge fields with as few as three qubits per plaquette reproduces low-energy observables with 10−310^{-3}10−3 precision. Scaling to larger systems is limited by resource overhead, which motivates truncations that preserve the relevant observables. Sequency Hierarchy Truncation (SeqHT) exploits the hierarchy in basis-operator contributions. Demonstrated on the adiabatic preparation of the λφ4λφ^4λφ4 ground state on ibm_sherbrooke, SeqHT reduces circuit depth by ~30%, suppressing hardware noise in the extracted observables. All simulations in this dissertation are validated on quantum hardware against classical benchmarks. These studies advance quantum simulations of real-time QCD dynamics.