Quantum Algorithms for Quantum Field Theories
Stephen P. Jordan, Keith S. M. Lee, John P. Preskill · Science · 2012
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 efficient simulation of a particular kind of QFT (with quartic interactions) and estimate the error caused by discretization. Even for the most difficult case of strong interactions, the run time of the algorithm was polynomial (rather than exponential) in parameters such as the number of particles, their energy, and the prescribed precision, making it much more efficient than the best classical algorithms.