67 citations · 111 across the 12 of their papers we have counts for
16 papers
How to build a campfire? Participatory modelling with justice
Nynke van Uffelen, Sander ten Caat, Aarthi Sundaram +4
Energy transition decision-making is pervaded by deep uncertainties. Computational models are helpful in addressing such uncertainties, as they can give insight into techno-economi…
End-to-End Quantum Simulation of a Chemical System
Wim van Dam, Hongbin Liu, Guang Hao Low +6
We demonstrate the first end-to-end integration of high-performance computing (HPC), reliable quantum computing, and AI in a case study on catalytic reactions producing chiral mole…
Unified Architecture for Quantum Lookup Tables
Shuchen Zhu, Aarthi Sundaram, Guang Hao Low
Quantum access to arbitrary classical data encoded in unitary black-box oracles underlies interesting data-intensive quantum algorithms, such as machine learning or electronic stru…
Assessing requirements to scale to practical quantum advantage
Michael E. Beverland, Prakash Murali, Matthias Troyer +7
While quantum computers promise to solve some scientifically and commercially valuable problems thought intractable for classical machines, delivering on this promise will require…
Quantum divide and conquer
Andrew M. Childs, Robin Kothari, Matt Kovacs-Deak +2
The divide-and-conquer framework, used extensively in classical algorithm design, recursively breaks a problem of size into smaller subproblems (say, copies of size e…
Quantum Algorithms for Reinforcement Learning with a Generative Model
Daochen Wang, Aarthi Sundaram, Robin Kothari +2
Reinforcement learning studies how an agent should interact with an environment to maximize its cumulative reward. A standard way to study this question abstractly is to ask how ma…
Gottesman Types for Quantum Programs
Robert Rand, Aarthi Sundaram, Kartik Singhal +1
The Heisenberg representation of quantum operators provides a powerful technique for reasoning about quantum circuits, albeit those restricted to the common (non-universal) Cliffor…
Secure Software Leasing Without Assumptions
Anne Broadbent, Stacey Jeffery, Sébastien Lord +2
Quantum cryptography is known for enabling functionalities that are unattainable using classical information alone. Recently, Secure Software Leasing (SSL) has emerged as one of th…
Hoare meets Heisenberg: A Lightweight Logic for Quantum Programs
Aarthi Sundaram, Robert Rand, Kartik Singhal +2
We show that Gottesman's (1998) semantics for Clifford circuits based on the Heisenberg representation gives rise to a lightweight Hoare-like logic for efficiently characterizing a…
Quantum learning algorithms imply circuit lower bounds
Srinivasan Arunachalam, Alex B. Grilo, Tom Gur +2
We establish the first general connection between the design of quantum algorithms and circuit lower bounds. Specifically, let be a class of polynomial-size concepts…
Quantum hardness of learning shallow classical circuits
Srinivasan Arunachalam, Alex B. Grilo, Aarthi Sundaram
In this paper we study the quantum learnability of constant-depth classical circuits under the uniform distribution and in the distribution-independent framework of PAC learning. I…
Mathematical methods for resource-based type theories
Aarthi Sundaram, Brad Lackey
With the wide range of quantum programming languages on offer now, efficient program verification and type checking for these languages presents a challenge -- especially when clas…
Quantum generalizations of the polynomial hierarchy with applications to QMA(2)
Sevag Gharibian, Miklos Santha, Jamie Sikora +2
The polynomial-time hierarchy () has proven to be a powerful tool for providing separations in computational complexity theory (modulo standard conjectures such as $\m…
On the complexity of probabilistic trials for hidden satisfiability problems
Itai Arad, Adam Bouland, Daniel Grier +3
What is the minimum amount of information and time needed to solve 2SAT? When the instance is known, it can be solved in polynomial time, but is this also possible without knowing…
Linear time algorithm for quantum 2SAT
Itai Arad, Miklos Santha, Aarthi Sundaram +1
A canonical result about satisfiability theory is that the 2-SAT problem can be solved in linear time, despite the NP-hardness of the 3-SAT problem. In the quantum 2-SAT problem, w…
On the Complexity of Trial and Error for Constraint Satisfaction Problems
Gábor Ivanyos, Raghav Kulkarni, Youming Qiao +2
In 2013 Bei, Chen and Zhang introduced a trial and error model of computing, and applied to some constraint satisfaction problems. In this model the input is hidden by an oracle wh…