Denis Vion, CEA-Saclay, France
tbd
Matthias Christandl, Institute for Theoretical Physics ETH Zurich
Mark Zhandry, Stanford University
tbd
Göran Johansson, Chalmers University of Technology Sweden
Dr. David Reeb, Technische Universität München
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:
Jess Riedel, IBM
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.
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.