This reunion workshop is for long-term participants in the program "Quantum Algorithms, Complexity, and Fault Tolerance," held in the spring 2024 semester. It will provide an opportunity to meet old and new friends. Moreover, we hope that it will give everyone a chance to reflect on the progress made during the semester and since, and sketch which directions the field should go in the future. In an effort to keep things informal and to encourage open discussion, none of the activities will be recorded. Participation in the workshop is by invitation only. 

Sample Schedule (see schedule tab for more detail)

9:00-9:30 AM Check-in refreshments

9:30-10:00 AM Talk 1

10:30-11:00 AM AM Break

11:00-12:00 AM Talk 2

12:00-2:00 PM Lunch

2:00-3:00 PM Talk 3

3:00-3:30 PM PM Break

3:30-4:30 PM Talk 4

4:30-5:30 PM Reception (Day 1 only)

If you require special accommodation, please contact our access coordinator at simonsevents@berkeley.edu with as much advance notice as possible.

Please note: the Simons Institute regularly captures photos and video of activity around the Institute for use in videos, publications, and promotional materials. 

This workshop will bring together researchers from academia and industry to explore topics from quantum complexity theory and cryptography to quantum algorithms, benchmarking, error correction, and fault tolerance. The program will have a special focus on NISQ (noisy intermediate-scale quantum) computers and complexity-based evidence of quantum advantage. A major challenge in this direction is improving quantum error-correcting codes and decoding algorithms for achieving early fault tolerance, and developing milestones for quantum advantage in the early fault tolerance regime. 

If you require special accommodation, please contact our access coordinator at simonsevents@berkeley.edu with as much advance notice as possible.

Please note: the Simons Institute regularly captures photos and video of activity around the Institute for use in videos, publications, and promotional materials. 

Please note: the Simons Institute regularly captures photos and video of activity around the Institute for use in videos, publications, and promotional materials. 

There has been a burst of recent progress on quantum error-correcting codes, across the physics, computer science, and math communities. This workshop will bring together researchers from all these communities to share recent progress and exchange ideas. Particular topics covered will include constructions of quantum LDPC codes and new algorithms for quantum codes. 

This is a joint workshop between the Error-Correcting Codes: Theory and Practice program and the Quantum Algorithms, Complexity, and Fault Tolerance program.

If you require special accommodation, please contact our access coordinator at simonsevents@berkeley.edu with as much advance notice as possible.

This workshop will bring together researchers from academia and industry to study the capabilities of existing and upcoming quantum computers. Topics will include protocols for characterizing quantum noise, as well as tailoring fault-tolerance protocols to more concrete noise models. The other theme will be proofs of quantumness and other near-term algorithms suitable for such computers, as well as algorithms for scalable fault-tolerant quantum computers.

Please note: the Simons Institute regularly captures photos and video of activity around the Institute for use in videos, publications, and promotional materials. 

Sergio Boixo (Google), Kostyantyn Kechedzhi (Google)

Quantum computers hold the promise of executing tasks beyond the capability of classical computers. Noise competes with coherent evolution and destroys long-range correlations, making it an outstanding challenge to fully leverage the computation power of near-term quantum processors. We report Random Circuit Sampling (RCS) experiments where we identify  distinct phases driven by the interplay between quantum dynamics and noise. Using cross-entropy benchmarking, we observe phase boundaries which can define the computational complexity of noisy quantum evolution.

This reunion workshop is for long-term participants in the program "Quantum Algorithms, Complexity, and Fault Tolerance," held in the spring 2024 semester. It will provide an opportunity to meet old and new friends. Moreover, we hope that it will give everyone a chance to reflect on the progress made during the semester and since, and sketch which directions the field should go in the future. In an effort to keep things informal and to encourage open discussion, none of the activities will be recorded. Participation in the workshop is by invitation only. 

Sample Schedule (see schedule tab for more detail)

9:00-9:30 AM Check-in refreshments

9:30-10:00 AM Talk 1

10:30-11:00 AM AM Break

11:00-12:00 AM Talk 2

12:00-2:00 PM Lunch

2:00-3:00 PM Talk 3

3:00-3:30 PM PM Break

3:30-4:30 PM Talk 4

4:30-5:30 PM Reception (Day 1 only)

If you require special accommodation, please contact our access coordinator at simonsevents@berkeley.edu with as much advance notice as possible.

Please note: the Simons Institute regularly captures photos and video of activity around the Institute for use in videos, publications, and promotional materials. 

Quantum Gibbs sampling is a family of quantum algorithms for simulating many-body physics in thermal equilibrium, which can be understood as the quantum analog of classical Markov chain Monte Carlo algorithms. We plan to cover quantum algorithms for sampling Gibbs states, techniques for proving mixing times, and obstructions to fast mixing. The goal is to introduce the basic concepts and techniques to newcomers and build towards an open-ended discussion.

Please note: the Simons Institute regularly captures photos and video of activity around the Institute for use in videos, publications, and promotional materials. 

The Boot Camp is intended to acquaint program participants with the key themes of the program. It will consist of five mini crash courses, plus a sequence of overview talks as follows:

Mini Crash Courses

Thomas Vidick (Massachusetts Institute of Technology): "Quantum Games and Semi-Definite Programming"
Ashwin Nayak (University of Waterloo): "Quantum Information Theory"
Luca Trevisan (Stanford University): "The Classical PCP Theorem"
Ben Reichardt (University of Southern California): "Quantum Error Correction"
Zeph Landau (UC Berkeley): "Tensor Networks"

Overview Talks

Umesh Vazirani (UC Berkeley): "Introduction to Quantum Hamiltonian Complexity"
Anne Broadbent (University of Waterloo): "Delegated Quantum Computation"
Yaoyun Shi (University of Michigan): "Untrusted Quantum Devices"
Daniel Nagaj (University of Vienna): "Quantum Complexity and Condensed Matter Physics"
Zeph Landau (UC Berkeley): "The Complexity of Ground States"
Aram Harrow (Massachusetts Institute of Technology): "Application of Quantum Information Theory in QHC"
Patrick Hayden (Stanford University): "Quantum Information Measures and Black Holes"
Thomas Vidick (Massachusetts Institute of Technology): "The Quantum PCP Theorem"
Aram Harrow (Massachusetts Institute of Technology): "SDP Hierarchies and Quantum States"
Daniel Nagaj (University of Vienna): "Many-body Physics and Complexity"
John Preskill (California Institute of Technology): "Simulating Quantum Field Theory with a Quantum Computer"

Click here for a set of introductory notes on the field of Quantum Hamiltonian Complexity intended to complement the Boot Camp.