Events

Filter by:

Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the title matches:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Thursday, June 26, 2014 3:00 pm - 4:00 pm EDT (GMT -04:00)

Ganainy: Quantum-inspired photonic structures

Ramy El Ganainy, Michigan Technological University

Quantum physics is playing an ever increasing role in several interdisciplinary research fields. In this presentation, I will show how some of the elementary mathematics of quantum mechanics can be used to synthesize classical photonic structures having novel functionalities.

Thursday, July 3, 2014 11:45 am - 12:45 pm EDT (GMT -04:00)

Kothari: Jordan's Lemma and quantum computing

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

Monday, July 7, 2014 2:30 pm - 3:30 pm EDT (GMT -04:00)

Unruh: Quantum position verification (Crypto 2014)

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.

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.

Thursday, July 17, 2014 1:00 pm - 2:00 pm EDT (GMT -04:00)

Bravyi: Monte Carlo simulation of stoquastic Hamiltonians

Sergey Bravyi, IBM Research

Stoquastic Hamiltonians are characterized by the property that their off-diagonal matrix elements in the standard product basis are real and non-positive. Many interesting quantum models fall into this class including the Transverse field Ising Model (TIM), the Heisenberg model on bipartite graphs, and the bosonic Hubbard model.

Thursday, July 17, 2014 3:00 pm - 3:00 pm EDT (GMT -04:00)

Austin Fowler - Why and how should we build a quantum computer?

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.

Monday, July 21, 2014 2:30 pm - 3:30 pm EDT (GMT -04:00)

Szameit: Laser-written integrated photonic quantum circuits

Alexander Szameit, Friedrich-Schiller-Universität Jena

I report about our recent achievements on integrated photonic quantum circuits. For the fabrication we use direct laser-inscription, which allows complex three-dimensional waveguide architectures on chip for using multiple degrees of freedom, in particular diffraction control and birefringence.

Monday, July 28, 2014 1:00 pm - 2:00 pm EDT (GMT -04:00)

Weihs: Nonclassical light from semiconductor quantum dots

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.

Monday, July 28, 2014 2:30 pm - 3:25 pm EDT (GMT -04:00)

Roland: Quantum algorithms based on quantum walks

Jérémie Roland - Université Libre de Bruxelles

In this talk, we will give a survey of quantum algorithms based on quantum walks, focusing in particular on search algorithms. The father of almost all quantum search algorithms is Grover's algorithm, which can be seen as a quantum walk on the complete graph. Later on, variations of Grover's algorithm have been proposed for searching on other graphs, such as the grid or the hypercube.