Aarthi Sundaram

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