Events

Filter by:

Limit to events where the title matches:
Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Monday, January 31, 2011 12:30 pm - 1:00 pm EST (GMT -05:00)

Gus Gutoski: Short quantum games characterize PSPACE

Gus Gutoski, Institute for Quantum Computing

Abstract

I will present material from http://arxiv.org/abs/1011.2787. The abstract at that link is included below. Essentially, the result is a strengthening of the QIP=PSPACE result of Jain, Ji, Upadhyay, and Watrous from 2009. A goal of this talk is to clarify the statement and meaning of the multiplicative weights update method and illustrate how it can be used to prove space bounds in quantum complexity theory.

Jon Tyson, Institute for Quantum Computing (IQC)

Abstract

I will derive provably-tight two-sided estimates of the reversibility of an
arbitrary quantum channel in terms of entanglement fidelity and on the
conditional min-entropy of an arbitrary bipartite mixed quantum state. Channel reversals have been studied by a number of research groups under the banner of "Approximate quantum error recovery."

Sophie Schirmer, University of Cambridge

Abstract

I will cover the basics in terms of the control objectives and algorithms, details about the implementation, and recent results about the convergence behaviour, control landscape, and field characteristics and similarities and differences we see in Markovian vs Non-Markovian systems.

Part of a MITACS seminar series