The Computational Complexity of Linear Optics Speaker(s): Scott Aaronson
Abstract: I'll discuss some workinprogress about the computational complexity of simulating the extremely "simple" quantum systems that arise in linear optics experiments. I'll show that *either* one can describe an experiment, vastly easier than building a universal quantum computer, that would test whether Nature is performing nontrivial quantum computation, or else one can give surprising new algorithms for approximating the permanent. Audience feedback as to which of these possibilities is the right one is sought. Joint work with Alex Arkhipov.
Date: 25/01/2010  4:00 pm
Series: Quantum Information
