Exponential improvements in the simulation of lattice gauge theories using near-optimal techniques
arXiv:2405.10416 · doi:10.1103/PRXQuantum.5.040347
Abstract
We report a first-of-its-kind analysis on post-Trotter simulation of U(1), SU(2) and SU(3) lattice gauge theories including fermions in arbitrary spatial dimension. We provide explicit circuit constructions as well as T-gate counts and logical qubit counts for Hamiltonian simulation. We find up to 25 orders of magnitude reduction in space-time volume over Trotter methods for simulations of non-Abelian lattice gauge theories relevant to the standard model. This improvement results from our algorithm having polynomial scaling with the number of colors in the gauge theory, achieved by utilizing oracle constructions relying on the sparsity of physical operators, in contrast to the exponential scaling seen in state-of-the-art Trotter methods which employ explicit mappings onto Pauli operators. Our work demonstrates that the use of advanced algorithmic techniques leads to dramatic reductions in the cost of simulating fundamental interactions, bringing it in step with resources required for first principles quantum simulation of chemistry.
References in corpus (29)
- Simulated Quantum Computation of Molecular Energies
- Quantum Simulation for High Energy Physics
- A cold-atom quantum simulator for SU(2) Yang-Mills lattice gauge theory
- A Trailhead for Quantum Simulation of SU(3) Yang-Mills Lattice Gauge Theory in the Local Multiplet Basis
- A Formulation of Lattice Gauge Theories for Quantum Simulations
- Chemical Basis of Trotter-Suzuki Errors in Quantum Chemistry Simulation
- Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms
- Digital lattice gauge theories
- Finite-density lattice QCD and sign problem: current status and open problems
- Hardware efficient quantum simulation of non-abelian gauge theories with qudits on Rydberg platforms
- Reliably assessing the electronic structure of cytochrome P450 on today's classical computers and tomorrow's quantum computers
- Quantum Simulating Nature's Fundamental Fields
- Removing Staggered Fermionic Matter in and Lattice Gauge Theories
- Provably accurate simulation of gauge theories and bosonic systems
- Fermion-qudit quantum processors for simulating lattice gauge theories with matter
- Primitive Quantum Gates for an SU(2) Discrete Subgroup: BT
- General quantum algorithms for Hamiltonian simulation with applications to a non-Abelian lattice gauge theory
- Improved Hamiltonians for Quantum Simulations
- Reducing molecular electronic Hamiltonian simulation cost for Linear Combination of Unitaries approaches
- Fault-tolerant quantum simulation of materials using Bloch orbitals
- Resource-Efficient Quantum Simulation of Lattice Gauge Theories in Arbitrary Dimensions: Solving for Gauss' Law and Fermion Elimination
- Quantum computation of stopping power for inertial fusion target design
- Primitive Quantum Gates for an SU(3) Discrete Subgroup:
- Nearly-optimal state preparation for quantum simulations of lattice gauge theories
- Qubitization strategies for bosonic field theories
- Nuclear scattering via quantum computing
- Quantifying -gate-count improvements for ground-state-energy estimation with near-optimal state preparation
- Multi-nucleon structure and dynamics via quantum computing
- Estimating truncation effects of quantum bosonic systems using sampling algorithms
Cited by in corpus (8)
- Efficient Quantum Simulation of QCD Jets on the Light Front
- Block encoding bosons by signal processing
- Ladder Operator Block-Encoding
- Systematic many-fermion Hamiltonian input scheme and spectral calculations on quantum computers
- Field digitization scaling in a symmetric model
- Eigenstate Thermalization in 1+1-Dimensional SU(2) Lattice Gauge Theory Coupled with Dynamical Fermions
- Creation of Wave Packets for Quantum Chromodynamics on Quantum Computers
- Quantum computational resources for lattice QCD in the strong-coupling limit