Since 2002 Perimeter Institute has been recording seminars, conference talks, and public outreach events using video cameras installed in our lecture theatres. Perimeter now has 7 formal presentation spaces for its many scientific conferences, seminars, workshops and educational outreach activities, all with advanced audio-visual technical capabilities. Recordings of events in these areas are all available On-Demand from this Video Library and on Perimeter Institute Recorded Seminar Archive (PIRSA). PIRSA is a permanent, free, searchable, and citable archive of recorded seminars from relevant bodies in physics. This resource has been partially modelled after Cornell University's arXiv.org.
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 "regularized" versions, such as the classical capacity.
In this talk I will describe how random matrix theory and free probability theory (and in particular, results of Haagerup and Thorbjornsen) can give insight into the problem of understanding all possible eigenvalues of the output of important classes of random quantum channels. I will also describe applications to the minimum output entropy additivity problems.
In this talk we will explain how the main step technical steps in the proofs by Hastings and Hayden-Winter of the non-additivity of the minimal output von Neumann and $p$-Renyi entropy (for any $p>1$) can be reduced to a sharp version of Dvoretzky's theorem on almost spherical sections of convex bodies. This substantially simplifies their analysis, at least on the conceptual level, and provides an alternative point of view on these and related questions.
Joint work with G. Aubrun and E. Werner
In 2008 Hastings reported a randomized construction of channels violating the minimum output entropy additivity conjecture. In this talk we revisit his argument, presenting a simplified proof. In particular, we do not resort to the exact probability distribution of the Schmidt coefficients of a random bipartite pure state, as in the original proof, but rather derive the necessary large deviation bounds by a concentration of measure argument.
TBA
Within the framework of quantum repeated interactions we investigate the large time behaviour of random quantum channel. We focus on generic quantum channels generated by unitary operators which are randomly distributed along the Haar measure. After studying the spectrum of these channels, we state a convergence result for the iterations of generic channels. This allows to define a set of random quantum states called ''asymptotic induced ensemble''.
In this talk, I describe two cases in which questions in quantum information theory have lead me to random matrices.
In the first case, analyzing a protocol for quantum cryptography lead us to the following question: what is the largest eigenvalue of a sum of p random product states in (C^d)^{otimes k}, where k and p/d^k are fixed while d grows?
We associate to any unoriented graph a random pure quantum state, obtained by randomly rotating a tensor product of Bell states.
TBA
Limit laws and large deviations for the empirical measure of the singular values for ensembles of non-Hermitian matrices can be obtained based on explicit distributions for the eigenvalues. When considering the eigenvalues, however, the situation changes dramatically, and explicit expressions for the joint distribution of eigenvalues are not available (except in very special cases). Nevertheless, in some situations the limit of the empirical measure of eigenvalues (as a measure supported in the complex plane) can be computed, and it exhibits interesting features.