Quantum Algorithms for Quantum Field Theories

@article{Jordan2012QuantumAF,
  title={Quantum Algorithms for Quantum Field Theories},
  author={Stephen P. Jordan and Keith S. M. Lee and John Preskill},
  journal={Science},
  year={2012},
  volume={336},
  pages={1130 - 1133}
}
Quantum Leap? Quantum computers are expected to be able to solve some of the most difficult problems in mathematics and physics. It is not known, however, whether quantum field theories (QFTs) can be simulated efficiently with a quantum computer. QFTs are used in particle and condensed matter physics and have an infinite number of degrees of freedom; discretization is necessary to simulate them digitally. Jordan et al. (p. 1130; see the Perspective by Hauke et al.) present an algorithm for the… 
BQP-completeness of Scattering in Scalar Quantum Field Theory
Recent work has shown that quantum computers can compute scattering probabilities in massive quantum field theories, with a run time that is polynomial in the number of particles, their energy, and
Discretizing quantum field theories for quantum simulation
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
Faster quantum algorithm to simulate fermionic quantum field theory
In quantum algorithms discovered so far for simulating scattering processes in quantum field theories, state preparation is the slowest step. We present a new algorithm for preparing particle states
Speeding Up Quantum Field Theories
TLDR
On page 1130 of this issue, Jordan et al. (1) report on an efficient quantum algorithm that can solve the equations of quantum field theory (QFT), which reconcile quantum mechanics with special relativity and are crucial for studies of the interactions of fundamental particles.
Quantum simulation of quantum field theories as quantum chemistry
Abstract Conformal truncation is a powerful numerical method for solving generic strongly-coupled quantum field theories based on purely field-theoretic technics without introducing lattice
Quantum simulation of quantum field theory using continuous variables
TLDR
A new algorithm is presented which gives an exponential speedup over the best known classical methods for efficiently calculating the scattering amplitudes in scalar bosonic quantum field theory, a problem that is known to be hard using a classical computer.
Quantum Simulation
Simulating quantum mechanics is known to be a difficult computational problem, especially when dealing with large systems. However, this difficulty may be overcome by using some controllable quantum
Scalar quantum field theories as a benchmark for near-term quantum computers
TLDR
This work outlines and implements a hybrid algorithm to calculate the lowest energy levels of the paradigmatic 1+1--dimensional interacting scalar QFT, and shows that the accuracy of mass-renormalization calculations represents a useful metric with which near-term hardware may be benchmarked.
Simulating quantum field theory with a quantum computer
  • J. Preskill
  • Physics
    Proceedings of The 36th Annual International Symposium on Lattice Field Theory — PoS(LATTICE2018)
  • 2019
TLDR
Today's research can hasten the arrival of a new era in which quantum simulation fuels rapid progress in fundamental physics, and though the physics payoff may still be far away, it's worthwhile to get started now.
COMPLEXITY OF QUANTUM FIELD THEORIES
TLDR
The recently-devised algorithm of Jordan, Lee, and Preskill is presented which gives an efficient simulation of φ4 theory in d = 1, 2, and 3 spatial dimensions with a non-relativistic quantum computer, allowing for the computation of scattering probabilities.
...
...

References

SHOWING 1-10 OF 84 REFERENCES
Simulating quantum systems on a quantum computer
  • Christof Zalka
  • Physics, Computer Science
    Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
  • 1998
TLDR
It is shown that the time evolution of the wave function of a quantum–mechanical many–particle system can be simulated precisely and efficiently on a quantum computer, and that ultimately the simulation of quantum field theory might be possible on large quantum computers.
Simulating lattice gauge theories on a quantum computer (熱場の量子論とその応用)
We examine the problem of simulating lattice gauge theories on a universal quantum computer. The basic strategy of our approach is to transcribe lattice gauge theories in the Hamiltonian formulation
An open-system quantum simulator with trapped ions
TLDR
This work combines multi-qubit gates with optical pumping to implement coherent operations and dissipative processes and illustrates the ability to engineer the open-system dynamics through the dissipative preparation of entangled states, the simulation of coherent many-body spin interactions, and the quantum non-demolition measurement of multi- qubit observables.
Quantum simulations with cold trapped ions
The control of internal and motional quantum degrees of freedom of laser-cooled trapped ions has been subject to intense theoretical and experimental research for about three decades. In the realm of
Discrete non-Abelian gauge theories in Josephson-junction arrays and quantum computation
We discuss real-space lattice models equivalent to gauge theories with a discrete non-Abelian gauge group. We construct the Hamiltonian formalism which is appropriate for their solid-state physics
Simulating open quantum systems: From many-body interactions to stabilizer pumping
In a recent experiment, Barreiro et al (2011 Nature 470 486) demonstrated the fundamental building blocks of an open-system quantum simulator with trapped ions. Using up to five ions, dynamics were
Universal Digital Quantum Simulation with Trapped Ions
TLDR
The digital approach to quantum simulation in a system of trapped ions is demonstrated and evidence that the level of control required for a full-scale device is within reach is provided.
Efficient Quantum Algorithms for Simulating Sparse Hamiltonians
We present an efficient quantum algorithm for simulating the evolution of a quantum state for a sparse Hamiltonian H over a given time t in terms of a procedure for computing the matrix entries of H.
Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
TLDR
Fast algorithms for simulating many body Fermi systems on a universal quantum computer are provided and a simulation of the Hubbard model is discussed in detail.
An optical-lattice-based quantum simulator for relativistic field theories and topological insulators
We present a proposal for a versatile cold-atom-based quantum simulator of relativistic fermionic theories and topological insulators in arbitrary dimensions. The setup consists of a spin-independent
...
...