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 the desired precision. Here we study a closely related quantum field-theoretical problem: estimating the vacuum-to-vacuum transition amplitude, in the presence of spacetime-dependent classical sources, for a massive scalar field theory in (1+1) dimensions. We show that this problem is BQP-hard; in other words, its solution enables one to solve any problem that is solvable in polynomial time by a quantum computer. Hence, the vacuum-to-vacuum amplitude cannot be accurately estimated by any efficient classical algorithm, even if the field theory is very weakly coupled, unless BQP=BPP. Furthermore, the corresponding decision problem can be solved by a quantum computer in a time scaling polynomially with the number of bits needed to specify the classical source fields, and this problem is therefore BQP-complete. Our construction can be regarded as an idealized architecture for a universal quantum computer in a laboratory system described by massive phi^4 theory coupled to classical spacetime-dependent sources.

[1]  E. Knill,et al.  A scheme for efficient quantum computation with linear optics , 2001, Nature.

[2]  George A. Hagedorn,et al.  A note on the switching adiabatic theorem , 2012, 1204.2318.

[3]  J.-P. Eckmann,et al.  Asymptotic perturbation expansion for the S-matrix and the definition of time ordered functions in relativistic quantum field models , 1976 .

[4]  P. Høyer,et al.  Higher order decompositions of ordered operator exponentials , 2008, 0812.0562.

[5]  Ronald F. Boisvert,et al.  NIST Handbook of Mathematical Functions , 2010 .

[6]  I. Chuang,et al.  Quantum Computation and Quantum Information: Bibliography , 2010 .

[7]  G. Nenciu.  Linear Adiabatic Theory: Exponential Estimates and Applications , 1996 .

[8]  M. Ruskai,et al.  Bounds for the adiabatic approximation with applications to quantum computation , 2006, quant-ph/0603175.

[9]  John Preskill,et al.  Quantum Algorithms for Quantum Field Theories , 2011, Science.

[10]  M. Suzuki,et al.  General Decomposition Theory of Ordered Exponentials , 1993 .

[11]  E. Teller,et al.  Bemerkungen zur Quantenmechanik des anharmonischen Oszillators , 1933 .

[12]  Philip M. Morse,et al.  On the Vibrations of Polyatomic Molecules , 1932 .

[13]  Ruedi Seiler,et al.  Adiabatic theorems and applications to the quantum hall effect , 1987 .

[14]  P. Hayden,et al.  Universal quantum computation by scattering in the Fermi–Hubbard model , 2014, 1409.3585.

[15]  G. Nenciu,et al.  Linear adiabatic theory. Exponential estimates , 1993 .

[16]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .

[17]  Dorit Aharonov,et al.  Fault-tolerant Quantum Computation with Constant Error Rate * , 1999 .

[18]  Andrew M. Childs,et al.  Universal Computation by Multiparticle Quantum Walk , 2012, Science.

[19]  Alexei Y. Arkhipov.  UNIVERSAL QUANTUM GATES , 2008 .

[20]  Andrew M. Childs,et al.  Universal computation by quantum walk. , 2008, Physical review letters.

[21]  J. Linnett,et al.  Quantum mechanics , 1975, Nature.

[22]  John Preskill,et al.  Quantum computation of scattering in scalar quantum field theories , 2011, Quantum Inf. Comput..

[23]  Qiongtao Xie,et al.  Heun functions and quasi-exactly solvable double-well potentials , 2013 .

[24]  R. Baltin.  Exact Green's Function for the Finite Rectangular Potential Well in One Dimension , 1985 .

[25]  Konrad Osterwalder,et al.  The Scattering Matrix Is Nontrivial for Weakly Coupled p (phi) in Two-Dimensions Models , 1975 .

[26]  J. Preskill,et al.  Quantum Algorithms for Fermionic Quantum Field Theories , 2014, 1404.7115.

[27]  Dorit Aharonov,et al.  Fault-tolerant quantum computation with constant error , 1997, STOC '97.

[28]  Gerard J. Milburn,et al.  Efficient linear optics quantum computation , 2001, Quantum Inf. Comput..