Speaker
Description
We present a novel quantum algorithmic framework for simulating Quantum Chromodynamics (QCD) on quantum computers. By employing the axial gauge ($A_3 = 0$) and the addition of non-local gauge fixings, this framework explicitly eliminates all local redundant gauge degrees of freedom. Within this formalism, we rigorously establish upper bounds on both the qubit overhead and the gate complexity of the time-evolution operator required for QCD simulation. We demonstrate that these resource requirements scale polynomially with the desired simulation precision $\varepsilon_s$, the lattice volume $\mathcal{V}$, the QCD coupling constant $g$, and the target physical energy scale $E$. For the first time, our work provides a rigorous theoretical proof of ``QCD can be simulated on quantum computers efficiently", laying a solid theoretical foundation for its realization on future fault-tolerant quantum architectures.
