Simulating Fully Gauge-Fixed SU(2) Hamiltonian Dynamics on Digital Quantum Computers
- URL: http://arxiv.org/abs/2512.22782v1
- Date: Sun, 28 Dec 2025 04:56:25 GMT
- Title: Simulating Fully Gauge-Fixed SU(2) Hamiltonian Dynamics on Digital Quantum Computers
- Authors: Henry Froland, Dorota M. Grabowska, Zhiyao Li,
- Abstract summary: 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.
- Score: 1.0716269823733435
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum simulations of many-body systems offer novel methods for probing the dynamics of the Standard Model and its constituent gauge theories. Extracting low-energy predictions from such simulations rely on formulating systematically-improvable representations of lattice gauge theory Hamiltonians that are efficient at all values of the gauge coupling. One such candidate representation for SU(2) is the fully gauge-fixed Hamiltonian defined in the mixed basis. This work focuses on the quantum simulation of the smallest non-trivial system: two plaquettes with open boundary conditions. A mapping of the continuous gauge field degrees of freedom to qubit-based representations is developed. It is found that as few as three qubits per plaquette is sufficient to reach per-mille level precision on predictions for observables. Two distinct algorithms for implementing time evolution in the mixed basis are developed and analyzed in terms of quantum resource estimates. One algorithm has favorable scaling in circuit depth for large numbers of qubits, while the other is more practical when qubit count is limited. The latter algorithm is used in the measurement of a real-time observable on IBM's Heron superconducting quantum processor, ibm_fez. The quantum results match classical predictions at the percent-level. This work lays out a path forward for two- and three-dimensional simulations of larger systems, as well as demonstrating the viability of mixed-basis formulations for studying the properties of SU(2) gauge theories at all values of the gauge coupling.
Related papers
- Quantum Simulation of Coupled Harmonic Oscillators: From Theory to Implementation [0.0]
We bridge the gap between theory and implementation by developing and comparing three concrete realizations of the algorithm.<n>First, we implement a sparse initial state preparation combined with product-formula ( Suzuki-Trotter) Hamiltonian simulation.<n>Second, we implement a fully quantum, oracle-based framework in which classical data are accessed via oracles.<n>Third, we propose an efficient alternative that combines the sparse state-preparation routine of the first approach with the oracle and block-encoding-based simulation pipeline of the second.
arXiv Detail & Related papers (2026-03-05T18:49:13Z) - Performance Guarantees for Quantum Neural Estimation of Entropies [31.955071410400947]
Quantum neural estimators (QNEs) combine classical neural networks with parametrized quantum circuits.<n>We study formal guarantees for QNEs of measured relative entropies in the form of non-asymptotic error risk bounds.<n>Our theory aims to facilitate principled implementation of QNEs for measured relative entropies.
arXiv Detail & Related papers (2025-11-24T16:36:06Z) - Estimating ground-state properties in quantum simulators with global control [35.3616472951301]
Accurately determining ground-state properties of quantum many-body systems remains one of the major challenges of quantum simulation.<n>We present a protocol for estimating the ground-state energy using only global time evolution under a target Hamiltonian.
arXiv Detail & Related papers (2025-11-06T15:08:00Z) - Optimizing Quantum Chemistry Simulations with a Hybrid Quantization Scheme [11.915190522925199]
We propose a hybrid quantization scheme for electronic simulations that employs a conversion circuit to switch efficiently between the two quantizations.<n>This way, plane-wave Hamiltonian simulations can be done efficiently in the first-quantization before converting to the second quantization.<n>We discuss applications of this hybrid quantization scheme to bring improvements in the characterization of ground-state and excited-state properties.
arXiv Detail & Related papers (2025-07-06T06:06:48Z) - 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) - Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
We use FNOs to model the evolution of random quantum spin systems.
We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
arXiv Detail & Related papers (2024-09-05T07:18:09Z) - Entanglement-induced exponential advantage in amplitude estimation via state matrixization [11.282486674587236]
Estimating quantum amplitude, or the overlap between two quantum states, is a fundamental task in quantum computing.<n>We introduce a novel algorithmic framework for quantum amplitude estimation by transforming pure states into their matrix forms.<n>We reconstruct amplitude estimation algorithms within the novel matrixization framework through a technique known as channel block encoding.
arXiv Detail & Related papers (2024-08-25T04:35:53Z) - 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) - Enhancing Scalability of Quantum Eigenvalue Transformation of Unitary Matrices for Ground State Preparation through Adaptive Finer Filtering [0.13108652488669736]
Hamiltonian simulation is a domain where quantum computers have the potential to outperform classical counterparts.<n>One of the main challenges of such quantum algorithms is increasing the system size.<n>We present an approach to improve the scalability of eigenspace filtering for the ground state preparation of a given Hamiltonian.
arXiv Detail & Related papers (2024-01-17T09:52:24Z) - 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) - 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) - Algorithms for quantum simulation at finite energies [0.7734726150561088]
We introduce two kinds of quantum algorithms to explore microcanonical and canonical properties of many-body systems.
One is a hybrid quantum algorithm that computes expectation values in a finite energy interval around its mean energy.
The other is a quantum-assisted Monte Carlo sampling method to compute other quantities.
arXiv Detail & Related papers (2020-06-04T17:40:29Z)
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.