Alumni

It’s often useful to have a private conversation within a public world. What role can quantum cryptography play in keeping conversations private? Sometimes described as providing “unconditional security guaranteed by the laws of quantum physics,” its security implications are both tantalizing and surprisingly elusive. This talk introduces quantum cryptography and describes the speaker’s experience creating several types of quantum cryptography equipment, within the broader context of mainstream cryptography and secure communications.

Biography

The school is designed for researchers in mathematics, physics or computer science who are interested in learning about quantum information.

More information about this event…

Louis Taillefer, Université de Sherbrooke

From invisibility cloaks to teleportation, Harry Potter’s world is filled with mystery and wonder. Yet this magical world is not so different from the world we inhabit. Just beneath the surface of our ordinary lives is a strange quantum reality.

Grégoire Ribordy, id Quantique

Mike Thewalt, Simon Fraser University

Approximation algorithms for classical constraint satisfaction problems are one of the main research areas in theoretical computer science. A natural generalization of constraint satisfaction problems to the quantum setting is the local Hamiltonian problem, which is of significant interest to both complexity theorists and to physicists studying properties of physical systems alike. In this talk, we define a natural approximation version of the local Hamiltonian problem and initiate its study. We present two main results.

Mike Geller, University of Georgia