No. |
Title |
Author |
Year |
---|

1 |
Quantum Coupon Collector |
Arunachalam, Srinivasan et al. |
2020 |

2 |
Quantum Lower Bounds for Approximate Counting via Laurent Polynomials |
Aaronson, Scott et al. |
2020 |

3 |
When Is Amplification Necessary for Composition in Randomized Query Complexity? |
Ben-David, Shalev et al. |
2020 |

4 |
Quantum Distinguishing Complexity, Zero-Error Algorithms, and Statistical Zero Knowledge |
Ben-David, Shalev et al. |
2019 |

5 |
Separating Quantum Communication and Approximate Rank |
Anshu, Anurag et al. |
2017 |

6 |
Nearly Optimal Separations Between Communication (or Query) Complexity and Partitions |
Ambainis, Andris et al. |
2016 |

7 |
Randomized Query Complexity of Sabotaged and Composed Functions |
Shalev, Ben-David et al. |
2016 |

8 |
Separating Decision Tree Complexity from Subcube Partition Complexity |
Kothari, Robin et al. |
2015 |

9 |
An optimal quantum algorithm for the oracle identification problem |
Kothari, Robin |
2014 |

10 |
Dequantizing Read-once Quantum Formulas |
Cosentino, Alessandro et al. |
2013 |

11 |
Easy and Hard Functions for the Boolean Hidden Shift Problem |
Childs, Andrew M. et al. |
2013 |

12 |
Quantum query complexity of minor-closed graph properties |
Childs, Andrew M. et al. |
2011 |