| No. |
Title |
Author |
Year |
| 1 |
Randomized Algorithms (Dagstuhl Seminar 9124) |
Karpinski, Marek et al. |
2021 |
| 2 |
Computational Pseudorandomness, the Wormhole Growth Paradox, and Constraints on the AdS/CFT Duality (Abstract) |
Bouland, Adam et al. |
2020 |
| 3 |
Simpler Proofs of Quantumness |
Brakerski, Zvika et al. |
2020 |
| 4 |
"Quantum Supremacy" and the Complexity of Random Circuit Sampling |
Bouland, Adam et al. |
2018 |
| 5 |
Approximate Low-Weight Check Codes and Circuit Lower Bounds for Noisy Ground States |
Nirkhe, Chinmay et al. |
2018 |
| 6 |
Rigorous Rg Algorithms and Area Laws for Low Energy Eigenstates In 1D |
Arad, Itai et al. |
2017 |
| 7 |
The Duality Gap for Two-Team Zero-Sum Games |
Schulman, Leonard et al. |
2017 |
| 8 |
Algorithms, Games, and Evolution (Invited Talk) |
Chastain, Erick et al. |
2014 |
| 9 |
Quantum State Description Complexity (Invited Talk) |
Vazirani, Umesh V. |
2011 |
