11 citations · 25 across the 6 of their papers we have counts for
6 papers
A quantum spectral method for simulating stochastic processes, with applications to Monte Carlo
Adam Bouland, Aditi Dandapani, Anupam Prakash
Stochastic processes play a fundamental role in physics, mathematics, engineering and finance. One potential application of quantum computation is to better approximate properties…
Quantum Speedups for Zero-Sum Games via Improved Dynamic Gibbs Sampling
Adam Bouland, Yosheb Getachew, Yujia Jin +2
We give a quantum algorithm for computing an -approximate Nash equilibrium of a zero-sum game in a payoff matrix with bounded entries. Given a standard quantum orac…
Efficient Universal Quantum Compilation: An Inverse-free Solovay-Kitaev Algorithm
Adam Bouland, Tudor Giurgica-Tiron
The Solovay-Kitaev algorithm is a fundamental result in quantum computation. It gives an algorithm for efficiently compiling arbitrary unitaries using universal gate sets: any unit…
The Computational Complexity of Ball Permutations
Scott Aaronson, Adam Bouland, Greg Kuperberg +1
Inspired by connections to two dimensional quantum theory, we define several models of computation based on permuting distinguishable particles (which we call balls), and character…
Rescuing Complementarity With Little Drama
Ning Bao, Adam Bouland, Aidan Chatwin-Davies +2
The AMPS paradox challenges black hole complementarity by apparently constructing a way for an observer to bring information from the outside of the black hole into its interior if…
The space "just above" BQP
Scott Aaronson, Adam Bouland, Joseph Fitzsimons +1
We explore the space "just above" BQP by defining a complexity class PDQP (Product Dynamical Quantum Polynomial time) which is larger than BQP but does not contain NP relative to a…