Skip to main content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

BQP-completeness of Scattering in Scalar Quantum Field Theory

Published

Author(s)

Stephen P. Jordan, Keith S. Lee, John Preskill

Abstract

Recent work has shown that quantum computers can in polynomial time compute scattering probabilities in massive quantum field theories. One can translate this task into a corresponding formal problem in computational complexity theory. Here, we establish that this is a BQP-hard problem. In other words, by solving it, one can solve any problem that can be solved in polynomial time by a quantum computer. Hence, these scattering probabilities cannot be obtained by any classical polynomial-time algorithm unless BQP=BPP. Our construction works by encoding a quantum circuit into a spacetime-varying source term in the quantum field theory’s Lagrangian.
Citation
Quantum Information & Computation
Volume
14
Issue
11&12

Keywords

quantum information, computational complexity
Created September 1, 2014, Updated February 19, 2017