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 an 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 1, our algorithm can prepare particle states using O(is an element of(-3.23...)) gates, which is much faster than previous known results, namely, O(is an element of(-8-omicron(1))). 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.