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

1 |
Improved Quantum Boosting |
Izdebski, Adam et al. |
2023 |

2 |
Quantum Algorithms and Lower Bounds for Linear Regression with Norm Constraints |
Chen, Yanlin et al. |
2023 |

3 |
Tight Bounds for Quantum Phase Estimation and Related Problems |
Mande, Nikhil S. et al. |
2023 |

4 |
Influence in Completely Bounded Block-Multilinear Forms and Classical Simulation of Quantum Algorithms |
Bansal, Nikhil et al. |
2022 |

5 |
Symmetry and Quantum Query-To-Communication Simulation |
Chakraborty, Sourav et al. |
2022 |

6 |
Quantum Algorithms for Matrix Scaling and Matrix Balancing |
van Apeldoorn, Joran et al. |
2021 |

7 |
Improved Bounds on Fourier Entropy and Min-Entropy |
Arunachalam, Srinivasan et al. |
2020 |

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

9 |
Two New Results About Quantum Exact Learning |
Arunachalam, Srinivasan et al. |
2019 |

10 |
Optimal Quantum Sample Complexity of Learning Algorithms |
Arunachalam, Srinivasan et al. |
2017 |

11 |
On the Sum-of-Squares Degree of Symmetric Quadratic Functions |
Lee, Troy et al. |
2016 |

12 |
Fooling One-Sided Quantum Protocols |
Klauck, Hartmut et al. |
2013 |

13 |
Optimal quantum query bounds for almost all Boolean functions |
Ambainis, Andris et al. |
2013 |

14 |
New bounds on the classical and quantum communication complexity of some graph properties |
Ivanyos, GĂˇbor et al. |
2012 |

15 |
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation |
Chen, Victor et al. |
2010 |

16 |
New Results on Quantum Property Testing |
Chakraborty, Sourav et al. |
2010 |

17 |
Error-Correcting Data Structures |
de Wolf, Ronald |
2009 |

18 |
Locally Decodable Quantum Codes |
Briet, Jop et al. |
2009 |