Lab Home | Phone | Search
Center for Nonlinear Studies  Center for Nonlinear Studies
 Colloquia Archive 
 Postdoc Seminars Archive 
 Quantum Lunch 
 Quantum Lunch Archive 
 CMS Colloquia 
 Q-Mat Seminars 
 Q-Mat Seminars Archive 
 P/T Colloquia 
 Kac Lectures 
 Kac Fellows 
 Dist. Quant. Lecture 
 Ulam Scholar 
 CNLS Fellowship Application 
 Summer Research 
 Past Visitors 
 History of CNLS 
 Maps, Directions 
 CNLS Office 
Thursday, April 23, 2015
12:30 PM - 1:30 PM
T-DO Conference Room

Quantum Lunch

Computational Complexity of Quantum Field Theory

Stephen Jordan

Numerical simulation of quantum dynamics is a notoriously difficult problem. In the worst case, simulating the quantum many-body problem is believed to require exponential time and memory as a function of the number of particles. On the other hand, quantum algorithms for simulating quantum many-body physics have been devised which provably scale polynomially in the number of particles. Simulating quantum field theories poses special challenges as particle number is not conserved and initial states may be difficult to prepare. In this talk I will describe recent work with Keith Lee, John Preskill, and Hari Krovi on quantum algorithms for simulating quantum field theories efficiently and on formal evidence that classical computers require exponential time to achieve this task.

Host: Rolando Somma