Aarthi Sundaram

Publication Activity (10 Years)

Years Active: 2014-2022
Publications (10 Years): 23

Top Topics

Learning Algorithm

Polynomial Hierarchy

Constraint Satisfaction Problems

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Andrew M. Childs, Robin Kothari, Matt Kovacs-Deak, Aarthi Sundaram, Daochen Wang
Quantum divide and conquer. CoRR (2022)
Aarthi Sundaram, Chitrakala Sakthivel
Object detection and estimation: A hybrid image segmentation technique using convolutional neural network model. Concurr. Comput. Pract. Exp. 34 (21) (2022)
Srinivasan Arunachalam, Alex B. Grilo, Tom Gur, Igor Carboni Oliveira, Aarthi Sundaram
Quantum learning algorithms imply circuit lower bounds. FOCS (2022)
Michael E. Beverland, Prakash Murali, Matthias Troyer, Krysta M. Svore, Torsten Hoefler, Vadym Kliuchnikov, Guang Hao Low, Mathias Soeken, Aarthi Sundaram, Alexander Vaschillo
Assessing requirements to scale to practical quantum advantage. CoRR (2022)
Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram, Justin Yirka
Quantum generalizations of the polynomial hierarchy with applications to QMA(2). Comput. Complex. 31 (2) (2022)
Srinivasan Arunachalam, Alex B. Grilo, Tom Gur, Igor Carboni Oliveira, Aarthi Sundaram
Quantum learning algorithms imply circuit lower bounds. FOCS (2021)
Srinivasan Arunachalam, Alex Bredariol Grilo, Aarthi Sundaram
Quantum Hardness of Learning Shallow Classical Circuits. SIAM J. Comput. 50 (3) (2021)
Anne Broadbent, Stacey Jeffery, Sébastien Lord, Supartha Podder, Aarthi Sundaram
Secure Software Leasing Without Assumptions. TCC (1) (2021)
Robert Rand, Aarthi Sundaram, Kartik Singhal, Brad Lackey
Static Analysis of Quantum Programs via Gottesman Types. CoRR (2021)
Daochen Wang, Aarthi Sundaram, Robin Kothari, Ashish Kapoor, Martin Roetteler
Quantum Algorithms for Reinforcement Learning with a Generative Model. CoRR (2021)
Daochen Wang, Aarthi Sundaram, Robin Kothari, Ashish Kapoor, Martin Roetteler
Quantum algorithms for reinforcement learning with a generative model. ICML (2021)
Robert Rand, Aarthi Sundaram, Kartik Singhal, Brad Lackey
Gottesman Types for Quantum Programs. QPL (2020)
Srinivasan Arunachalam, Alex Bredariol Grilo, Tom Gur, Igor Carboni Oliveira, Aarthi Sundaram
Quantum learning algorithms imply circuit lower bounds. Electron. Colloquium Comput. Complex. 27 (2020)
Srinivasan Arunachalam, Alex B. Grilo, Tom Gur, Igor Carboni Oliveira, Aarthi Sundaram
Quantum learning algorithms imply circuit lower bounds. CoRR (2020)
Srinivasan Arunachalam, Alex Bredariol Grilo, Aarthi Sundaram
Quantum hardness of learning shallow classical circuits. Electron. Colloquium Comput. Complex. 26 (2019)
Srinivasan Arunachalam, Alex Bredariol Grilo, Aarthi Sundaram
Quantum hardness of learning shallow classical circuits. CoRR (2019)
Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram
On the complexity of trial and error for constraint satisfaction problems. J. Comput. Syst. Sci. 92 (2018)
Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram, Justin Yirka
Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2). MFCS (2018)
Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram, Justin Yirka
Quantum generalizations of the polynomial hierarchy with applications to QMA(2). CoRR (2018)
Itai Arad, Miklos Santha, Aarthi Sundaram, Shengyu Zhang
Linear-Time Algorithm for Quantum 2SAT. Theory Comput. 14 (1) (2018)
Itai Arad, Miklos Santha, Aarthi Sundaram, Shengyu Zhang
Linear Time Algorithm for Quantum 2SAT. ICALP (2016)
Itai Arad, Adam Bouland, Daniel Grier, Miklos Santha, Aarthi Sundaram, Shengyu Zhang
On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems. MFCS (2016)
Itai Arad, Adam Bouland, Daniel Grier, Miklos Santha, Aarthi Sundaram, Shengyu Zhang
On the complexity of probabilistic trials for hidden satisfiability problems. CoRR (2016)
Itai Arad, Miklos Santha, Aarthi Sundaram, Shengyu Zhang
Linear time algorithm for quantum 2SAT. CoRR (2015)
Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram
On the Complexity of Trial and Error for Constraint Satisfaction Problems. ICALP (1) (2014)
Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram
On the complexity of trial and error for constraint satisfaction problems. Electron. Colloquium Comput. Complex. 21 (2014)
Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram
On the Complexity of Trial and Error for Constraint Satisfaction Problems. CoRR (2014)