Video Library

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. 

  

 

Monday Jun 04, 2007
Speaker(s): 

Almost all known superpolynomial quantum speedups over classical algorithms have used the quantum Fourier transform (QFT). Most known applications of the QFT make use of the QFT over abelian groups, including Shor’s well known factoring algorithm [1]. However, the QFT can be generalised to act on non-abelian groups allowing different applications. For example, Kuperberg solves the dihedral hidden subgroup problem in subexponential time using the QFT on the dihedral group. The aim of this research is to construct an efficient QFT on SU(2).

Scientific Areas: 

 

Monday Jun 04, 2007
Speaker(s): 

An approximate quantum encryption scheme uses a private key to encrypt a quantum state while leaking only a very small (though non-zero) amount of information to the adversary. Previous work has shown that while we need 2n bits of key to encrypt n qubits exactly, we can get away with only n bits in the approximate case, provided that we know that the state to be encrypted is not entangled with something that the adversary already has in his possession.

Scientific Areas: 

 

Monday Jun 04, 2007

Imperfections in devices are inevitable in practice.  In this talk, we focus on the imperfection of QKD systems in the detectors, namely that the efficiencies of the detectors are not completely identical.  We show some practical attacks that specifically exploit this efficiency mismatch and demonstrate how Eve may obtain some information on the final key if Alice and Bob are unaware of the attack.  Also, we discuss the upper and lower bounds on the secret key rates both with and without the assumption of the efficiency mismatch

Scientific Areas: 

 

Monday Jun 04, 2007

I will introduce Kitaev's suface codes as a block quantum error-correcting code.  Recovery procedures will be described in the case of imperfect syndrome measurements.  More might be covered if time permits.

Scientific Areas: 

 

Sunday Jun 03, 2007
Speaker(s): 

Imagine that Alice and Bob share a quantum state, from which they want to distill something useful like entanglement or secret key. For this they need to communicate classically and they want to do this by one way communication from Alice to Bob. For some states, it might happen that the state is a part of a tripartite state shared with Charlie, which is invariant if Bob's and Charlie's systems are switched. Such a state is called a symmetric extension, and if it exists Alice and Bob have no chance of distilling key or entanglement by one way communication.

Scientific Areas: 

 

Sunday Jun 03, 2007
Speaker(s): 

Traditionally, we use the quantum Fourier transform circuit (QFT) in order to perform quantum phase estimation, which has a number of useful applications.  The QFT circuit for a binary field generally consists controlled-rotation gates which, when removed, yields the lower-depth approximate QFT circuit.  It is known that a logarithmic-depth approximate QFT circuit is sufficient to perform phase estimation with a degree of accuracy negligibly lower than that of the full QFT.

Scientific Areas: 

Pages