Aarthi Sundaram was a QuICS Hartree Postdoctoral Fellow in quantum information and computer science from 2017 to 2019. Her research interests span classical and quantum complexity theory, including quantum algorithms, the trial and error model of computation, Hamiltonian Complexity and nonlocal games. Presently, Sundaram seeks to understand the minimum amount of input information needed to efficiently solve classical and quantum constraint satisfaction problems by analyzing their complexity in the trial and error model of computation. Additionally, she is interested in developing robust approximation algorithms for quantum satisfiability and explore ideas pertaining to a quantum-classical polynomial hierarcy. Sundaram received her doctorate in computer science from the National University of Singapore in 2017. She is currently employed at Microsoft.
