The field of quantum computation is entering an exciting new period. Small to medium scale quantum computers are around the corner, and the biggest upcoming challenges are expected to be algorithmic. The first major challenge is identifying what kinds of computational tasks such computers will be useful for, where for the foreseeable future the scale issue is compounded by minimal or non-existent error correction. The second challenge is the testing of such devices, as direct simulation by classical computers is all but impossible and running a trace on the quantum program is ruled out by the basic laws of quantum physics.
Providing answers to these questions requires a collaboration between classical theoretical computer science and physics, chemistry and mathematics. On the quantum algorithms front, there are great challenges in proposals for quantum machine learning and quantum annealing, with connections to classical machine learning, algorithms for low rank matrix completion, and MCMC algorithms. The most promising algorithmic application for quantum computers in the long run, their "killer app," is expected to be the simulation of quantum systems and quantum chemistry.
On the theoretical computer science end, existing work on testing quantum devices has already led to exciting connections with the theory of interactive proof systems and theoretical cryptography. These connections will evolve into a beautiful and deep theory as the challenges in complexity theory, cryptography and security raised by interactions with quantum devices are more systematically explored.
The semester-long program will bring together researchers from computer science, physics, chemistry and mathematics to collaborate on formalizing and tackling these questions.
sympa [at] lists [dot] simons [dot] berkeley [dot] edu (body: subscribe%20quantum2020announcements%40lists.simons.berkeley.edu) (Click here to subscribe to our announcements email list for this program).
List of participants (tentative list, including organizers):
Scott Aaronson (University of Texas at Austin), Dorit Aharonov (Hebrew University of Jerusalem), Gorjan Alagic (QuICS), Daniel J. Bernstein (University of Illinois at Chicago and Ruhr
University Bochum), Zvika Brakerski (Weizmann Institute of Science), Fernando Brandao (California Institute of Technology), Sergey Bravyi (IBM T.J. Watson Research Center), Garnet Chan (California Institute of Technology), Andrew Childs (University of Maryland), Ignacio Cirac (Max-Planck-Institut für Quantenoptik), Elizabeth Crosson (UNM), David DiVincenzo (RWTH Aachen), Vedran Dunjko (Leiden University), Kirsten Eisentrager (Penn State), Jens Eisert (Freie Universität Berlin), Eddie Farhi (Google), David Gosset (University of Waterloo), Sean Hallgren (Pennsylvania State University), Sandy Irani (UC Irvine), Stacey Jeffery (Centrum Wiskunde & Informatica), Stephen Jordan (Microsoft Research), Iordanis Kerenidis (CNRS - Université Paris Diderot), Robin Kothari (Microsoft Research), Guang-Hao Low (Microsoft Research), Ashley Montanaro (University of Bristol), Ben Reichardt (University of Southern California), Christian Schaffner (QuSoft), Norbert Schuch (Max-Planck-Institut für Quantenoptik), Barbara Terhal (Delft University of Technology), Umesh Vazirani (UC Berkeley), Thomas Vidick (California Institute of Technology), James Whitfield (Dartmouth College), Nathan Wiebe (Microsoft Research), Xiaodi Wu (Massachusetts Institute of Technology), Penghui Yao (Nanjing University)
Aleksandrs Belovs (University of Latvia), Andrea Wei Coladangelo (California Institute of Technology), Yfke Dulek (University of Amsterdam), András Pál Gilyén (Centrum Wiskunde en Informatica), Alex Bredariol Grilo (CWI and QuSoft), Urmila Mahadev (UC Berkeley), Saeed Mehraban (Massachusetts Institute of Technology), Henry Yuen (University of Toronto)
Those interested in participating in this program should send an email to the organizers at this quantum2020 [at] lists [dot] simons [dot] berkeley [dot] edu (at this address).