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...
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....
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...
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}...
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...
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 de...
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.
