The following pages link to Adam Bouland (Q1636613):
Displayed 13 items.
- Rescuing complementarity with little drama (Q1636615) (← links)
- The Space "Just Above" BQP (Q2800575) (← links)
- On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems (Q4608570) (← links)
- On Tractable Parameterizations of Graph Isomorphism (Q4899255) (← links)
- The computational complexity of ball permutations (Q4977982) (← links)
- Quantum Supremacy and the Complexity of Random Circuit Sampling (Q5090387) (← links)
- On the Power of Statistical Zero Knowledge (Q5117376) (← links)
- (Q5121909) (← links)
- Complexity classification of two-qubit commuting Hamiltonians (Q5368762) (← links)
- Computational Pseudorandomness, the Wormhole Growth Paradox, and Constraints on the AdS/CFT Duality (Abstract) (Q5875769) (← links)
- (Q5889073) (← links)
- Trading inverses for an irrep in the Solovay-Kitaev theorem (Q6295795) (← links)
- Efficient Universal Quantum Compilation: An Inverse-free Solovay-Kitaev Algorithm (Q6384760) (← links)