Monday, July 28, 2014 — 2:30 PM to 3:25 PM EDT
Jérémie Roland - Université Libre de Bruxelles
Monday, July 28, 2014 — 1:00 PM to 2:00 PM EDT
Gregor Weihs, Institut für Experimentalphysik, Universität Innsbruck
For fundamental tests of quantum physics as well as for quantum communications non-classical states of light are an important tool. In our research we focus on developing semiconductor-based and integrated sources of single photons and entangled photon pairs.
Thursday, July 24, 2014 — 2:00 PM to 3:00 PM EDT
Genda Gu, Brookhaven National Laboratory
Monday, July 21, 2014 — 2:30 PM to 3:30 PM EDT
Alexander Szameit, Friedrich-Schiller-Universität Jena
Thursday, July 17, 2014 — 3:00 PM EDT
Quantum algorithms exponentially faster than their classical equivalents exist for code breaking, quantum chemistry, knot theory, group theory, and are speculated to exist for diverse applications including machine learning and artificial intelligence. I review these applications and the current state of knowledge on how to build a practical quantum computer.
Thursday, July 17, 2014 — 1:00 PM to 2:00 PM EDT
Sergey Bravyi, IBM Research
Tuesday, July 15, 2014 — 1:00 PM to 2:00 PM EDT
Karol Zyczkowski, Jagellonian University
A pure quantum state of N subsystems with d levels each is called
k-uniform, if all its reductions to k qudits are maximally mixed.
These states form a natural generalization of N-qudits GHZ states
which belong to the class 1-uniform states.
Monday, July 7, 2014 — 2:30 PM to 3:30 PM EDT
Dominique Unruh, University of Tartu
Position verification allows us to verify the position of a device in space (e.g., for enabling access to location based services). Unfortunately, position verification is known to be insecure in principle using only classical cryptography. We show how position verification can be achieved using quantum communication.
Thursday, July 3, 2014 — 11:45 AM to 12:45 PM EDT
Robin Kothari
I will talk about a classic lemma due to Jordan (1875) that is
frequently used in quantum computing. Jordan's lemma says that given
any two orthogonal projectors, there is a way to partition the
underlying vector space into 1- and 2-dimensional subspaces that are
invariant under the action of both projectors. This simple lemma has
applications in several areas of quantum computing. In this talk will
discuss the lemma, its proof, and explain some selected applications in
