No. | Title | Author | Year |
---|---|---|---|
1 | The Parametrized Complexity of Quantum Verification | Arunachalam, Srinivasan et al. | 2022 |
2 | Communication Memento: Memoryless Communication Complexity | Arunachalam, Srinivasan et al. | 2021 |
3 | Improved Bounds on Fourier Entropy and Min-Entropy | Arunachalam, Srinivasan et al. | 2020 |
4 | Quantum Coupon Collector | Arunachalam, Srinivasan et al. | 2020 |
5 | Two New Results About Quantum Exact Learning | Arunachalam, Srinivasan et al. | 2019 |
6 | Quantum Hedging in Two-Round Prover-Verifier Interactions | Arunachalam, Srinivasan et al. | 2018 |
7 | Quantum Query Algorithms are Completely Bounded Forms | Arunachalam, Srinivasan et al. | 2018 |
8 | Optimal Quantum Sample Complexity of Learning Algorithms | Arunachalam, Srinivasan et al. | 2017 |
9 | On the Robustness of Bucket Brigade Quantum RAM | Arunachalam, Srinivasan et al. | 2015 |
Current Page : | |
Number of result pages: | 1 |
Number of documents: | 9 |