Adam Bouland

Available identifiers

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q5889073	2023-04-26	Paper
Computational Pseudorandomness, the Wormhole Growth Paradox, and Constraints on the AdS/CFT Duality (Abstract)	2023-02-03	Paper
Quantum Supremacy and the Complexity of Random Circuit Sampling	2022-07-18	Paper
Efficient Universal Quantum Compilation: An Inverse-free Solovay-Kitaev Algorithm	2021-12-03	Paper
https://portal.mardi4nfdi.de/entity/Q5121909	2020-09-22	Paper
On the Power of Statistical Zero Knowledge	2020-08-25	Paper
Rescuing complementarity with little drama	2018-06-12	Paper
On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems	2018-03-21	Paper
Trading inverses for an irrep in the Solovay-Kitaev theorem	2017-12-28	Paper
Complexity classification of two-qubit commuting Hamiltonians	2017-10-10	Paper
The computational complexity of ball permutations	2017-08-17	Paper
The space ``just above BQP	2016-04-15	Paper
On Tractable Parameterizations of Graph Isomorphism	2013-01-07	Paper
Efficient Unitary T-designs from Random Sums	N/A	Paper
Efficient unitary designs and pseudorandom unitaries from permutations	N/A	Paper

This page was built for person: Adam Bouland