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 19, 2014 11:45 am - 12:45 pm EDT (GMT -04:00)

Shi: Physical Randomness Extractors

Yaoyun Shi, University of Michigan

How can one be certain that the output of an alleged random
number generator is indeed random? This question is important not
only for the efficiency and the security of information
processing, but also for understanding how intrinsically
unpredictable events are possible in Nature. Practical random
number generators have often been found to be insecure. All
existing theoretical solutions require a certain form of
independence among two or more sources of randomness, a condition

Thursday, June 19, 2014 3:00 pm - 4:00 pm EDT (GMT -04:00)

Roetteler: Repeat-Until-Success: a new tool for quantum circuit synthesis

Martin Roetteler,  NEC Laboratories America

Recently, quantum circuits that are composed of unitary as well as probabilistic elements were employed for quantum synthesis and compilation tasks. In some cases, RUS designs led to implementations that on average are more efficient than the previously best known solutions based on unitary circuit designs. I will highlight some of the developments that are related to the synthesis of single-qubit operations and to the implementation of integer arithmetic on a quantum computer.

Monday, June 23, 2014 12:00 am - Friday, June 27, 2014 12:00 am EDT (GMT -04:00)

Algebraic Combinatorics: Spectral Graph Theory, Erdös-Ko-Rado Theorems and Quantum Information Theory

A conference to celebrate the work of Chris Godsil

It is surprising that the characteristic polynomial ofChris Godsil the adjacency matrix of a graph provides a useful window onto combinatorial properties of the graph itself, but this approach to graph theory has been a source of interesting and useful results for over 80 years.

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.