Quantum sampling for the Euclidean path integral of lattice gauge theory

Abstract

Although the Hamiltonian formalism is so far favored for quantum computation of lattice gauge theory, the path integral formalism would never be useless. The advantages of the path integral formalism are the knowledge and experience accumulated by classical lattice simulation and manifest Lorentz invariance. We discuss quantum computation of lattice gauge theory in the path integral formalism. We utilize a quantum sampling algorithm to generate gauge configurations, and demonstrate a benchmark test of $Z_2$ lattice gauge theory on a four-dimensional hypercube.

References in corpus (18)

• A variational eigenvalue solver on a quantum processor
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Simulating Lattice Gauge Theories within Quantum Technologies
• Quantum Simulations of Lattice Gauge Theories using Ultracold Atoms in Optical Lattices
• Lattice gauge theories simulations in the quantum information era
• Quantum Simulations of Classical Annealing Processes
• Digital quantum simulation of ${\mathbb{Z}}_2$ lattice gauge theories with dynamical fermionic matter
• Speed-up via Quantum Sampling
• Simulating Ising Spin Glasses on a Quantum Computer
• A Quantum Approach to Classical Statistical Mechanics
• Rapid adiabatic preparation of injective PEPS and Gibbs states
• Toward Quantum Simulations of ${\mathbb{Z}}_2$ Gauge Theory Without State Preparation
• Real-time simulation of (2+1)-dimensional lattice gauge theory on qubits
• Quantum Sampling Algorithms for Near-Term Devices
• Simulation of Classical Thermal States on a Quantum Computer: A Transfer Matrix Approach
• Quantum computation of thermal averages in the presence of a sign problem
• Quantum variational approach to lattice gauge theory at nonzero density
• Quantum Sampling Algorithms, Phase Transitions, and Computational Complexity