| No. |
Title |
Author |
Year |
| 1 |
The Acrobatics of BQP |
Aaronson, Scott et al. |
2022 |
| 2 |
BQP After 28 Years (Invited Talk) |
Aaronson, Scott |
2021 |
| 3 |
On the Quantum Complexity of Closest Pair and Related Problems |
Aaronson, Scott et al. |
2020 |
| 4 |
Quantum Lower Bounds for Approximate Counting via Laurent Polynomials |
Aaronson, Scott et al. |
2020 |
| 5 |
Complexity-Theoretic Limitations on Blind Delegated Quantum Computation |
Aaronson, Scott et al. |
2019 |
| 6 |
Complexity-Theoretic Foundations of Quantum Supremacy Experiments |
Aaronson, Scott et al. |
2017 |
| 7 |
The Classification of Reversible Bit Operations |
Aaronson, Scott et al. |
2017 |
| 8 |
Polynomials, Quantum Query Complexity, and Grothendieck's Inequality |
Aaronson, Scott et al. |
2016 |
| 9 |
Sculpting Quantum Speedups |
Aaronson, Scott et al. |
2016 |
| 10 |
The Fewest Clues Problem |
Demaine, Erik D. et al. |
2016 |
