Srinivasan Arunachalam

my picture

I am a PhD student at Centrum Wiskune & Informatica and QuSoft, Amsterdam, Netherlands, supervised by Ronald de Wolf.
I finished my M.Math in Mathematics from University of Waterloo and Institute of Quantum computing, Canada in 2014, supervised by Michele Mosca.

Research interests

Quantum algorithms, Quantum learning theory, Quantum complexity theory, Quantum optimization, Analysis of Boolean functions.

Contact information

Email: arunacha (at) cwi (dot) nl.

Address: Room L230, Centrum Wiskunde & Informatica, Science Park 123, 1098 XG Amsterdam.


  1. Quantum query algorithms are completely bounded forms
    Srinivasan Arunachalam, Jop Briët, Carlos Palazuelos
    To be presented at Innovations in Theoretical Computer Science Conference (ITCS), 2018

  2. Optimizing quantum optimization algorithms via faster quantum gradient computation
    András Gilyén, Srinivasan Arunachalam, Nathan Wiebe

  3. A survey of quantum learning theory
    Srinivasan Arunachalam, Ronald de Wolf
    Computational Complexity Column, ACM SIGACT News, Vol. 48, June 2017.
    [arXiv] [SIGACT Column]

  4. Optimal quantum sample complexity of learning algorithms
    Srinivasan Arunachalam, Ronald de Wolf
    Presented at the 20th Conference on Quantum Information Processing (QIP), 2017
    32nd Conference on Computational Complexity (CCC), Vol. 79, 2017
    [arXiv] [CCC 2017] [QIP 2017: Video|Slides]

  5. Optimizing the Number of Gates in Quantum Search
    Srinivasan Arunachalam, Ronald de Wolf
    Quantum Information & Computation, Vol. 17, 2017
    [arXiv] [Quantum Information & Computation Vol. 17]
  6. Quantum hedging in two-round prover-verifier interactions
    Srinivasan Arunachalam, Abel Molina, Vincent Russo
    Proceedings of Theory of Quantum computation, Communication and Cryptography (TQC), 2017
    [arXiv] [TQC 2017]

  7. On the robustness of bucket brigade quantum RAM
    Srinivasan Arunachalam,Vlad Gheorghiu, Tomas Jochym-O’Connor, Michele Mosca, Priyaa Varshini Srinivasan
    Presented at Asian Quantum information science (AQIS), 2015
    Proceedings of Theory of Quantum computation, Communication and Cryptography (TQC), 2015
    New Journal of Physics, Vol. 17, 2015
    [arXiv] [TQC 2015] [New Journal of Physics: Article|Video abstract]
  8. Is absolute separability determined by the partial transpose?
    Srinivasan Arunachalam, Nathaniel Johnston, Vincent Russo
    Quantum Information & Computation, Vol. 15, 2015
    [arXiv] [Quantum Information & Computation Vol. 15]
  9. Some older projects

    Hard satisfiable 3-SAT instances via auto-correlation
    Srinivasan Arunachalam, Ilias Kotsireas
    Journal on Satisfiability, Boolean Modeling & Computation, Vol. 10, 2016
    Proceedings of SAT Competition 2014
    [SAT competition] [Journal version]

    Evaluation of Riemann Zeta function on the Line Re(s) = 1 and Odd Arguments
    Srinivasan Arunachalam

    A Substitution to Bernoulli Numbers in easier computation of ζ(2k)
    Srinivasan Arunachalam


    Quantum Speed-ups for Boolean Satisfiability and Derivative-Free Optimization.
    Srinivasan Arunachalam
    Master's thesis (2014)
    University of Waterloo. [PDF]

    External links: Google Scholar, ArXiv