Digital Quantum Simulation for Spectroscopy of Schwinger Model

• URL: http://arxiv.org/abs/2404.14788v1
• Date: Tue, 23 Apr 2024 06:54:41 GMT
• Title: Digital Quantum Simulation for Spectroscopy of Schwinger Model
• Authors: Dongwook Ghim, Masazumi Honda,
• Abstract summary: This note discusses a method for computing the energy spectra of quantum field theory utilizing digital quantum simulation. A quantum algorithm, called coherent imaging spectroscopy, quenches the vacuum with a time-oscillating perturbation. As a practical demonstration, we apply this algorithm to the (1+1)-dimensional quantum electrodynamics with a topological term known as the Schwinger model.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: This note discusses a method for computing the energy spectra of quantum field theory utilizing digital quantum simulation. A quantum algorithm, called coherent imaging spectroscopy, quenches the vacuum with a time-oscillating perturbation and then reads off the excited energy levels from the loss in the vacuum-to-vacuum probability following the quench. As a practical demonstration, we apply this algorithm to the (1+1)-dimensional quantum electrodynamics with a topological term known as the Schwinger model, where the conventional Monte Carlo approach is practically inaccessible. In particular, on a classical simulator, we prepare the vacuum of the Schwinger model on a lattice by adiabatic state preparation and then apply various types of quenches to the approximate vacuum through Suzuki-Trotter time evolution. We discuss the dependence of the simulation results on the specific types of quenches and introduce various consistency checks, including the exact diagonalization and the continuum limit extrapolation. The estimation of the computational complexity required to obtain physically reasonable results implies that the method is likely efficient in the coming era of early fault-tolerant quantum computers.

Related papers

• 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)
• Towards Quantum Computing Timelike Hadronic Vacuum Polarization and Light-by-Light Scattering: Schwinger Model Tests [0.0]
  We introduce a methodology employing 1+1-dimensional quantum electrodynamics to investigate the HVP and HLBL. To that end, we use both tensor network techniques, specifically matrix product states, and classical emulators of digital quantum computers.
  arXiv  Detail & Related papers  (2024-06-05T18:00:01Z)
• Quantum computing of reacting flows via Hamiltonian simulation [13.377719901871027]
  We develop the quantum spectral and finite difference methods for simulating reacting flows in periodic and general conditions. The present quantum computing algorithms offer a one-shot'' solution for a given time without temporal discretization.
  arXiv  Detail & Related papers  (2023-12-13T04:31:49Z)
• 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)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Variational quantum simulation of the imaginary-time Lyapunov control for accelerating the ground-state preparation [17.802280143175235]
  We first propose a Lyapunov control-inspired strategy to accelerate the well-established imaginary-time method for ground-state preparation. To make the method accessible in the noisy intermediate-scale quantum era, we propose a variational form of the algorithm that could work with shallow quantum circuits.
  arXiv  Detail & Related papers  (2021-12-22T10:40:33Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• State preparation and measurement in a quantum simulation of the O(3) sigma model [65.01359242860215]
  We show that fixed points of the non-linear O(3) sigma model can be reproduced near a quantum phase transition of a spin model with just two qubits per lattice site. We apply Trotter methods to obtain results for the complexity of adiabatic ground state preparation in both the weak-coupling and quantum-critical regimes. We present and analyze a quantum algorithm based on non-unitary randomized simulation methods.
  arXiv  Detail & Related papers  (2020-06-28T23:44:12Z)
• Non-adiabatic molecular quantum dynamics with quantum computers [0.0]
  We propose a quantum algorithm for the simulation of fast non-adiabatic chemical processes. In particular, we introduce a first-quantization method for the potential time evolution of a wavepacket on two harmonic energy surfaces.
  arXiv  Detail & Related papers  (2020-06-16T18:00:22Z)
• Classically Emulated Digital Quantum Simulation of the Schwinger Model with Topological Term via Adiabatic State Preparation [1.2862023695904008]
  We perform a digital quantum simulation of a gauge theory with a topological term in Minkowski spacetime. We construct the true vacuum state of a lattice Schwinger model using adiabatic state preparation. Our results imply that digital quantum simulation is already useful tool to explore non-perturbative aspects of gauge theories.
  arXiv  Detail & Related papers  (2020-01-02T15:18: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.