The HALO Engine: O(1)-Step Compilation and Localized String Rupture for Lattice Gauge Theories on Quantum Hardware
Abhiroop Gohar
Abstract
Simulating real-time dynamics in lattice gauge theories (LGTs) is severely constrained by the circuit depth overhead of standard fermion-to-qubit mappings, which scale linearly or quadratically with system size. To overcome this depth-scaling bottleneck, we introduce the Hardware-Aware Lattice Optimization (HALO) compiler, an architecture executing global time-evolution in an immutable O(1) circuit depth per Trotter step. By natively mapping composite gauge links to hardware topologies, HALO achieves a 91.36\% reduction in entangling gate overhead compared to unoptimized Jordan-Wigner baselines, compressing a 16-qubit global step to 56 CNOTs and bypassing extensive O(N) scaling limits. We validate this compiler on IBM superconducting transmon processors by simulating the mesoscopic Quantum Link Model (QLM) truncation of the Schwinger model. Coupling O(1) compilation with Zero-Noise Extrapolation (ZNE), we track localized string rupture, extracting the dynamical crossover of pair creation at t ≈ 0.790 with an 18.3 2.2\% rupture probability. Furthermore, we map the dynamical phase diagram, identifying the confinement phase boundary at gc = 1.0. Finally, we introduce a scalable 2D unit-cell blueprint, paving a direct pathway toward the fault-tolerant simulation of two-dimensional Quantum Chromodynamics (QCD).
Create a lesson
Related papers
Continuous variable distributed quantum sensing in integrated photonics
Bethany Puzio, Oliver M. Green, Joel F. Tasker et al.
Securing quantum error correction against misleading advice from AI agents
A. Barış Özgüler
Exact logical error rates for magic state cultivation
Kwok Ho Wan, Ainhoa Zapirain
Hamiltonian engineering via pulses: beyond group averaging
Ivan Beschastnyi, Lucah Patel, David Tinoco
Logarithmic-depth quantum simulation of boson sampling
Changhun Oh
Entanglement swapping across a five-node relay in a multiplexed quantum-classical network
Andrew R. Cameron, Jordan M. Thomas, Alexandru Macridin et al.