Overcoming exponential volume scaling in quantum simulations of lattice gauge theories

• URL: http://arxiv.org/abs/2212.04619v1
• Date: Fri, 9 Dec 2022 01:18:46 GMT
• Title: Overcoming exponential volume scaling in quantum simulations of lattice gauge theories
• Authors: Christopher F. Kane, Dorota M. Grabowska, Benjamin Nachman and Christian W. Bauer
• Abstract summary: We present a formulation of a compact U(1) gauge theory in 2+1 dimensions free of gauge redundancies. A naive implementation onto a quantum circuit has a gate count that scales exponentially with the volume. We discuss how to break this exponential scaling by performing an operator redefinition that reduces the non-locality of the Hamiltonian.
• Score: 1.5675763601034223
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Real-time evolution of quantum field theories using classical computers requires resources that scale exponentially with the number of lattice sites. Because of a fundamentally different computational strategy, quantum computers can in principle be used to perform detailed studies of these dynamics from first principles. Before performing such calculations, it is important to ensure that the quantum algorithms used do not have a cost that scales exponentially with the volume. In these proceedings, we present an interesting test case: a formulation of a compact U(1) gauge theory in 2+1 dimensions free of gauge redundancies. A naive implementation onto a quantum circuit has a gate count that scales exponentially with the volume. We discuss how to break this exponential scaling by performing an operator redefinition that reduces the non-locality of the Hamiltonian. While we study only one theory as a test case, it is possible that the exponential gate scaling will persist for formulations of other gauge theories, including non-Abelian theories in higher dimensions.

Related papers

• 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)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• 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)
• General quantum algorithms for Hamiltonian simulation with applications to a non-Abelian lattice gauge theory [44.99833362998488]
  We introduce quantum algorithms that can efficiently simulate certain classes of interactions consisting of correlated changes in multiple quantum numbers. The lattice gauge theory studied is the SU(2) gauge theory in 1+1 dimensions coupled to one flavor of staggered fermions. The algorithms are shown to be applicable to higher-dimensional theories as well as to other Abelian and non-Abelian gauge theories.
  arXiv  Detail & Related papers  (2022-12-28T18:56:25Z)
• Efficient quantum implementation of 2+1 U(1) lattice gauge theories with Gauss law constraints [1.5675763601034223]
  We show how to break the exponential scaling of a naive implementation of a U(1) gauge theory in two spatial dimensions. We study the errors from finite Suzuki-Trotter time-step, circuit approximation, and quantum noise in a calculation of an explicit observable using IBMQ superconducting qubit hardware.
  arXiv  Detail & Related papers  (2022-11-18T20:14:15Z)
• How many quantum gates do gauge theories require? [0.0]
  We discuss the implementation of lattice gauge theories on digital quantum computers. We find that the cost of a single time step of an elementary plaquette is beyond what is reasonably practical in the current era of quantum hardware.
  arXiv  Detail & Related papers  (2022-08-24T22:36:31Z)
• Overcoming exponential scaling with system size in Trotter-Suzuki implementations of constrained Hamiltonians: 2+1 U(1) lattice gauge theories [1.5675763601034223]
  For many quantum systems of interest, the classical computational cost of simulating their time evolution scales exponentially in the system size. quantum computers have been shown to allow for simulations of some of these systems using resources that scale exponentially with the system size. This work identifies a term in the Hamiltonian of a class of constrained systems that naively requires quantum resources that scale exponentially in the system size.
  arXiv  Detail & Related papers  (2022-08-05T18:00:52Z)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)
• 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.