Perimeter Institute Quantum Discussions

This series consists of weekly discussion sessions on foundations of quantum Theory and quantum information theory. The sessions start with an informal exposition of an interesting topic, research result or important question in the field. Everyone is strongly encouraged to participate with questions and comments.

Seminar Series Events/Videos

Currently there are no upcoming talks in this series.

 

Wednesday Apr 14, 2010
Speaker(s): 

Shared entanglement between sender and receiver can enable more errors to be corrected than with a standard quantum error-correcting code. This extra error correction can be used either to boost the rate of the code--commonly seen in quantum codes constructed from classical linear codes--or to increase the error-correcting power of the code (as represented by, for example, the code distance).

Scientific Areas: 

 

Wednesday Mar 17, 2010
Speaker(s): 

Topological phases in spin systems are exciting frontiers of research with intimate connections to quantum coding theory. However, there is a disconnection between quantum codes and the idea of topology, in the absence of geometry and physical realizability. Here, we introduce a toy model, in which quantum codes are constrained to not only have a local geometric description, but also have translation and scale symmetries. These additional physical constraints enable us to assign topologically invariant properties to geometric shapes of logical operators of the code.

Scientific Areas: 

 

Wednesday Mar 03, 2010
Speaker(s): 

In recent years the characterization of many-body ground states via the entanglement of their wave-function has attracted a lot of attention. One useful measure of entanglement is provided by the entanglement entropy S.

 

Wednesday Feb 03, 2010

Are Quantum Mechanics and Special Relativity unrelated theories? Is Quantum Field Theory an additional theoretical layer over them? Where the quantization rules and the Plank constant come from? All these questions can find answer in the computational paradigm: "the universe is a huge quantum computer".

 

Wednesday Nov 18, 2009
Speaker(s): 

Dualities appear in nearly all disciplines of physics and play a central role in statistical mechanics and field theory. I will discuss in a pedagogical way our recent findings motivated by a quest for a simple unifying framework for the detection and treatment of dualities.

Scientific Areas: 

 

Wednesday Nov 04, 2009
Speaker(s): 

A recent breakthrough in quantum computing has been the realization that quantum computation can proceed solely through single-qubit measurements on an appropriate quantum state. One exciting prospect is that the ground or low-temperature thermal state of an interacting quantum many-body system can serve as such a resource state for quantum computation. The system would simply need to be cooled sufficiently and then subjected to local measurements.

Scientific Areas: 

 

Wednesday Oct 07, 2009
Speaker(s): 

Adiabatic quantum optimization has attracted a lot of attention because small scale simulations gave hope that it would allow to solve NP-complete problems efficiently. Later, negative results proved the existence of specifically designed hard instances where adiabatic optimization requires exponential time. In spite of this, there was still hope that this would not happen for random instances of NP-complete problems.

Scientific Areas: 

 

Wednesday Sep 09, 2009
Speaker(s): 

At NIST we are engaged in an experiment whose goal is to create superpositions of optical coherent states (such superpositions are sometimes called "Schroedinger cat" states). We use homodyne detection to measure the light, and we apply maximum likelihood quantum state tomography to the homodyne data to estimate the state that we have created.

Scientific Areas: 

 

Wednesday Aug 12, 2009
Speaker(s): 

We review situations under which standard quantum adiabatic conditions fail. We reformulate the problem of adiabatic evolution as the problem of Hamiltonian eigenpath traversal, and give cost bounds in terms of the length of the eigenpath and the minimum energy gap of the Hamiltonians. We introduce a randomized evolution method that can be used to traverse the eigenpath and show that a standard adiabatic condition is recovered. We then describe more efficient methods for the same task and show that their implementation complexity is close to optimal.

Scientific Areas: 

Pages