Abstract
We study the effective matrix model for gauge fields and fermions on a quantum computer. We use the Variational Quantum Eigensolver (VQE) using IBM QISKit for the effective matrix model for $SU(2)$ and $SU(3)$ including fermions in the fundamental representation. For $SU(2)$ we study the effects of finite temperature and nonzero chemical potential. In all cases we find excellent agreement with the classical computation.
Introduction
Simulating gauge theories, such as Quantum Chromodynamics (QCD), is fundamental to our understanding of nuclear physics but presents a massive computational challenge. Traditional Lattice QCD methods require qubit counts far beyond the reach of current Noisy Intermediate-Scale Quantum (NISQ) hardware. To address this, we utilize effective matrix models. These models simplify the full theory while capturing essential physical phenomena like phase transitions and symmetry breaking. By mapping these models onto a quantum computer, we demonstrate a path toward simulating complex high-energy physics on near-term devices.
Methodology
Our approach utilizes a quantum-classical hybrid algorithm, the Variational Quantum Eigensolver (VQE). The continuous field operators of the gauge theory are represented using a harmonic oscillator basis, which allows for efficient mapping to qubits. For instance, a $16 \times 16$ matrix representation of a field can be encoded using only 4 qubits ($2^4 = 16$).
Quantum Circuit Design
We employed a variational form based on $R_y$ gates with a fully entangled circuit structure. This design, typically implemented with a depth of 3, allows the quantum computer to explore the complex state space of the gauge theory efficiently.
Results and Discussion
The VQE algorithm was applied to both $SU(2)$ and $SU(3)$ gauge groups. A significant milestone was the simulation of $SU(3)$, the symmetry group of the strong force, which involved a Hamiltonian mapped to 9,137 Pauli terms.
For $SU(2)$, we successfully incorporated finite temperature and chemical potential (finite density). These conditions are notoriously difficult for classical Monte Carlo simulations due to the "sign problem," yet the matrix model approach on a quantum computer yielded results nearly indistinguishable from exact classical calculations.
Convergence Analysis
The optimization process utilized the Sequential Least SQuares Programming (SLSQP) algorithm. As shown in the convergence graph, the energy levels rapidly descend toward the theoretical ground state, demonstrating the robustness of the variational approach.
| Model | Qubits | Exact Result | VQE Result |
|---|---|---|---|
| $SU(2)$ + Fermion | 4 | 0.4425673 | 0.4426310 |
| $SU(2)$ Finite Temp | 4 | 0.46617183 | 0.46617228 |
| $SU(2)$ Finite Density | 4 | -7.32051788 | -7.32051782 |
| $SU(3)$ + Fermion | 8 | -21.98808168 | -21.79308496 |
Conclusion
This study confirms that effective matrix models are a "sweet spot" for current quantum hardware. By achieving high accuracy with $SU(2)$ and $SU(3)$ models, we provide a proof-of-concept for using quantum computers to study high-energy physics under conditions that challenge classical methods. Future work will focus on extending these models to higher dimensions and larger rank groups ($SU(N)$), potentially reaching the threshold of quantum advantage.
Summary updated