PIRSA Logo


PERIMETER INSTITUTE RECORDED SEMINAR ARCHIVE

Displaying all lectures given by: Aram Harrow


Minimum output entropy of quantum channels is hard to approximate
Speaker(s): Aram Harrow
Abstract: The headline result of this talk is that, based on plausible complexity-theoretic assumptions, many properties of quantum channels are computationally hard to approximate. These hard-to-compute properties include the minimum output entropy, the 1->p norms of channels, and their "regu... read more
Date: 06/07/2010 - 3:00 pm

The princess and the EPR pair
Speaker(s): Aram Harrow
Abstract: In quantum information, entanglement has often been viewed as a resource. But in this talk, I will look at (pure bipartite) entanglement through the lens of superselection rules. The idea is that it requires quantum communication not only to create entanglement, but also to destroy it in a way that ... read more
Date: 08/02/2010 - 4:00 pm

Quantum algorithm for solving linear systems of equations
Speaker(s): Aram Harrow
Abstract: Solving linear systems of equations is a common problem that arises both on its own and as a subroutine in more complex problems: given a matrix A and a vector b, find a vector x such that Ax=b. Often, one does not need to know the solution x itself, but rather an approximation of the expectation va... read more
Date: 04/05/2009 - 4:00 pm

Pseudo-random quantum states and operations
Speaker(s): Aram Harrow
Abstract: The idea of pseudo-randomness is to use little or no randomness to simulate a random object such as a random number, permutation, graph, quantum state, etc... The simulation should then have some superficial resemblance to a truly random object; for example, the first few moments of a random variabl... read more
Date: 28/04/2008 - 11:10 am
Valid XHTML 1.0!