Discretizing quantum field theories for quantum simulation

• URL: http://arxiv.org/abs/2002.02643v2
• Date: Fri, 24 Jul 2020 01:42:26 GMT
• Title: Discretizing quantum field theories for quantum simulation
• Authors: Terry Farrelly and Julien Streich
• Abstract summary: We show that a timestep equal to or going to zero faster than the spatial lattice spacing is necessary for quantum simulations of QFT. We give a quantum circuit exactly equivalent to the real-time path integral from the discrete-time Lagrangian formulation of lattice QFT. All of these circuits have an analogue of a lightcone on the lattice and therefore are examples of quantum cellular automata.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: To date, all proposed quantum algorithms for simulating quantum field theory (QFT) simulate (continuous-time) Hamiltonian lattice QFT as a stepping stone. Two overlooked issues are how large we can take the timestep in these simulations while getting the right physics and whether we can go beyond the standard recipe that relies on Hamiltonian lattice QFT. The first issue is crucial in practice for, e.g., trapped-ion experiments which actually have a lower bound on the possible ratio of timestep to lattice spacing. To this end, we show that a timestep equal to or going to zero faster than the spatial lattice spacing is necessary for quantum simulations of QFT, but far more importantly a timestep equal to the lattice spacing is actually sufficient. To do this, first for $\phi^4$ theory, we give a quantum circuit exactly equivalent to the real-time path integral from the discrete-time Lagrangian formulation of lattice QFT. Next we give another circuit with no lattice QFT analogue, but, by using Feynman rules applied to the circuit, we see that it also reproduces the correct continuum behaviour. Finally, we look at non-abelian gauge fields, showing that the discrete-time lattice QFT path-integral is exactly equivalent to a finite-depth local circuit. All of these circuits have an analogue of a lightcone on the lattice and therefore are examples of quantum cellular automata. Aside from the potential practical benefit of these circuits, this all suggests that the path-integral approach to lattice QFT need not be overlooked in quantum simulations of physics and has a simple quantum information interpretation.

Related papers

• Enhancing Quantum Field Theory Simulations on NISQ Devices with Hamiltonian Truncation [0.0]
  This paper presents an alternative to traditional methods for simulating the real-time evolution in Quantum Field Theories (QFTs) by leveraging Hamiltonian Truncation (HT) We study the Schwinger model, systematically reducing the complexity of the Hamiltonian via HT while preserving essential physical properties. For the observables studied in this paper, the HT approach converges quickly with the number of qubits, allowing for the interesting physics processes to be captured without needing many qubits.
  arXiv  Detail & Related papers  (2024-07-26T18:03:20Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics [62.997667081978825]
  We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality. We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
  arXiv  Detail & Related papers  (2022-06-03T18:00:02Z)
• A relativistic discrete spacetime formulation of 3+1 QED [0.0]
  This work provides a relativistic, digital quantum simulation scheme for both $2+1$ and $3+1$ dimensional quantum electrodynamics (QED) It takes the form of a quantum circuit, infinitely repeating across space and time, parametrised by the discretization step $Delta_t=Delta_x$.
  arXiv  Detail & Related papers  (2022-05-06T11:39:05Z)
• Programmable Hamiltonian engineering with quadratic quantum Fourier transform [8.261869047984895]
  We propose a protocol of quadratic quantum Fourier transform (QQFT), considering cold atoms confined in an optical lattice. This QQFT is equivalent to QFT in the single-particle subspace, and produces a different unitary operation in the entire Hilbert space. We show this QQFT protocol can be implemented using programmable laser potential with the digital-micromirror-device techniques recently developed in the experiments.
  arXiv  Detail & Related papers  (2022-04-09T03:36:40Z)
• Gaussian initializations help deep variational quantum circuits escape from the barren plateau [87.04438831673063]
  Variational quantum circuits have been widely employed in quantum simulation and quantum machine learning in recent years. However, quantum circuits with random structures have poor trainability due to the exponentially vanishing gradient with respect to the circuit depth and the qubit number. This result leads to a general belief that deep quantum circuits will not be feasible for practical tasks.
  arXiv  Detail & Related papers  (2022-03-17T15:06:40Z)
• Quantum simulation of $\phi^4$ theories in qudit systems [53.122045119395594]
  We discuss the implementation of quantum algorithms for lattice $Phi4$ theory on circuit quantum electrodynamics (cQED) system. The main advantage of qudit systems is that its multi-level characteristic allows the field interaction to be implemented only with diagonal single-qudit gates.
  arXiv  Detail & Related papers  (2021-08-30T16:30:33Z)
• A quantum hamiltonian simulation benchmark [1.5301252700705212]
  Hamiltonian simulation is one of the most important problems in quantum computation. We propose a drastically simplified quantum circuit that uses only one ancilla qubit and no multi-qubit controlled gates.
  arXiv  Detail & Related papers  (2021-08-08T22:16:30Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• Quantum Simulation of Quantum Field Theory in the Light-Front Formulation [0.0]
  Quantum chromodynamics (QCD) describes the structure of hadrons such as the proton at a fundamental level. Uncertainty in the parton distribution function is the dominant source of error in the $W$ mass measurement at the LHC. We show how this can be achieved by using the light-front formulation of quantum field theory.
  arXiv  Detail & Related papers  (2020-02-10T18:43:07Z)

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.