| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Improved Algorithm and Lower Bound for Variable Time Quantum Search | Ambainis, Andris et al. | 2023 |
| 2 | Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs | Glos, Adam et al. | 2021 |
| 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 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 5 |