aiqbench analysis
This research presents a significant algorithmic breakthrough by demonstrating that non-Abelian Yang-Mills theories, such as QCD, can be efficiently simulated on quantum computers using maximal-tree gauge fixing and Quantum Singular Value Transformation (QSVT). The study establishes rigorous polynomial scaling for qubit count and gate complexity relative to simulation precision and lattice volume, addressing a major hurdle in simulating non-perturbative dynamics. These findings provide a concrete pathway toward first-principles quantum simulations of fundamental particle physics interactions.
Efficient Quantum Simulations of Yang-Mills theory with Maximal-tree Gauge
arXiv:2608.27267v1 Announce Type: cross 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.
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.
arXiv:2608.27267 [hep-lat]
(or arXiv:2608.27267v1 [hep-lat] for this version)
https://doi.org/10.48550/arXiv.2608.27267 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 220 words
Related coverage

Truncation uncertainties for accurate quantum simulations of lattice gauge theories
Quantum Journal · Sep 24, 2026

A brief history of quantum vs classical computational advantage
Quantum Journal · Sep 1, 2026
Exponential speedup in quantum simulation of Kogut-Susskind Hamiltonian via orbifold lattice
arXiv · Aug 28, 2026
An effective field theory approach to the sign problem in BFSS
arXiv · Jul 28, 2026