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


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