Srinivasan Arunachalam
- Full Name
- S. Arunachalam
- Function(s)
- PhD student
- S.Arunachalam@cwi.nl
- Telephone
- +31 20 592 4308
- Room
- L230
- Department(s)
- Algorithms and Complexity
Publications
-
Arunachalam, S. (2018, April 25). Quantum algorithms and learning theory.
-
Arunachalam, S, Briët, J, & Palazuelos, C. (2018). Quantum query algorithms are completely bounded forms. In Leibniz International Proceedings in Informatics, LIPIcs (pp. 3:1–3:21). doi:10.4230/LIPIcs.ITCS.2018.3
-
Arunachalam, S, & de Wolf, R. M. (2017). Optimal quantum sample complexity of learning algorithms. In Leibniz International Proceedings in Informatics, LIPIcs: Proceedings of Conference of Computational Complexity. doi:10.4230/LIPIcs.CCC.2017.25
-
Arunachalam, S, & de Wolf, R. M. (2017). A survey of quantum learning theory. ACM SIGACT News, 48(2), 41–67.
-
Arunachalam, S, & de Wolf, R. M. (2017). Optimizing the number of gates in quantum search. Quantum Information & Computation, 17(3&4), 251–261.
-
Arunachalam, S, Johnston, N, & Russo, V. (2015). Is absolute separability determined by the partial transpose?. Quantum Information and Computation, 15(7&8), 694–720.
Current projects with external funding
-
Progress in quantum computing:Algorithms, communication, and applications (QPROGRESS)