



01418nas a2200145   4500008004100000245007200041210006900113260001500182300001100197490000600208520097500214100002601189700002001215856003701235       2018                        eng d00aFaster Quantum Algorithm to simulate Fermionic Quantum Field Theory0 aFaster Quantum Algorithm to simulate Fermionic Quantum Field The  c2018/05/04  a0123320 vA3 a<p>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 O(ε&minus;3.23&hellip;) gates, which is much faster than previous known results, namely O(ε&minus;8&minus;o(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.</p>1 aMoosavian, Ali, Hamed1 aJordan, Stephen  uhttps://arxiv.org/abs/1711.04006