No. Title Author Year
1 An Exponential Separation Between Quantum Query Complexity and the Polynomial Degree Ambainis, Andris et al. 2023
2 Quantum Coupon Collector Arunachalam, Srinivasan et al. 2020
3 Quantum Algorithms for Classical Probability Distributions Belovs, Aleksandrs 2019
4 Adaptive Lower Bound for Testing Monotonicity on the Line Belovs, Aleksandrs 2018
5 Provably Secure Key Establishment Against Quantum Adversaries Belovs, Aleksandrs et al. 2018
6 Quantum Lower Bounds for Tripartite Versions of the Hidden Shift and the Set Equality Problems Belovs, Aleksandrs et al. 2018
7 On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz Belovs, Aleksandrs et al. 2017
Current Page :
Number of result pages: 1
Number of documents: 7

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