Category Archives: Uncategorized

Scott Aaronson Talk Schedule

Venue: School of Informatics, University of Edinburgh, Room 4.33/4.31
Times: 15:00 till 16:30

New Computational Insights from Quantum Optics

Tuesday 10/7/2012

In work with Aleksandr Arkhipov, we proposed a rudimentary form of quantum computing, based on linear optics with nonadaptive measurements; and used a connection between linear optics and the permanent function to show that even this limited model could solve sampling and search problems that are intractable for classical computers under plausible complexity assumptions.  In this talk, I’ll discuss this work in a self-contained way, and mention some of its implications for quantum computing experiments. I’ll also discuss some more general results that emerged from our work. These include a new equivalence between sampling problems and search problems based on Kolmogorov complexity; a new, linear-optics-based proof of Valiant’s famous theorem that the permanent is #P-complete; and a new classical approximation algorithm for the permanent.

Papers:
The Computational Complexity of Linear Optics
The Equivalence of Sampling and Searching
A Linear-Optical Proof that the Permanent is #P-Hard

How Much Information Is In A Quantum State?

Wednesday 11/7/2012

People often talk about the quantum state of n entangled particles as if it contained an amount of information exponential in n.  In this talk, I’ll discuss three results that suggest that, in various senses relevant for computation, prediction, and learning, quantum states
actually *don’t* behave as if they contained exponential amounts of information. Specifically, I’ll discuss the limitations of “quantum advice states,”the approximate “learnability” of quantum states from random measurement results, and the simulation of arbitrary quantum state preparation tasks by the preparation of ground states of local Hamiltonians (joint work with Andrew Drucker).

Papers:
Limitations of Quantum Advice and One-Way Communication
The Learnability of Quantum States
A Full Characterization of Quantum Advice

Talk #3

Thursday 12/7/2012

Talk #3 will be determined based on audience interest.