Quantum Information: Codes, Geometry and Random Structures
October 24 26, 2011Organizers
Aram Harrow (Washington), Patrick Hayden (McGill)
One of the primary concerns of quantum information theory is the design of codes for achieving communication in noisy environments, often while simultaneously achieving cryptographic objectives. The probabilistic method is often used to prove the existence of good codes and may even play a role in more explicit and efficient constructions. At the same time, many basic quantum information theoretic tasks have natural geometric interpretations that link them to a range of other application areas like compressed sensing and approximation algorithms through shared underlying mathematics. This workshop will provide a forum for participants to present the latest developments in the theory of quantum communication while highlighting the range of mathematical techniques used in the area, including representation theory, asymptotic geometric analysis, random matrix theory and operator theory.