A resource efficient approach for quantum and classical simulations of gauge theories in particle physics

• URL: http://arxiv.org/abs/2006.14160v3
• Date: Thu, 21 Jan 2021 16:23:23 GMT
• Title: A resource efficient approach for quantum and classical simulations of gauge theories in particle physics
• Authors: Jan F. Haase, Luca Dellantonio, Alessio Celi, Danny Paulson, Angus Kan, Karl Jansen, Christine A. Muschik
• Abstract summary: lattice gauge theory (LGT) calculations have been pivotal in our understanding of fundamental interactions. Hamiltonian-based formulations involve infinite-dimensional gauge degrees of freedom that can solely be handled by truncation. We provide a resource-efficient protocol to simulate LGTs with continuous gauge groups in the Hamiltonian formulation.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Gauge theories establish the standard model of particle physics, and lattice gauge theory (LGT) calculations employing Markov Chain Monte Carlo (MCMC) methods have been pivotal in our understanding of fundamental interactions. The present limitations of MCMC techniques may be overcome by Hamiltonian-based simulations on classical or quantum devices, which further provide the potential to address questions that lay beyond the capabilities of the current approaches. However, for continuous gauge groups, Hamiltonian-based formulations involve infinite-dimensional gauge degrees of freedom that can solely be handled by truncation. Current truncation schemes require dramatically increasing computational resources at small values of the bare couplings, where magnetic field effects become important. Such limitation precludes one from `taking the continuous limit' while working with finite resources. To overcome this limitation, we provide a resource-efficient protocol to simulate LGTs with continuous gauge groups in the Hamiltonian formulation. Our new method allows for calculations at arbitrary values of the bare coupling and lattice spacing. The approach consists of the combination of a Hilbert space truncation with a regularization of the gauge group, which permits an efficient description of the magnetically-dominated regime. We focus here on Abelian gauge theories and use $2+1$ dimensional quantum electrodynamics as a benchmark example to demonstrate this efficient framework to achieve the continuum limit in LGTs. This possibility is a key requirement to make quantitative predictions at the field theory level and offers the long-term perspective to utilise quantum simulations to compute physically meaningful quantities in regimes that are precluded to quantum Monte Carlo.

Related papers

• GFlowNets for Hamiltonian decomposition in groups of compatible operators [5.198557487975197]
  Current quantum algorithms are constrained by hardware limitations and the increased number of measurements required to achieve chemical accuracy. We propose a probabilistic framework using GFlowNets to group fully (FC) or qubit-wise commuting (QWC) terms within a given Hamiltonian.
  arXiv  Detail & Related papers  (2024-10-21T14:14:29Z)
• An efficient finite-resource formulation of non-Abelian lattice gauge theories beyond one dimension [0.0]
  We propose a resource-efficient method to compute the running of the coupling in non-Abelian gauge theories beyond one spatial dimension. Our method enables computations at arbitrary values of the bare coupling and lattice spacing with current quantum computers, simulators and tensor-network calculations.
  arXiv  Detail & Related papers  (2024-09-06T17:59:24Z)
• Assessing the query complexity limits of quantum phase estimation using symmetry aware spectral bounds [0.0]
  computational cost of quantum algorithms for physics and chemistry is closely linked to the spectrum of the Hamiltonian. We introduce a hierarchy of symmetry-aware spectral bounds that provide a unified understanding of the performance of quantum phase estimation algorithms.
  arXiv  Detail & Related papers  (2024-03-07T18:38:49Z)
• Neutron-nucleus dynamics simulations for quantum computers [49.369935809497214]
  We develop a novel quantum algorithm for neutron-nucleus simulations with general potentials. It provides acceptable bound-state energies even in the presence of noise, through the noise-resilient training method. We introduce a new commutativity scheme called distance-grouped commutativity (DGC) and compare its performance with the well-known qubit-commutativity scheme.
  arXiv  Detail & Related papers  (2024-02-22T16:33:48Z)
• A Floquet-Rydberg quantum simulator for confinement in $\mathbb{Z}_2$ gauge theories [44.99833362998488]
  Recent advances in the field of quantum technologies have opened up the road for the realization of small-scale quantum simulators. We present a scalable Floquet scheme for the quantum simulation of the real-time dynamics in a $mathbbZ$ LGT. We show that an observation of gauge-invariant confinement dynamics in the Floquet-Rydberg setup is at reach of current experimental techniques.
  arXiv  Detail & Related papers  (2023-11-28T13:01:24Z)
• Universality of critical dynamics with finite entanglement [68.8204255655161]
  We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement. Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
  arXiv  Detail & Related papers  (2023-01-23T19:23:54Z)
• Toward Exploring Phase Diagrams of Gauge Theories on Quantum Computers with Thermal Pure Quantum States [0.0]
  We present an approach for quantum computing finite-temperature lattice gauge theories at non-zero density. Our approach allows for sign-problem-free quantum computations of thermal expectation values and non-equal time correlation functions.
  arXiv  Detail & Related papers  (2022-12-21T22:10:12Z)
• Variational Adiabatic Gauge Transformation on real quantum hardware for effective low-energy Hamiltonians and accurate diagonalization [68.8204255655161]
  We introduce the Variational Adiabatic Gauge Transformation (VAGT) VAGT is a non-perturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit. The accuracy of VAGT is tested trough numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.
  arXiv  Detail & Related papers  (2021-11-16T20:50:08Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• 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)
• The role of boundary conditions in quantum computations of scattering observables [58.720142291102135]
  Quantum computing may offer the opportunity to simulate strongly-interacting field theories, such as quantum chromodynamics, with physical time evolution. As with present-day calculations, quantum computation strategies still require the restriction to a finite system size. We quantify the volume effects for various $1+1$D Minkowski-signature quantities and show that these can be a significant source of systematic uncertainty.
  arXiv  Detail & Related papers  (2020-07-01T17:43:11Z)

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.