Toward Quantum Simulation of SU(2) Gauge Theory using Non-Compact Variables

• URL: http://arxiv.org/abs/2604.04837v1
• Date: Mon, 06 Apr 2026 16:40:19 GMT
• Title: Toward Quantum Simulation of SU(2) Gauge Theory using Non-Compact Variables
• Abstract summary: Simulating lattice gauge theories on quantum computers presents unique challenges.<n>The orbifold lattice approach offers a scalable method for simulating SU($N$) gauge theories in arbitrary dimensions.<n>We present three improvements: (i) two new simplified Hamiltonians, (ii) an encoding of the SU(2) theory with smaller number of qubits, and (iii) a reduction in the requirement for large scalar masses to reach the Kogut-Susskind limit.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Simulating lattice gauge theories on quantum computers presents unique challenges that drive the development of novel theoretical frameworks. The orbifold lattice approach offers a scalable method for simulating SU($N$) gauge theories in arbitrary dimensions. In this work, we present three improvements: (i) two new simplified Hamiltonians, (ii) an encoding of the SU(2) theory with smaller number of qubits, and (iii) a reduction in the requirement for large scalar masses to reach the Kogut-Susskind limit, achieved via the inclusion of an additional term in the Hamiltonian. These advancements significantly reduce circuit depth and qubit requirements for quantum simulations. We benchmarked these improvements using Monte Carlo simulations of SU(2) in (2+1) dimensions. Preliminary results demonstrate the effectiveness of these developments and further validate the use of noncompact variables as a promising framework for scalable quantum simulations of gauge theories.

Related papers

• A minimal implementation of Yang--Mills theory on a digital quantum computer [0.0]
  We present a minimal implementation of SU($N$) pure Yang-Mills theory in $3+1$ dimensions for digital quantum simulation.<n>Building on the orbifold lattice simulation protocol with logarithmic scaling in the local Hilbert-space truncation, we introduce further simplified Hamiltonians.<n>For the SU(2) theory, we can cut the resource requirement further by utilizing the embedding of $mathrmSU(2)congmathrmS3$ into $mathbbR4$.
  arXiv  Detail & Related papers  (2026-04-16T15:14:16Z)
• Enhancing Variational Quantum Eigensolvers for SU(2) Lattice Gauge Theory via Systematic State Preparation [30.701912352193677]
  We adapt the variational quantum eigensolver to non-Abelian gauge theories.<n>We outline scaling advantages when using a spin-network basis to simulate the gauge-invariant Hilbert space.<n>In this toy model, simulations allow us to investigate the impact of noise expected in current quantum devices.
  arXiv  Detail & Related papers  (2026-03-04T07:22:36Z)
• Simulating Fully Gauge-Fixed SU(2) Hamiltonian Dynamics on Digital Quantum Computers [1.0716269823733435]
  This work focuses on the quantum simulation of the smallest non-trivial system: two plaquettes with open boundary conditions.<n>It is found that as few as three qubits per plaquette is sufficient to reach per-mille level precision on predictions for observables.
  arXiv  Detail & Related papers  (2025-12-28T04:56:25Z)
• Non-Abelian dynamics on a cube: improving quantum compilation through qudit-based simulations [0.0]
  Recent developments in mapping lattice gauge theories relevant to the Standard Model onto digital quantum computers identify scalable paths with well-defined quantum compilation challenges toward the continuum.<n>We address the simulation of SU(2) lattice gauge theory using qudit registers to encode the digitized gauge field.<n>We demonstrate an end-to-end simulation of real-time, qutrit-digitized SU(2) dynamics on a cube.
  arXiv  Detail & Related papers  (2025-06-12T17:49:08Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Quantum Tunneling: From Theory to Error-Mitigated Quantum Simulation [49.1574468325115]
  This study presents the theoretical background and the hardware aware circuit implementation of a quantum tunneling simulation. We use error mitigation techniques (ZNE and REM) and multiprogramming of the quantum chip for solving the hardware under-utilization problem.
  arXiv  Detail & Related papers  (2024-04-10T14:27:07Z)
• General quantum algorithms for Hamiltonian simulation with applications to a non-Abelian lattice gauge theory [44.99833362998488]
  We introduce quantum algorithms that can efficiently simulate certain classes of interactions consisting of correlated changes in multiple quantum numbers. The lattice gauge theory studied is the SU(2) gauge theory in 1+1 dimensions coupled to one flavor of staggered fermions. The algorithms are shown to be applicable to higher-dimensional theories as well as to other Abelian and non-Abelian gauge theories.
  arXiv  Detail & Related papers  (2022-12-28T18:56:25Z)
• Quantum algorithms for grid-based variational time evolution [36.136619420474766]
  We propose a variational quantum algorithm for performing quantum dynamics in first quantization. Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
  arXiv  Detail & Related papers  (2022-03-04T19:00:45Z)
• Two-dimensional $\mathbb{Z}_2$ lattice gauge theory on a near-term quantum simulator: variational quantum optimization, confinement, and topological order [0.0]
  We propose an implementation of a two-dimensional $mathbbZ$ lattice gauge theory model on a shallow quantum circuit. The ground state preparation is numerically analyzed on a small lattice with a variational quantum algorithm. Our work shows that variational quantum algorithms provide a useful technique to be added in the growing toolbox for digital simulations of lattice gauge theories.
  arXiv  Detail & Related papers  (2021-12-22T10:45:33Z)
• Quantum simulation of gauge theory via orbifold lattice [47.28069960496992]
  We propose a new framework for simulating $textU(k)$ Yang-Mills theory on a universal quantum computer. We discuss the application of our constructions to computing static properties and real-time dynamics of Yang-Mills theories.
  arXiv  Detail & Related papers  (2020-11-12T18:49:11Z)
• Towards simulating 2D effects in lattice gauge theories on a quantum computer [1.327151508840301]
  We propose an experimental quantum simulation scheme to study ground state properties in two-dimensional quantum electrodynamics (2D QED) using existing quantum technology. The proposal builds on a formulation of lattice gauge theories as effective spin models in arXiv:2006.14160. We present two Variational Quantum Eigensolver (VQE) based protocols for the study of magnetic field effects, and for taking an important first step towards computing the running coupling of QED.
  arXiv  Detail & Related papers  (2020-08-21T01:20:55Z)
• State preparation and measurement in a quantum simulation of the O(3) sigma model [65.01359242860215]
  We show that fixed points of the non-linear O(3) sigma model can be reproduced near a quantum phase transition of a spin model with just two qubits per lattice site. We apply Trotter methods to obtain results for the complexity of adiabatic ground state preparation in both the weak-coupling and quantum-critical regimes. We present and analyze a quantum algorithm based on non-unitary randomized simulation methods.
  arXiv  Detail & Related papers  (2020-06-28T23:44:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.