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