September 19, 2014


Quantum Optimization Workshop
October 27-29, 2014

Fields Institute, 222 College St. Toronto

Organizing Committee: Thomas F. Coleman, Ilias S. Kotsireas,
Michele Mosca, Panos M. Pardalos, Rolando Somma

Quantum-inspired technologies have begun to emerge in various areas of Science and Engineering. In the realm of quantum computing, researchers develop algorithms that carry the potential to solve extremely hard computational problems, which are currently intractable by conventional algorithms. Recent advances demonstrated the potential of quantum algorithms in tackling successfully well.known extremely difficult combinatorial problems. We believe the time is ripe to challenge quantum computing researchers with hard discrete and continuous optimization problems, in order to assess the potential speedups that can be achieved with quantum algorithms and to devise new quantum algorithms to tackle such problems. The fundamental mandate of our proposed workshop will be to provide a forum for both scientific presentations and discussion of issues related to what we call quantum optimization. Optimizations researchers will learn about the quantum technology and methodologies and the quantum researchers will learn about hard optimization problems that may yield to quantum optimization approaches.

Confirmed Plenary Speakers:

Sergio Boixo, Google Inc
Richard Cleve, IQC, University of Waterloo
Andy Conn, IBM Research
Robin Kothari, MIT
Ashwin Nayak
, IQC, University of Waterloo
William Pulleyblank
, Department of Mathematical Sciences, United States Military Academy
Panos M. Pardalos, Center for Applied Optimization (CAO), University of Florida
Mario Szegedy, Computer Science, Rutgers University
Krysta M. Svore, Quantum Architectures and Computation Group (QuArC), Microsoft Research

Back to top