67 citations · 79 across the 4 of their papers we have counts for
6 papers
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…
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…
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…
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…
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…