Srinivasan Arunachalam
Srinivasan Arunachalam
Postdoc, MIT
Verified email at - Homepage
TitleCited byYear
Is absolute separability determined by the partial transpose?
S Arunachalam, N Johnston, V Russo
arXiv preprint arXiv:1405.5853, 2014
On the robustness of bucket brigade quantum RAM
S Arunachalam, V Gheorghiu, T Jochym-O’Connor, M Mosca, ...
New Journal of Physics 17 (12), 123010, 2015
Guest column: a survey of quantum learning theory
S Arunachalam, R de Wolf
ACM SIGACT News 48 (2), 41-67, 2017
Optimal quantum sample complexity of learning algorithms
S Arunachalam, R De Wolf
The Journal of Machine Learning Research 19 (1), 2879-2878, 2018
Optimizing quantum optimization algorithms via faster quantum gradient computation
A Gilyén, S Arunachalam, N Wiebe
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
Quantum query algorithms are completely bounded forms
S Arunachalam, J Briët, C Palazuelos
arXiv preprint arXiv:1711.07285, 2017
Quantum hedging in two-round prover-verifier interactions
S Arunachalam, A Molina, V Russo
arXiv preprint arXiv:1310.7954, 2013
Quantum speed-ups for boolean satisfiability and derivative-free optimization
S Arunachalam
University of Waterloo, 2014
Optimizing the number of gates in quantum search
S Arunachalam, R De Wolf
arXiv preprint arXiv:1512.07550, 2015
Two new results about quantum exact learning
S Arunachalam, S Chakraborty, T Lee, R de Wolf
arXiv preprint arXiv:1810.00481, 2018
Improved bounds on Fourier entropy and Min-entropy
S Arunachalam, S Chakraborty, M Koucký, N Saurabh, R de Wolf
arXiv preprint arXiv:1809.09819, 2018
Satisfiability through auto correlation
S Arunachalam, I Kotsireas
SAT COMPETITION 2014, 87, 2014
Quantum algorithms and learning theory
S Arunachalam
A Substitution to Bernoulli Numbers in easier computation of (\zeta (2k))
S Arunachalam
arXiv preprint arXiv:1105.1214, 2011
The system can't perform the operation now. Try again later.
Articles 1–14