Srinivasan Arunachalam
Srinivasan Arunachalam
IBM Research
Verified email at ibm.com - Homepage
Title
Cited by
Cited by
Year
Guest column: A survey of quantum learning theory
S Arunachalam, R de Wolf
ACM SIGACT News 48 (2), 41-67, 2017
1062017
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
862015
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
642019
Optimal quantum sample complexity of learning algorithms
S Arunachalam, R De Wolf
The Journal of Machine Learning Research 19 (1), 2879-2878, 2018
562018
A rigorous and robust quantum speed-up in supervised machine learning
Y Liu, S Arunachalam, K Temme
Nature Physics 17 (9), 1013-1017, 2021
432021
Is absolute separability determined by the partial transpose?
S Arunachalam, N Johnston, V Russo
arXiv preprint arXiv:1405.5853, 2014
27*2014
Quantum query algorithms are completely bounded forms
S Arunachalam, J Briët, C Palazuelos
SIAM Journal on Computing 48 (3), 903-925, 2019
182019
Sample-efficient learning of interacting quantum systems
A Anshu, S Arunachalam, T Kuwahara, M Soleimanifar
Nature Physics, 1-5, 2021
14*2021
Two new results about exact quantum learning
S Arunachalam, S Chakraborty, T Lee, M Paraashar, RD Wolf
International Colloquium on Automata, Languages, and Programming, 2019
14*2019
Quantum statistical query learning
S Arunachalam, AB Grilo, H Yuen
arXiv preprint arXiv:2002.08240, 2020
92020
Optimizing the number of gates in quantum search
S Arunachalam, R De Wolf
arXiv preprint arXiv:1512.07550, 2015
92015
Improved Bounds on Fourier Entropy and Min-entropy
S Arunachalam, S Chakraborty, M Koucký, N Saurabh, R De Wolf
ACM Transactions on Computation Theory (TOCT) 13 (4), 1-40, 2021
82021
Quantum boosting
S Arunachalam, R Maity
International Conference on Machine Learning, 377-387, 2020
82020
Quantum hedging in two-round prover-verifier interactions
S Arunachalam, A Molina, V Russo
arXiv preprint arXiv:1310.7954, 2013
82013
Quantum hardness of learning shallow classical circuits
S Arunachalam, AB Grilo, A Sundaram
SIAM Journal on Computing 50 (3), 972-1013, 2021
72021
Quantum Coupon Collector
S Arunachalam, A Belovs, AM Childs, R Kothari, A Rosmanis, R de Wolf
arXiv preprint arXiv:2002.07688, 2020
62020
Quantum speed-ups for Boolean satisfiability and derivative-free optimization/by Srinivasan Arunachalam.
S Arunachalam
University of Waterloo, Waterloo, Ontario, Canada, 2014
6*2014
Quantum learning algorithms imply circuit lower bounds
S Arunachalam, AB Grilo, T Gur, IC Oliveira, A Sundaram
arXiv preprint arXiv:2012.01920, 2020
32020
Simpler (classical) and faster (quantum) algorithms for Gibbs partition functions
S Arunachalam, V Havlicek, G Nannicini, K Temme, P Wocjan
arXiv preprint arXiv:2009.11270, 2020
32020
Satisfiability through auto correlation
S Arunachalam, I Kotsireas
SAT competition, 2014
3*2014
The system can't perform the operation now. Try again later.
Articles 1–20