Site-by-site quantum state preparation algorithm for preparing vacua of fermionic lattice field theories
arXiv:1911.03505
Abstract
Answering whether quantum computers can efficiently simulate quantum field theories has both theoretical and practical motivation. From the theoretical point of view, it answers the question of whether a hypothetical computer that utilizes quantum field theory would be more powerful than other quantum computers. From the practical point of view, when reliable quantum computers are eventually built, these algorithms can help us better understand the underlying physics that govern our world. In the best known quantum algorithms for simulating quantum field theories, the time scaling is dominated by initial state preparation. In this paper, we exclusively focus on state preparation and present a heuristic algorithm that can prepare the vacuum of fermionic systems in more general cases and more efficiently than previous methods. With our method, state preparation is no longer the bottleneck, as its runtime has the same asymptotic scaling with the desired precision as the remainder of the simulation algorithm. We numerically demonstrate the effectiveness of our proposed method for the 1+1 dimensional Gross-Neveu model.
10 pages, 6 figures
References in corpus (24)
- Probing many-body dynamics on a 51-atom quantum simulator
- Observation of a Many-Body Dynamical Phase Transition with a 53-Qubit Quantum Simulator
- Classifying quantum phases using Matrix Product States and PEPS
- Optimal Hamiltonian Simulation by Quantum Signal Processing
- Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
- Quantum Algorithms for Quantum Field Theories
- Efficient Simulation of Quantum Systems by Quantum Computers
- Atomic Quantum Simulation of U(N) and SU(N) Non-Abelian Lattice Gauge Theories
- Fixed-point quantum search with an optimal number of queries
- A Formulation of Lattice Gauge Theories for Quantum Simulations
- Nearly optimal lattice simulation by product formulas
- Generalized Jordan-Wigner Transformations
- Digitization of Scalar Fields for Quantum Computing
- Quantum Algorithm for Simulating the Wave Equation
- Quantum Simulation of the Abelian-Higgs Lattice Gauge Theory with Ultracold Atoms
- Minimally-Entangled State Preparation of Localized Wavefunctions on Quantum Computers
- Quantum Algorithms for Fermionic Quantum Field Theories
- Preparing projected entangled pair states on a quantum computer
- SO(3) "Nuclear Physics" with ultracold Gases
- Faster Quantum Algorithm to simulate Fermionic Quantum Field Theory
- The Casimir effect: some aspects
- Preparing topological PEPS on a quantum computer
- Continuum limits of Matrix Product States
- Simulating quantum field theory with a quantum computer
Cited by in corpus (10)
- Standard Model Physics and the Digital Quantum Revolution: Thoughts about the Interface
- Quantum Machine Learning for Particle Physics using a Variational Quantum Classifier
- Provably accurate simulation of gauge theories and bosonic systems
- Toward Quantum Simulations of Gauge Theory Without State Preparation
- Quantum Computing for Quantum Tunnelling
- Towards a Quantum Computing Algorithm for Helicity Amplitudes and Parton Showers
- Unsupervised Event Classification with Graphs on Classical and Photonic Quantum Computers
- Solving lattice gauge theories using the quantum Krylov algorithm and qubitization
- Discretizing quantum field theories for quantum simulation
- A single-particle framework for unitary lattice gauge theory in discrete time