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


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI