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. 

Leonard Susskind (Stanford University)

A few years ago three computer scientists named Adam Bouland, Bill Fefferman, and Umesh Vazirani, wrote a paper that promises to radically change the way we think about the interiors of black holes. Inspired by their paper I will explain how black holes threaten the QECTT, and how the properties of horizons rescue the thesis, and eventually make predictions for the complexity of extracting information from behind the black hole horizon. I'll try my best to explain enough about black holes to keep the lecture self contained.

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. 

Event description forthcoming. This is a joint workshop with CIQC. For more information, visit: https://ciqc.berkeley.edu/ciqc-colloquium

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. 

Mikhail Lukin (Harvard University)

We will discuss the recent advances involving programmable, coherent manipulation of quantum many-body systems using neutral atom arrays excited into Rydberg states, allowing the control over 200 qubits in two-dimensional arrays. Recent results involving the realization of exotic phases of matter, study of quantum phase transitions and  exploration of  their non-equilibrium dynamics will be presented.

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.