Yaoyun Shi, University of Michigan
Hui Zhang, University of Science and Technology, China
Dr. Rainer Kaltenbaek, University of Vienna
David Zueco, Universidad de Zaragoza
Dominic Berry, Macquarie University
Giulio Chiribella, Tsinghua University
David Poulin (Université de Sherbrooke), IQC
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.
Jess Riedel, IBM
Dr. Umesh Vazirani, University of California, Berkeley
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: