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. 

Dolev Bluvstein (Harvard)

Suppressing errors is one of the central challenges for useful quantum computing, requiring quantum error correction for large-scale processing. However, the overhead in the realization of error-corrected “logical” qubits, where information is encoded across many physical qubits for redundancy, poses significant challenges to large-scale logical quantum computing.

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. 

The compressed oracle technique, introduced in by Zhandry in 2019, is a technique for analyzing quantum query algorithms that has led to a number of breakthroughs in quantum complexity theory and cryptography. In this mini-workshop, we will hear about recent applications of this technique and variants to quantum query complexity and to the study of quantum pseudorandom unitaries. The goal of this week will be to better understand the power of this technique relative to traditional workhorses in quantum query complexity such as the polynomial method and the adversary method, and to identify directions for future work.

In classical cryptography, it has long been known that the existence of one-way functions is the minimum assumption. However, in quantum cryptography, where quantum computation and communication are possible, several recent studies have shown that it is not necessarily the case. This workshop will explore foundations of quantum cryptography without one-way functions to answer the ultimate open problem, "What is the most fundamental assumption in quantum cryptography?"

Speakers: Tomoyuki Morimae (Kyoto University), Prabhanjan Ananth (UC Santa Barbara), Andrea Coladangelo (University of Washington), James Bartusek (UC Berkeley), and Jiahui Liu (University of Texas at Austin)

The complexity of ground states of local Hamiltonians is the quantum analog of the theory of NP-Completeness. It features the two most important open questions in quantum complexity theory: the quantum PCP conjecture and the Area Law for 2D gapped Hamiltonians. Recent progress on the first question has been a direct consequence of the discovery of good quantum LDPC codes, while progress on the second question has relied on fault-tolerant polynomials. In a very exciting development, ideas from quantum error correction and quantum complexity theory play an unexpected and deep role in current attempts to understand quantum gravity. These connections even suggest the possibility that quantum gravity could violate the quantum extended Church-Turing thesis. This workshop will bring together researchers from TCS, information and coding theory, mathematics, physics to share recent progress, exchange ideas and make progress on these questions.

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 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.