| 2025 | HOTNETS | Faster-than-light coordination for networked systems with quantum non-local games. | Venkat Arun, Vijay Chidambaram, Scott Aaronson |
| 2023 | ICML | Learning Distributions over Quantum Measurement Outcomes. | Weiyuan Gong, Scott Aaronson |
| 2023 | STOC | Certified Randomness from Quantum Supremacy. | Scott Aaronson, Shih-Han Hung |
| 2021 | CADE | An Automated Approach to the Collatz Conjecture. | Emre Yolcu, Scott Aaronson, Marijn J. H. Heule |
| 2021 | CRYPTO | New Approaches for Quantum Copy-Protection. | Scott Aaronson, Jiahui Liu, Qipeng Liu, Mark Zhandry, Ruizhe Zhang |
| 2021 | STOC | Degree vs. approximate degree and Quantum implications of Huang's sensitivity theorem. | Scott Aaronson, Shalev Ben-David, Robin Kothari, Shravas Rao, Avishay Tal |
| 2020 | SODA | Quantum Approximate Counting, Simplified. | Scott Aaronson, Patrick Rall |
| 2019 | FOCS | A Quantum Query Complexity Trichotomy for Regular Languages. | Scott Aaronson, Daniel Grier, Luke Schaeffer |
| 2019 | ICALP | Complexity-Theoretic Limitations on Blind Delegated Quantum Computation. | Scott Aaronson, Alexandru Cojocaru, Alexandru Gheorghiu, Elham Kashefi |
| 2019 | STOC | Gentle measurement of quantum states and differential privacy. | Scott Aaronson, Guy N. Rothblum |
| 2018 | STOC | Shadow tomography of quantum states. | Scott Aaronson |
| 2017 | STOC | The computational complexity of ball permutations. | Scott Aaronson, Adam Bouland, Greg Kuperberg, Saeed Mehraban |
| 2016 | FUN | The Fewest Clues Problem. | Erik D. Demaine, Fermi Ma, Ariel Schvartzman, Erik Waingarten, Scott Aaronson |
| 2016 | STOC | Separations in query complexity using cheat sheets. | Scott Aaronson, Shalev Ben-David, Robin Kothari |
| 2015 | STOC | Forrelation: A Problem that Optimally Separates Quantum from Classical Computing. | Scott Aaronson, Andris Ambainis |
| 2014 | ICALP | Weak Parity. | Scott Aaronson, Andris Ambainis, Kaspars Balodis, Mohammad Bavarian |
| 2012 | STOC | Quantum money from hidden subspaces. | Scott Aaronson, Paul F. Christiano |
| 2011 | CSR | The Equivalence of Sampling and Searching. | Scott Aaronson |
| 2011 | ICALP | Advice Coins for Classical and Quantum Computation. | Scott Aaronson, Andrew Drucker |
| 2011 | STOC | The computational complexity of linear optics. | Scott Aaronson, Alex Arkhipov |
| 2010 | STOC | BQP and the polynomial hierarchy. | Scott Aaronson |
| 2010 | STOC | A full characterization of quantum advice. | Scott Aaronson, Andrew Drucker |
| 2008 | FOCS | The Polynomial Method in Quantum and Classical Computing. | Scott Aaronson |
| 2008 | STOC | Algebrization: a new barrier in complexity theory. | Scott Aaronson, Avi Wigderson |
| 2007 | CSR | The Limits of Quantum Computers. | Scott Aaronson |
| 2005 | STOC | The complexity of agreement. | Scott Aaronson |
| 2004 | STOC | Multilinear formulas and skepticism of quantum computing. | Scott Aaronson |
| 2004 | STOC | Lower bounds for local search by quantum arguments. | Scott Aaronson |
| 2003 | FOCS | Quantum Search of Spatial Regions. | Scott Aaronson, Andris Ambainis |
| 2002 | STOC | Quantum lower bound for the collision problem. | Scott Aaronson |
| 1997 | SIGIR | Optimal Demand-oriented Topology for Hypertext Systems. | Scott Aaronson |