The 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.
Abstract
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.
We study quantum simulation of SU(3) non-Abelian gauge theory dynamically coupled with fundamental fermions in $3+1$ dimensions by employing the lattice Hamiltonian in axial gauge that avoids Gauss's law constraints. The temporal component of the gauge field is analytically solved in terms of independent field degrees of freedom and a lattice regulated Green's function. The axial gauge condition is trivially maintained in time evolution, even under Trotterization. The gauge field degrees of freedom are expressed in the local field basis and can be efficiently transformed into the canonical conjugate momentum basis by local quantum Fourier transforms. We prove the number of qubits needed for describing all states up to an energy $E$ with an accuracy $\epsilon$ on a lattice of volume $V$ at bare coupling $g$ is bounded as $16n_A V + 12n_f V$, where $n_A \approx \log_2 (\frac{64 E'V^{4/3}}{\pi^2\epsilon} + \frac{32\sqrt{2}g n_f E'^{1/2} V^{7/6}}{\sqrt{3}\pi^3\epsilon^{1/2}} ) $ is the number of qubits needed for each independent gauge field per site with a shifted energy $E'$, and $n_f$ denotes the number of fermion flavors. We then analyze a quantum algorithm for time evolution that is based on Trotterization, quantum Fourier transform, and Jordan-Wigner transformation, for which quantum circuits can be explicitly constructed under arbitrary gauge field truncation and digitization. We find the numbers of CNOT and single-qubit rotation gates both scale as $O(n_A^4 V^{4/3}) + O(V^{5/3})$ per Trotter step for fixed $n_f\leq 6$. We conclude that quantum resources needed for simulating real-time dynamics of lattice QCD scale polynomially with volume, energy, time, accuracy, and bare Hamiltonian parameters.
Gauge invariance is central to modern physics and underpins quantum simulations of lattice gauge theories (LGTs). Existing quantum simulation approaches employ Gauss's law either to energetically suppress gauge-violating processes in analog platforms or to detect and discard gauge-violating outcomes in digital devices. Here we introduce a third paradigm, in which Gauss's law is used to dynamically generate the gauge theory itself from a substantially simpler Hamiltonian. Starting from a readily programmable three-body XXX model, we employ experimentally efficient single-qubit U(1) gauge symmetry-generator terms that induce the dynamics of a U(1) LGT. We implement this approach using 101 qubits on a 156-qubit IBM quantum processor and observe real-time dynamics in quantitative agreement with the target LGT while reducing the entangling-gate depth per Trotter step by a factor of five compared with a direct implementation. Our results establish gauge protection as a resource for Hamiltonian engineering rather than merely symmetry preservation, opening a scalable resource-efficient route towards digital quantum simulations of increasingly complex gauge theories in higher spatial dimensions.
Bárbara Andrade, Declan Millar, L. Anderson et al.· 1 citation
Quantum computing provides a promising framework for the simulation of quantum field theories, where the computational cost depends both on the quantum algorithm employed and on the representation of the Hamiltonian. We investigate a formulation of the $\phi^4$ model based on the harmonic-oscillator basis in coordinate space. We derive the lattice $\phi^4$ Hamiltonian in this representation and analyze the structure of the resulting one-body matrix and interaction tensor. We show that both exhibit an effective band-diagonal structure, allowing controlled truncations of the Hamiltonian while preserving the low-energy spectrum. We validate this formulation by comparing low-energy observables obtained from numerical diagonalization with those computed in the standard harmonic-oscillator momentum-space representation. Finally, we estimate the resources required to encode the Hamiltonian on a quantum computer using both binary and unary boson-to-qubit mappings. By exploiting effective locality, the coordinate-space representation reduces the resources required for quantum simulation over a broad range of parameters.
Gaétan Bardy, M. Saubanère, A. Tanasa· 0 citations
Glueball spectroscopy and real-time production with quantum computing require three distinct ingredients: a correlated gauge vacuum, a controlled construction of pure-gauge excitations, and a dynamical detector. We develop a physics-informed quantum-algorithm toolbox for these tasks in a $(2+1)$-dimensional $\mathbb{Z}_2$ lattice gauge theory. We use the term \emph{glueball-like} for localized closed-flux excitations on the confining side of this Abelian model, without identifying them with the non-Abelian glueballs of QCD. A loop-gas circuit and Hamiltonian variational ansatz prepare the gauge vacuum, Wilson-loop quantum subspace expansion constructs and characterizes low-lying excitations, and eigenvector continuation imports parameter-dependent dressing without a rapidly enlarged explicit loop basis. A Bethe--Salpeter-type transition amplitude quantifies the spatial broadening of the lightest state. For dynamics, a vacuum-dressed contractible-loop counter measures excess production of localized glueball-like structures. Although demonstrated in an Abelian model, the toolbox separates preparation, construction, compression, characterization, and dynamical detection in a form that is naturally extensible to non-Abelian lattice gauge theories.
We introduce determinant quantum-quantum Monte Carlo (DQ$^2$MC), a quantum algorithm that lifts the auxiliary-field sampling and averaging at the operational core of determinant quantum Monte Carlo onto a quantum computer. A determinant oracle synthesizes the DQMC amplitudes directly from a block encoding of the single-particle action matrix via quantum singular value transformations, so that the exponentially many Hubbard-Stratonovich weights are never enumerated, precomputed, or stored. Since the fermions are free for fixed auxiliary fields, the construction operates entirely at the single-particle level, requiring $O(\log N_{\mathrm{st}})$ system qubits and no Jordan-Wigner or Bravyi-Kitaev encoding, where $N_{\mathrm{st}}$ is the space-time volume. A full-quantum protocol makes observables interference amplitudes, eliminating the Markov chain and its autocorrelation time altogether; a hybrid quantum-classical protocol retains a constant-size active block of qubits and replaces the Metropolis-Hastings acceptance step with an exact heat-bath draw, so that cluster updates of any size are rejection-free, and passes only classical information between updates, admitting parallel tempering and distributed execution across quantum processors. The circuit-depth scales more favorably with spatial volume than classical DQMC, at the price of a post-selection overhead determined exactly by the largest target probability --- polynomial for smooth distributions, exponential for sharply peaked ones. Finally, the reweighting estimator underlying the fermion sign problem maps exactly onto a quantum weak value, placing the exponential cost of sign-problematic DQMC in precise correspondence with the post-selection overhead of weak-value extraction.
We study the relationship between quantum error correction, confinement, and lattice Yang-Mills theory. We first formulate decoding for finite Abelian homological codes in terms of higher form gauge fields. For positive local noise, the logical classes are topological sectors of a Nishimori ensemble, and the optimal decoding error is determined by the relative weights of the nontrivial sectors. We derive Fourier relations between logical probabilities, disorder operators, and information in the channel environment, and we give contour and fractional moment criteria for a threshold. We then study a four dimensional $\Z_N$ memory and its possible relation to confining $\PSU(N)$ vacua. Finally, we define a finite curvature center sheet model coupled to Wilson $\SU(N)$ link variables. In this model the conditional logical probabilities are center twisted Yang-Mills partition functions. A strong coupling expansion gives the leading effective interaction for the syndrome and shows that local syndrome correlations can decay even when the global sheet sectors are mixed. We also show that the likelihood for a separated pair of syndrome worldlines is the center monopole correlator. Its decay determines a transfer matrix mass. This distinguishes the suppression of global flux sectors from the local spectral information needed to discuss a mass gap.
N. Bao· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
