No. Title Author Year
1 No Quantum Speedup over Gradient Descent for Non-Smooth Convex Optimization Garg, Ankit et al. 2021
2 Quantum Coupon Collector Arunachalam, Srinivasan et al. 2020
3 Quantum Lower Bounds for Approximate Counting via Laurent Polynomials Aaronson, Scott et al. 2020
4 When Is Amplification Necessary for Composition in Randomized Query Complexity? Ben-David, Shalev et al. 2020
5 Quantum Distinguishing Complexity, Zero-Error Algorithms, and Statistical Zero Knowledge Ben-David, Shalev et al. 2019
6 Separating Quantum Communication and Approximate Rank Anshu, Anurag et al. 2017
7 Nearly Optimal Separations Between Communication (or Query) Complexity and Partitions Ambainis, Andris et al. 2016
8 Randomized Query Complexity of Sabotaged and Composed Functions Shalev, Ben-David et al. 2016
9 Separating Decision Tree Complexity from Subcube Partition Complexity Kothari, Robin et al. 2015
10 An optimal quantum algorithm for the oracle identification problem Kothari, Robin 2014
11 Dequantizing Read-once Quantum Formulas Cosentino, Alessandro et al. 2013
12 Easy and Hard Functions for the Boolean Hidden Shift Problem Childs, Andrew M. et al. 2013
13 Quantum query complexity of minor-closed graph properties Childs, Andrew M. et al. 2011
Current Page :
Number of result pages: 1
Number of documents: 13

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