default search action
Srinivasan Arunachalam
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c20]Srinivasan Arunachalam, Arkopal Dutt, Francisco Escudero Gutiérrez, Carlos Palazuelos:
Learning Low-Degree Quantum Objects. ICALP 2024: 13:1-13:19 - [i39]Srinivasan Arunachalam, Arkopal Dutt, Francisco Escudero Gutiérrez, Carlos Palazuelos:
Learning low-degree quantum objects. CoRR abs/2405.10933 (2024) - [i38]Srinivasan Arunachalam, Arkopal Dutt:
Tolerant testing stabilizer states. CoRR abs/2408.06289 (2024) - 2023
- [c19]Srinivasan Arunachalam, Uma Girish:
Trade-Offs Between Entanglement and Communication. CCC 2023: 25:1-25:23 - [c18]Srinivasan Arunachalam, Vojtech Havlícek, Louis Schatzki:
On the Role of Entanglement and Statistics in Learning. NeurIPS 2023 - [c17]Srinivasan Arunachalam, Sergey Bravyi, Arkopal Dutt, Theodore J. Yoder:
Optimal Algorithms for Learning Quantum Phase States. TQC 2023: 3:1-3:24 - [i37]Srinivasan Arunachalam, João F. Doriguello, Rahul Jain:
A note on the partition bound for one-way classical communication complexity. CoRR abs/2302.10431 (2023) - [i36]Thays Guerra Araujo Duarte, Srinivasan Arunachalam, Arthriya Subgranon, Seymour M. J. Spence:
Uncertainty Quantification of a Wind Tunnel-Informed Stochastic Wind Load Model for Wind Engineering Applications. CoRR abs/2305.06253 (2023) - [i35]Srinivasan Arunachalam, Seymour M. J. Spence:
Generalized Stratified Sampling for Efficient Reliability Assessment of Structures Against Natural Hazards. CoRR abs/2305.06338 (2023) - [i34]Anurag Anshu, Srinivasan Arunachalam:
A survey on the complexity of learning quantum states. CoRR abs/2305.20069 (2023) - [i33]Srinivasan Arunachalam, Uma Girish:
Trade-offs between Entanglement and Communication. CoRR abs/2306.01233 (2023) - [i32]Srinivasan Arunachalam, Vojtech Havlícek, Louis Schatzki:
On the Role of Entanglement and Statistics in Learning. CoRR abs/2306.03161 (2023) - [i31]Srinivasan Arunachalam, Uma Girish, Noam Lifshitz:
One Clean Qubit Suffices for Quantum Communication Advantage. CoRR abs/2310.02406 (2023) - [i30]Srinivasan Arunachalam, Uma Girish, Noam Lifshitz:
One Clean Qubit Suffices for Quantum Communication Advantage. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j11]Srinivasan Arunachalam, Vojtech Havlícek, Giacomo Nannicini, Kristan Temme, Pawel Wocjan:
Simpler (classical) and faster (quantum) algorithms for Gibbs partition functions. Quantum 6: 789 (2022) - [c16]Srinivasan Arunachalam, Penghui Yao:
Positive spectrahedra: invariance principles and pseudorandom generators. STOC 2022: 208-221 - [c15]Srinivasan Arunachalam, Sergey Bravyi, Chinmay Nirkhe, Bryan O'Gorman:
The Parametrized Complexity of Quantum Verification. TQC 2022: 3:1-3:18 - [i29]Srinivasan Arunachalam, Sergey Bravyi, Chinmay Nirkhe, Bryan O'Gorman:
The Parameterized Complexity of Quantum Verification. CoRR abs/2202.08119 (2022) - [i28]Srinivasan Arunachalam, Seymour M. J. Spence:
Reliability-Based Collapse Assessment of Wind-Excited Steel Structures within Performance-Based Wind Engineering. CoRR abs/2207.14156 (2022) - [i27]Srinivasan Arunachalam, Sergey Bravyi, Arkopal Dutt, Theodore J. Yoder:
Optimal algorithms for learning quantum phase states. CoRR abs/2208.07851 (2022) - 2021
- [j10]Srinivasan Arunachalam, Sourav Chakraborty, Troy Lee, Manaswi Paraashar, Ronald de Wolf:
Two new results about quantum exact learning. Quantum 5: 587 (2021) - [j9]Srinivasan Arunachalam, Alex Bredariol Grilo, Aarthi Sundaram:
Quantum Hardness of Learning Shallow Classical Circuits. SIAM J. Comput. 50(3): 972-1013 (2021) - [j8]Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký, Nitin Saurabh, Ronald de Wolf:
Improved Bounds on Fourier Entropy and Min-entropy. ACM Trans. Comput. Theory 13(4): 22:1-22:40 (2021) - [c14]Srinivasan Arunachalam, Alex B. Grilo, Tom Gur, Igor C. Oliveira, Aarthi Sundaram:
Quantum learning algorithms imply circuit lower bounds. FOCS 2021: 562-573 - [c13]Srinivasan Arunachalam, Supartha Podder:
Communication Memento: Memoryless Communication Complexity. ITCS 2021: 61:1-61:20 - [c12]Yihui Quek, Srinivasan Arunachalam, John A. Smolin:
Private learning implies quantum stability. NeurIPS 2021: 20503-20515 - [c11]Srinivasan Arunachalam, Vojtech Havlícek, Giacomo Nannicini, Kristan Temme, Pawel Wocjan:
Simpler (Classical) and Faster (Quantum) Algorithms for Gibbs Partition Functions. QCE 2021: 112-122 - [i26]Srinivasan Arunachalam, Penghui Yao:
Positive spectrahedrons: Geometric properties, Invariance principles and Pseudorandom generators. CoRR abs/2101.08141 (2021) - [i25]Srinivasan Arunachalam, Yihui Quek, John A. Smolin:
Private learning implies quantum stability. CoRR abs/2102.07171 (2021) - [i24]Srinivasan Arunachalam, João F. Doriguello:
Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet case. CoRR abs/2109.02600 (2021) - [i23]Srinivasan Arunachalam, João F. Doriguello:
Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet case. Electron. Colloquium Comput. Complex. TR21 (2021) - [i22]Srinivasan Arunachalam, Oded Regev, Penghui Yao:
On the Gaussian surface area of spectrahedra. Electron. Colloquium Comput. Complex. TR21 (2021) - [i21]Srinivasan Arunachalam, Penghui Yao:
Positive spectrahedrons: Geometric properties, Invariance principles and Pseudorandom generators. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j7]Srinivasan Arunachalam, Péter Vrana, Jeroen Zuiddam:
The Asymptotic Induced Matching Number of Hypergraphs: Balanced Binary Strings. Electron. J. Comb. 27(3): 3 (2020) - [c10]Anurag Anshu, Srinivasan Arunachalam, Tomotaka Kuwahara, Mehdi Soleimanifar:
Sample-efficient learning of quantum many-body systems. FOCS 2020: 685-691 - [c9]Srinivasan Arunachalam, Reevu Maity:
Quantum Boosting. ICML 2020: 377-387 - [c8]Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký, Nitin Saurabh, Ronald de Wolf:
Improved Bounds on Fourier Entropy and Min-Entropy. STACS 2020: 45:1-45:19 - [c7]Srinivasan Arunachalam, Aleksandrs Belovs, Andrew M. Childs, Robin Kothari, Ansis Rosmanis, Ronald de Wolf:
Quantum Coupon Collector. TQC 2020: 10:1-10:17 - [i20]Srinivasan Arunachalam, Reevu Maity:
Quantum Boosting. CoRR abs/2002.05056 (2020) - [i19]Srinivasan Arunachalam, Aleksandrs Belovs, Andrew M. Childs, Robin Kothari, Ansis Rosmanis, Ronald de Wolf:
Quantum Coupon Collector. CoRR abs/2002.07688 (2020) - [i18]Srinivasan Arunachalam, Alex B. Grilo, Henry Yuen:
Quantum statistical query learning. CoRR abs/2002.08240 (2020) - [i17]Anurag Anshu, Srinivasan Arunachalam, Tomotaka Kuwahara, Mehdi Soleimanifar:
Sample-efficient learning of quantum many-body systems. CoRR abs/2004.07266 (2020) - [i16]Srinivasan Arunachalam, Supartha Podder:
Communication memento: Memoryless communication complexity. CoRR abs/2005.04068 (2020) - [i15]Yunchao Liu, Srinivasan Arunachalam, Kristan Temme:
A rigorous and robust quantum speed-up in supervised machine learning. CoRR abs/2010.02174 (2020) - [i14]Srinivasan Arunachalam, Alex B. Grilo, Tom Gur, Igor C. Oliveira, Aarthi Sundaram:
Quantum learning algorithms imply circuit lower bounds. CoRR abs/2012.01920 (2020) - [i13]Srinivasan Arunachalam, Alex Bredariol Grilo, Tom Gur, Igor C. Oliveira, Aarthi Sundaram:
Quantum learning algorithms imply circuit lower bounds. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j6]Srinivasan Arunachalam, Jop Briët, Carlos Palazuelos:
Quantum Query Algorithms Are Completely Bounded Forms. SIAM J. Comput. 48(3): 903-925 (2019) - [c6]Srinivasan Arunachalam, Sourav Chakraborty, Troy Lee, Manaswi Paraashar, Ronald de Wolf:
Two New Results About Quantum Exact Learning. ICALP 2019: 16:1-16:15 - [c5]András Gilyén, Srinivasan Arunachalam, Nathan Wiebe:
Optimizing quantum optimization algorithms via faster quantum gradient computation. SODA 2019: 1425-1444 - [i12]Srinivasan Arunachalam, Alex Bredariol Grilo, Aarthi Sundaram:
Quantum hardness of learning shallow classical circuits. CoRR abs/1903.02840 (2019) - [i11]Srinivasan Arunachalam, Péter Vrana, Jeroen Zuiddam:
The asymptotic induced matching number of hypergraphs: balanced binary strings. CoRR abs/1905.03148 (2019) - [i10]Srinivasan Arunachalam, Alex Bredariol Grilo, Aarthi Sundaram:
Quantum hardness of learning shallow classical circuits. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j5]Srinivasan Arunachalam, Ronald de Wolf:
Optimal Quantum Sample Complexity of Learning Algorithms. J. Mach. Learn. Res. 19: 71:1-71:36 (2018) - [c4]Srinivasan Arunachalam, Jop Briët, Carlos Palazuelos:
Quantum Query Algorithms are Completely Bounded Forms. ITCS 2018: 3:1-3:21 - [i9]Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký, Nitin Saurabh, Ronald de Wolf:
Improved bounds on Fourier entropy and Min-entropy. CoRR abs/1809.09819 (2018) - [i8]Srinivasan Arunachalam, Sourav Chakraborty, Troy Lee, Ronald de Wolf:
Two new results about quantum exact learning. CoRR abs/1810.00481 (2018) - [i7]Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký, Nitin Saurabh, Ronald de Wolf:
Improved bounds on Fourier entropy and Min-entropy. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j4]Srinivasan Arunachalam, Ronald de Wolf:
Optimizing the number of gates in quantum search. Quantum Inf. Comput. 17(3&4): 251-261 (2017) - [j3]Srinivasan Arunachalam, Ronald de Wolf:
Guest Column: A Survey of Quantum Learning Theory. SIGACT News 48(2): 41-67 (2017) - [c3]Srinivasan Arunachalam, Ronald de Wolf:
Optimal Quantum Sample Complexity of Learning Algorithms. CCC 2017: 25:1-25:31 - [c2]Srinivasan Arunachalam, Abel Molina, Vincent Russo:
Quantum Hedging in Two-Round Prover-Verifier Interactions. TQC 2017: 5:1-5:30 - [i6]Srinivasan Arunachalam, Ronald de Wolf:
A Survey of Quantum Learning Theory. CoRR abs/1701.06806 (2017) - [i5]András Gilyén, Srinivasan Arunachalam, Nathan Wiebe:
Optimizing quantum optimization algorithms via faster quantum gradient computation. CoRR abs/1711.00465 (2017) - [i4]Srinivasan Arunachalam, Jop Briët, Carlos Palazuelos:
Quantum Query Algorithms are Completely Bounded Forms. CoRR abs/1711.07285 (2017) - 2016
- [j2]Srinivasan Arunachalam, Ilias S. Kotsireas:
Hard satisfiable 3-SAT instances via autocorrelation. J. Satisf. Boolean Model. Comput. 10(1): 11-22 (2016) - [i3]Srinivasan Arunachalam, Ronald de Wolf:
Optimal Quantum Sample Complexity of Learning Algorithms. CoRR abs/1607.00932 (2016) - 2015
- [j1]Srinivasan Arunachalam, Nathaniel Johnston, Vincent Russo:
Is absolute separability determined by the partial transpose? Quantum Inf. Comput. 15(7&8): 694-720 (2015) - [c1]Srinivasan Arunachalam, Vlad Gheorghiu, Tomas Jochym-O'Connor, Michele Mosca, Priyaa Varshinee Srinivasan:
On the Robustness of Bucket Brigade Quantum RAM. TQC 2015: 226-244 - [i2]Srinivasan Arunachalam, Ronald de Wolf:
Optimizing the Number of Gates in Quantum Search. CoRR abs/1512.07550 (2015) - 2013
- [i1]Srinivasan Arunachalam, Abel Molina, Vincent Russo:
Quantum hedging in two-round prover-verifier interactions. CoRR abs/1310.7954 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint