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:
Tuesday, October 25, 2016 10:00 am - 10:00 am EDT (GMT -04:00)

Special Seminar: Greg Holloway

Metal-oxide-semiconductor (MOS) Si quantum dots

Greg Holloway, IQC

Electrostatically defined quantum dots provide a flexible implementation for scalable spin-based quantum information processing. Recently Si has emerged as a promising platform for these systems, due to its long electron spin coherence times, and its compatibility with numerous fabrication processes. In this talk I will give a detailed description of the device architecture, as well as a description of transport through Si quantum dots.

Monday, October 31, 2016 2:30 pm - 2:30 pm EDT (GMT -04:00)

Colloquium: Martin Suchara

Efficient Fault-Tolerant Quantum Computing

Martin Suchara, AT&T Labs Research

Quantum error correction presents some of the most significant and interesting challenges that must be resolved before building an efficient quantum computer. Quantum error correcting codes allow to successfully run quantum algorithms on unreliable quantum hardware. Because quantum hardware suffers from errors such as decoherence, leakage or qubit loss, and these errors corrupt delicate quantum states rather than binary information, the known error correction techniques are complex and have a high overhead. 

Monday, November 7, 2016 11:30 am - 11:30 am EST (GMT -05:00)

Theory of Quantum Information and Computation Seminar: Ashwin Nayak

A proof of the quantum data processing inequality with a combinatorial flavour

Ashwin Nayak, Institute for Quantum Computing

The quantum data processing inequality (equivalently, the strong sub-additivity of von Neumann entropy) is a cornerstone of quantum information theory.  It has been proven in numerous ways, each proof highlighting different aspects of the property.

Monday, November 7, 2016 2:30 pm - 2:30 pm EST (GMT -05:00)

Colloquium: William Oliver

Quantum Engineering of Superconducting Qubits

William Oliver, Massachusetts Institute of Technology

Superconducting qubits are coherent artificial atoms assembled from electrical circuit elements and microwave optical components. Their lithographic scalability, compatibility with microwave control, and operability at nanosecond time scales all converge to make the superconducting qubit a highly attractive candidate for the constituent logical elements of a quantum information processor. 

Thursday, November 10, 2016 11:00 am - 11:00 am EST (GMT -05:00)

Seminar: Juan Bermejo Vega

Contextuality as a resource for quantum computation

Juan Bermejo Vega

A central question in quantum computation is to identify the resources that are responsible for quantum speed-up. Quantum contextuality has been recently shown to be a resource for quantum computation with magic states for odd-prime dimensional qudits and two-dimensional systems with real wavefunctions. The phenomenon of state-independent contextuality poses a priori an obstruction to characterizing the case of regular qubits, the fundamental building block of quantum computation.

Monday, November 14, 2016 11:45 am - 11:45 am EST (GMT -05:00)

Theory of Quantum Information and Computation Seminar: Jon Yard

SIC-POVMs and algebraic number theory

John Yard, Institute for Quantum Computing

SIC-POVMs (Symmetric Informationally Complete Positive Operator-Valued Measures) are certain extremal rank-1 projective measurements corresponding to maximal sets of complex equiangular lines as well as to minimal complex projective 2-designs. They are conjectured to exist in every finite-dimensional complex Hilbert space as orbits of generalized Pauli groups. 

Monday, November 14, 2016 2:30 pm - 2:30 pm EST (GMT -05:00)

Colloquium: Douglas Stebila

Post-Quantum Key Exchange for the Internet and the Open Quantum Safe Project

Douglas Stebila, McMaster University

Most public key cryptography algorithms used on the Internet are based on mathematical problems which could be broken by large-scale quantum computers. This motivates the field of post-quantum cryptography, which aims to construct public key cryptosystems that are believed to be secure even against quantum computers. Since a future quantum computer could retroactively break the confidentiality of today's communications, it is important to begin transitioning public key encryption and key exchange to quantum-resistant algorithms.

Tuesday, November 15, 2016 11:00 am - 11:00 am EST (GMT -05:00)

Seminar: Charles W. Clark

Twisting the neutron wavefunction

Charles W. Clark, National Institute of Standards and Technology

Wave motions in water were already familiar in antiquity. The mathematical representation of waves in physics today is essentially the same as that first provided by d'Alembert and Euler in the mid-18th century. Yet it was only in the early 1990s that physicists managed to control a basic property of light waves: their capability of swirling around their own axis of propagation.

Tuesday, November 15, 2016 7:00 pm - 7:00 pm EST (GMT -05:00)

Over the Rainbow: The Other World Seen by Animals

Public lecture by Charles W. Clark

Much of what we understand about the world comes from our eyes, which sense the colors from red to violet that are expressed in the rainbow.