No. Title Author Year
1 Quantum Algorithms for Computational Geometry Problems Ambainis, Andris et al. 2020
2 Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language Ambainis, Andris et al. 2020
3 All Classical Adversary Methods are Equivalent for Total Functions Ambainis, Andris et al. 2018
4 Nearly Optimal Separations Between Communication (or Query) Complexity and Partitions Ambainis, Andris et al. 2016
5 Polynomials, Quantum Query Complexity, and Grothendieck's Inequality Aaronson, Scott et al. 2016
6 Exact Quantum Query Complexity of EXACT and THRESHOLD Ambainis, Andris et al. 2013
7 Optimal quantum query bounds for almost all Boolean functions Ambainis, Andris et al. 2013
8 Provable Advantage for Quantum Strategies in Random Symmetric XOR Games Ambainis, Andris et al. 2013
9 Variable time amplitude amplification and quantum algorithms for linear algebra problems Ambainis, Andris 2012
10 Quantum search with variable times Ambainis, Andris 2008
Current Page :
Number of result pages: 1
Number of documents: 10


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