Abstract to be announced.
Aram Harrow, University of Washington
This talk will begin by justifying the first part of the title, by explaining a method to test whether a given multipartite pure state is product or far from product, given only two copies of the state. Next, I'll explain how this test has implications for the computational hardness of a large number of optimization problems.
Internal Speaker, Institute for Quantum Computing (IQC)
Abstract to be announced.
One of the main goals of Quantum Computation is to design novel methods for speeding up computations by taking advantage of the surprising effects of quantum mechanics. Many powerful quantum algorithms have been discovered over the last decade, yet a large number of them derive their power from a handful of ingredients. The workshop will review the state of the art in quantum algorithms and complexity, identify problems where methods founded on the laws of quantum physics might play a significant role, and establish common targets.
David Kaiser, Massachusetts Institute of Technology (MIT)
Leonard Schulman, California Institute of Technology
We describe a new cryptosystem which (conjecturally) provides both a
trap-door one-way function and a signature scheme. The new system is a
type of "multivariate quadratic" cryptosystem, but is based on a
different trap-door from existing methods, and is simpler.
Marcos Cesar de Oliveira, University of Calgary
Antonio Corcoles, IBM
A Q+ hangout is a broadcast seminar using the hangout feature of Google+
Jonathan Oppenheim, University College London
Title: Fundamental limitations for quantum and nano thermodynamics
Igor Markov, University of Michigan