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