No. |
Title |
Author |
Year |
---|

1 |
On the Quantum Complexity of Closest Pair and Related Problems |
Aaronson, Scott et al. |
2020 |

2 |
Quantum Lower Bounds for Approximate Counting via Laurent Polynomials |
Aaronson, Scott et al. |
2020 |

3 |
Complexity-Theoretic Limitations on Blind Delegated Quantum Computation |
Aaronson, Scott et al. |
2019 |

4 |
Complexity-Theoretic Foundations of Quantum Supremacy Experiments |
Aaronson, Scott et al. |
2017 |

5 |
The Classification of Reversible Bit Operations |
Aaronson, Scott et al. |
2017 |

6 |
Polynomials, Quantum Query Complexity, and Grothendieck's Inequality |
Aaronson, Scott et al. |
2016 |

7 |
Sculpting Quantum Speedups |
Aaronson, Scott et al. |
2016 |

8 |
The Fewest Clues Problem |
Demaine, Erik D. et al. |
2016 |