Entangling Electrons
Markus Kindermann
No enrollment limit, no advance sign up
Participants welcome at individual sessions (series)
Prereq: Quantum Mechanics; Condensed Matter / Statistical Mechancs d
Entanglement is an intrinsically quantum mechanical concept and at the heart of quantum information and computation. Many-body quantum states are generically entangled. For practical purposes one wants to generate entanglement, however, in a controlled way. This has been achieved in quantum optics, where entanglement within pairs of photons can be produced at will. It is currently an experimental challenge to do the same with electrons in solid state devices.
Contact: Timothy F. Havel, NW14-2218, 253-8309, tfhavel@mit.edu
LECTURE 1: WHAT IS ENTANGLEMENT?
Markus Kindermann
The concept of entanglement will be introduced along with its signatures and practical applications. In particular, the concepts of Bell's inequalities and quantum teleportation will be explained.
Wed Jan 21, 11-12:00am, NW14-1112
LECTURE 2: ENTANGLING ELECTRONS
Markus Kindermann
An overview over recent theoretical proposals to entangle electrons in solid state devices will be given. The basic ideas behind various proposed electron entanglers as well as entanglement detectors will be discussed.
Thu Jan 22, 11-12:00am, NW14-1112
LECTURE 3: ENTANGLEMENT WITHOUT INTERACTION
Markus Kindermann
A conceptually particularly simple one of these proposals will be discussed in detail, which does not rely on two-particle interactions between the electrons. The entanglement can be detected by measuring correlations between electrical currents through the device.
Fri Jan 23, 11-12:00am, NW14-1112
|
Exploring Quantum Chaos with Quantum Computers
David Poulin & Joseph Emerson Perimeter Institute, Canada
No enrollment limit, no advance sign up
Participants welcome at individual sessions (series)
Prereq: Linear algebra + two years of physics
We discuss how quantum information processors could be used to study various aspects of quantum chaos. In particular, we will show how the ability to simulate the dynamics of certain quantum systems on a quantum computer enables us to evaluate interesting physical quantities, such as spectral correlation functions and stability under perturbation, which serve as signatures of quantum chaos. Time permitting, we will also discuss the problem of the emergence of classical chaos from quantum theory.
Contact: Timothy F. Havel, NW14-2218, 253-8309, tfhavel@mit.edu
Lecture 1: Introduction to Quantum Computing and Quantum Maps
David Poulin
(+) Quantum mechanics in a nutshell
(+) Quantum computing
(+) Fungible qubits and universal dynamics
(+) Efficient quantum algorithms
(+) Quantum simulation of a chaotic map
Wed Jan 21, 02-03:30pm, NW14-1112
Lecture 2: Measuring Signatures of Quantum Chaos on a Quantum Computer
David Poulin
(+) Classical chaos
(+) Sensitivity to initial state
(+) Readout problem
(+) Looking for symmetries
(+) Fidelity decay
Thu Jan 22, 02-03:30pm, NW14-1112
Lecture 3: Advanced Topics in Quantum Chaos
Joseph Emerson
(+) Quantum dynamical localization
(+) Quantum chaos in the classical limit
Fri Jan 23, 02-03:30pm, NW14-1112
|
Quantum Algorithms: Promise, Present and Prospect
Willem Klaas (Wim) van Dam
No enrollment limit, no advance sign up
Participants welcome at individual sessions (series)
Prereq: Linear algebra + basic computer science
See descriptions below for details.
Contact: Timothy F. Havel, NW14-2218, 253-8309, tfhavel@mit.edu
Lecture 1: The Promise
Willem Klaas (Wim) van Dam
I explain what quantum bits and quantum circuits are. Arguments are given why this computational model might be more powerful than classical computing. Some simple toy algorithms are given as well as some general lower bounds.
Wed Jan 21, 10-11:00am, NW14-1112
Lecture 2: The Present
Willem Klaas (Wim) van Dam
An explanation of the quantum Fourier transform is given. Shor's algorithms for the discrete logarithm problem and factoring are described. The extension to the (Abelian) hidden subgroup is mentioned. Other quantum algorithms for Pell's equation, hidden shift problems and Gauss sum estimation are discussed as well.
Thu Jan 22, 10-11:00am, NW14-1112
Lecture 3: The Prospects
Willem Klaas (Wim) van Dam
I will give my point of view of where and how we could find new quantum algorithms. I will describe my work on the relation between quantum computing, the zeros of zeta functions, and approximate point counting of equations over finite fields. Likely other topics are: what about algorithms for problems that have to do with number theory, lattices and combinatorial optimization?
Fri Jan 23, 10-11:00am, NW14-1112
|
|
