Recognition: unknown
Simulating lattice gauge theories on a quantum computer
read the original abstract
We examine the problem of simulating lattice gauge theories on a universal quantum computer. The basic strategy of our approach is to transcribe lattice gauge theories in the Hamiltonian formulation into a Hamiltonian involving only Pauli spin operators such that the simulation can be performed on a quantum computer using only one and two qubit manipulations. We examine three models, the U(1), SU(2), and SU(3) lattice gauge theories which are transcribed into a spin Hamiltonian up to a cutoff in the Hilbert space of the gauge fields on the lattice. The number of qubits required for storing a particular state is found to have a linear dependence with the total number of lattice sites. The number of qubit operations required for performing the time evolution corresponding to the Hamiltonian is found to be between a linear to quadratic function of the number of lattice sites, depending on the arrangement of qubits in the quantum computer. We remark that our results may also be easily generalized to higher SU(N) gauge theories.
This paper has not been read by Pith yet.
Forward citations
Cited by 6 Pith papers
-
Gauss law codes and vacuum codes from lattice gauge theories
Gauss law codes identify the full gauge-invariant sector as the code space while vacuum codes restrict to the matter vacuum, with the two shown to be unitarily equivalent for finite gauge groups.
-
Thermalization of SU(2) Lattice Gauge Fields on Quantum Computers
Quantum hardware simulation of SU(2) lattice gauge thermalization matches classical extrapolations up to 101 plaquettes after error mitigation, establishing feasibility for chaotic quantum field systems.
-
Quantum Simulation of the Real-time Dynamics in the multi-flavor Gross-Neveu Model at the utility scale using Superconducting Quantum Computers
A scalable Trotterization and Localized Diagonal Operator Approximation enable real-time quantum simulation of the multi-flavor Gross-Neveu model on utility-scale superconducting hardware.
-
A minimal implementation of Yang-Mills theory on a digital quantum computer
A minimal implementation of SU(N) pure Yang-Mills theory on digital quantum computers is presented with simplified Hamiltonians, improved infinite-mass convergence, and SU(2) embedding into R^4, benchmarked by Monte C...
-
Toward Quantum Simulation of SU(2) Gauge Theory using Non-Compact Variables
New simplified Hamiltonians, compact qubit encoding for SU(2), and an added Hamiltonian term reduce quantum resources while still reaching the Kogut-Susskind limit in (2+1)D SU(2) lattice gauge theory.
-
Ether of Orbifolds
Orbifold lattices incur m^4 Trotter overhead, m^2 contamination, and mandatory mass extrapolation, rendering them 10^4 to 10^10 times costlier than alternatives for a 10^3 calculation.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.