RSS icon
Twitter icon
Facebook icon
Vimeo icon
YouTube icon

Quantum Computation and the Computational Complexity of Quantum Field Theory

April 29, 2015 - 2:00pm
Speaker: 
Keith Lee
Institution: 
University of Toronto

Quantum field theory provides the framework for the Standard Model of
particle physics and plays a key role in physics. However, calculations
are generally computationally complex and limited to weak interaction
strengths. I'll describe polynomial-time quantum algorithms for computing
relativistic scattering amplitudes in both scalar and fermionic quantum
field theories. The algorithms achieve exponential speedup over known
classical methods. One of the motivations for this work comes from
computational complexity theory. Ultimately, one wishes to know what is
the computational power of our universe. Studying such quantum algorithms
probes whether a universal quantum computer is powerful enough to
represent quantum field theory; in other words, is quantum field theory in
BQP? Conversely, one can ask whether quantum field theory can represent a
universal quantum computer; is quantum field theory BQP-hard? We have
shown that massive phi^4 theory can implement universal quantum
computation and is thus BQP-complete.

3100A Computer and Space Sciences
College Park, MD 20742

Subscribe to A Quantum Bit 

Quantum physics began with revolutionary discoveries in the early twentieth century and continues to be central in today’s physics research. Learn about quantum physics, bit by bit. From definitions to the latest research, this is your portal. Subscribe to receive regular emails from the quantum world. Previous Issues...

Sign Up Now

Sign up to receive A Quantum Bit in your email!

 Have an idea for A Quantum Bit? Submit your suggestions to jqi-comm@umd.edu