Charles H. Bennett: Time travel for nerds: would closed timelike curves speed up hard computations or crack codes?
Charles H. Bennett, IBM TJ Watson Research Center
Charles H. Bennett, IBM TJ Watson Research Center
Oleg Gittsovich, Institute for Quantum Computing (IQC)
Igor Markov, University of Michigan
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
Antonio Corcoles, IBM
Marcos Cesar de Oliveira, University of Calgary
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.
David Kaiser, Massachusetts Institute of Technology (MIT)
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.
Hanhee Paik, Yale