Zoom (for information email firstname.lastname@example.org)
Title: Permanent Hardness from Linear OpticsSpeaker: Daniel Grier Affiliation: University of Waterloo Location: Online (Zoom)
One of the great accomplishments in complexity theory was Valiant's 1979 proof that the permanent of a matrix is #P-hard to compute. Subsequent work simplified Valiant's ideas and even began to recast them as problems in quantum computing. In 2011, this culminated in a striking proof by Aaronson, based solely on quantum linear optics, of the #P-hardness of the permanent.