Srinivasan Arunachalam

According to our database, Srinivasan Arunachalam authored at least 39 papers between 2015 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

One Clean Qubit Suffices for Quantum Communication Advantage.

Srinivasan Arunachalam, Uma Girish, Noam Lifshitz

Electron. Colloquium Comput. Complex., 2023

A survey on the complexity of learning quantum states.

Anurag Anshu, Srinivasan Arunachalam

CoRR, 2023

Generalized Stratified Sampling for Efficient Reliability Assessment of Structures Against Natural Hazards.

Srinivasan Arunachalam, Seymour M. J. Spence

CoRR, 2023

Uncertainty Quantification of a Wind Tunnel-Informed Stochastic Wind Load Model for Wind Engineering Applications.

Thays Guerra Araujo Duarte, Srinivasan Arunachalam, Arthriya Subgranon, Seymour M. J. Spence

CoRR, 2023

A note on the partition bound for one-way classical communication complexity.

Srinivasan Arunachalam, João F. Doriguello, Rahul Jain

CoRR, 2023

Optimal Algorithms for Learning Quantum Phase States.

Srinivasan Arunachalam, Sergey Bravyi, Arkopal Dutt, Theodore J. Yoder

Proceedings of the 18th Conference on the Theory of Quantum Computation, 2023

On the Role of Entanglement and Statistics in Learning.

Srinivasan Arunachalam, Vojtech Havlícek, Louis Schatzki

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Trade-Offs Between Entanglement and Communication.

Srinivasan Arunachalam, Uma Girish

Proceedings of the 38th Computational Complexity Conference, 2023

2022

Simpler (classical) and faster (quantum) algorithms for Gibbs partition functions.

Srinivasan Arunachalam, Vojtech Havlícek, Giacomo Nannicini, Kristan Temme, Pawel Wocjan

Quantum, September, 2022

Reliability-Based Collapse Assessment of Wind-Excited Steel Structures within Performance-Based Wind Engineering.

Srinivasan Arunachalam, Seymour M. J. Spence

CoRR, 2022

The Parameterized Complexity of Quantum Verification.

Srinivasan Arunachalam, Sergey Bravyi, Chinmay Nirkhe, Bryan O'Gorman

CoRR, 2022

The Parametrized Complexity of Quantum Verification.

Srinivasan Arunachalam, Sergey Bravyi, Chinmay Nirkhe, Bryan O'Gorman

Proceedings of the 17th Conference on the Theory of Quantum Computation, 2022

Positive spectrahedra: invariance principles and pseudorandom generators.

Srinivasan Arunachalam, Penghui Yao

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021

Two new results about quantum exact learning.

Srinivasan Arunachalam, Sourav Chakraborty, Troy Lee, Manaswi Paraashar, Ronald de Wolf

Quantum, 2021

Positive spectrahedrons: Geometric properties, Invariance principles and Pseudorandom generators.

Srinivasan Arunachalam, Penghui Yao

Electron. Colloquium Comput. Complex., 2021

On the Gaussian surface area of spectrahedra.

Srinivasan Arunachalam, Oded Regev, Penghui Yao

Electron. Colloquium Comput. Complex., 2021

Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet case.

Srinivasan Arunachalam, João F. Doriguello

Electron. Colloquium Comput. Complex., 2021

Private learning implies quantum stability.

Yihui Quek, Srinivasan Arunachalam, John A. Smolin

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Communication Memento: Memoryless Communication Complexity.

Srinivasan Arunachalam, Supartha Podder

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2020

Quantum learning algorithms imply circuit lower bounds.

Srinivasan Arunachalam, Alex Bredariol Grilo, Tom Gur, Igor C. Oliveira, Aarthi Sundaram

Electron. Colloquium Comput. Complex., 2020

A rigorous and robust quantum speed-up in supervised machine learning.

Yunchao Liu, Srinivasan Arunachalam, Kristan Temme

CoRR, 2020

Quantum statistical query learning.

Srinivasan Arunachalam, Alex B. Grilo, Henry Yuen

CoRR, 2020

The Asymptotic Induced Matching Number of Hypergraphs: Balanced Binary Strings.

Srinivasan Arunachalam, Péter Vrana, Jeroen Zuiddam

Electron. J. Comb., 2020

Quantum Coupon Collector.

Srinivasan Arunachalam, Aleksandrs Belovs, Andrew M. Childs, Robin Kothari, Ansis Rosmanis, Ronald de Wolf

Proceedings of the 15th Conference on the Theory of Quantum Computation, 2020

Quantum Boosting.

Srinivasan Arunachalam, Reevu Maity

Proceedings of the 37th International Conference on Machine Learning, 2020

Sample-efficient learning of quantum many-body systems.

Anurag Anshu, Srinivasan Arunachalam, Tomotaka Kuwahara, Mehdi Soleimanifar

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Quantum Query Algorithms Are Completely Bounded Forms.

Srinivasan Arunachalam, Jop Briët, Carlos Palazuelos

SIAM J. Comput., 2019

Quantum hardness of learning shallow classical circuits.

Srinivasan Arunachalam, Alex Bredariol Grilo, Aarthi Sundaram

Electron. Colloquium Comput. Complex., 2019

Optimizing quantum optimization algorithms via faster quantum gradient computation.

András Gilyén, Srinivasan Arunachalam, Nathan Wiebe

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

Optimal Quantum Sample Complexity of Learning Algorithms.

Srinivasan Arunachalam, Ronald de Wolf

J. Mach. Learn. Res., 2018

Improved bounds on Fourier entropy and Min-entropy.

Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký, Nitin Saurabh, Ronald de Wolf

Electron. Colloquium Comput. Complex., 2018

Two new results about quantum exact learning.

Srinivasan Arunachalam, Sourav Chakraborty, Troy Lee, Ronald de Wolf

CoRR, 2018

2017

Guest Column: A Survey of Quantum Learning Theory.

Srinivasan Arunachalam, Ronald de Wolf

SIGACT News, 2017

Optimizing the number of gates in quantum search.

Srinivasan Arunachalam, Ronald de Wolf

Quantum Inf. Comput., 2017

A Survey of Quantum Learning Theory.

Srinivasan Arunachalam, Ronald de Wolf

CoRR, 2017

Quantum Hedging in Two-Round Prover-Verifier Interactions.

Srinivasan Arunachalam, Abel Molina, Vincent Russo

Proceedings of the 12th Conference on the Theory of Quantum Computation, 2017

2016

Hard satisfiable 3-SAT instances via autocorrelation.

Srinivasan Arunachalam, Ilias S. Kotsireas

J. Satisf. Boolean Model. Comput., 2016

2015

Is absolute separability determined by the partial transpose?

Srinivasan Arunachalam, Nathaniel Johnston, Vincent Russo

Quantum Inf. Comput., 2015

On the Robustness of Bucket Brigade Quantum RAM.

Srinivasan Arunachalam, Vlad Gheorghiu, Tomas Jochym-O'Connor, Michele Mosca, Priyaa Varshinee Srinivasan

Proceedings of the 10th Conference on the Theory of Quantum Computation, 2015