Events

Abstract

The exponential complexity of quantum systems is a double edged sword: while making quantum computers possible it is also an enormous obstacle to analyzing and understanding physical systems. Is there any way around this curse of exponentiality?

Here are three basic questions that explore this issue:

Jess Riedel, IBM

Abstract

Quantum computing and quantum algebra are two celebrated modern kindred areas of research. The pinata-smashing result in quantum computing (but not the first important result) was Shor's algorithm in 1994. The pinata-smashing result in quantum algebra (again, in hindsight not the first important result) was the Jones polynomial in 1984.

This lecture examines the implications of paradigm shifts in the different disciplines of sociology and physics.

Undergraduate School on Experimental Quantum Information Processing

A two-week program on the theory and experimental study of quantum information processors aimed primarily at students just completing their junior year. The program is designed to introduce students to the field of quantum information processing. The lectures are geared to students of engineering, physics, chemistry and math, though all interested students are invited to apply. The program has space for 20 students.

Giulio Chiribella, Tsinghua University