Hamed Moosavian, A.
and Jordan, S.
(2018),
Faster quantum algorithm to simulate Fermionic quantum field theory, Quantum Information & Computation (Accessed May 11, 2026)
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
Faster quantum algorithm to simulate Fermionic quantum field theory
Published
Author(s)
Ali Hamed Moosavian,
Abstract
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 to use in simulation of Fermionic Quantum Field Theory (QFT) on a quantum computer, which is based on the matrix product state ansatz. We apply this to the massive Gross-Neveu model in one spatial dimension to illustrate the algorithm, but we believe the same algorithm with slight modifications can be used to simulate any one-dimensional massive Fermionic QFT. In the case where the number of particle species is one, our algorithm can prepare particle states using epsilon to the -3.23... gates, which is much faster than previous known results, namely epsilon to the -8 gates. Furthermore, unlike previous methods which were based on adiabatic state preparation, the method given here should be able to simulate quantum phases unconnected to the free theory.Citation
Quantum Information & Computation
Volume
98
Pub Type
Journals
Keywords
quantum algorithms, simulation, quantum field theory
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact [email protected].
Created June 30, 2018, Updated October 12, 2021