Faculty

Friday, May 24, 2013 10:30 am - 11:30 am EDT (GMT -04:00)

Greg Kuperberg: Connections between quantum computing and quantum algebra

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.

Friday, May 24, 2013 12:00 am - Sunday, May 26, 2013 1:00 am EDT (GMT -04:00)

Quantum Computation and Complex Networks

This workshop will bring together researchers and students coming from diversified scientific areas, whose connections start to emerge. We expect that the variety of expertise and technicalities brought by each community will be beneficial to approach problems of common interest, and it will stimulate new questions of relevance for a large scientific community.

More information about this event…

Friday, May 17, 2013 1:30 pm - 2:30 pm EDT (GMT -04:00)

Dr. Umesh Vazirani: Quantum Hamiltonian Complexity: through the computational lens

Dr. Umesh Vazirani, University of California, Berkeley

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: