Adam Bouland
Cited by
Cited by
On the complexity and verification of quantum random circuit sampling
A Bouland, B Fefferman, C Nirkhe, U Vazirani
Nature Physics 15 (2), 159-163, 2019
ψ-epistemic theories: The role of symmetry
S Aaronson, A Bouland, L Chua, G Lowther
Physical Review A 88 (3), 032111, 2013
Prospects and challenges of quantum finance
A Bouland, W van Dam, H Joorati, I Kerenidis, A Prakash
arXiv preprint arXiv:2011.06492, 2020
Computational pseudorandomness, the wormhole growth paradox, and constraints on the AdS/CFT duality
A Bouland, B Fefferman, U Vazirani
arXiv preprint arXiv:1910.14646, 2019
Generation of universal linear optics by any beam splitter
A Bouland, S Aaronson
Physical Review A 89 (6), 062316, 2014
Complexity classification of conjugated Clifford circuits
A Bouland, JF Fitzsimons, DE Koh
arXiv preprint arXiv:1709.01805, 2017
On the power of statistical zero knowledge
A Bouland, L Chen, D Holden, J Thaler, PN Vasudevan
SIAM Journal on Computing 49 (4), FOCS17-1-FOCS17-58, 2019
On tractable parameterizations of graph isomorphism
A Bouland, A Dawar, E Kopczyński
Parameterized and Exact Computation: 7th International Symposium, IPEC 2012 …, 2012
Closing gaps of a quantum advantage with short-time hamiltonian dynamics
J Haferkamp, D Hangleiter, A Bouland, B Fefferman, J Eisert, ...
Physical Review Letters 125 (25), 250501, 2020
The space" just above" BQP
S Aaronson, A Bouland, J Fitzsimons, M Lee
Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016
Grover search and the no-signaling principle
N Bao, A Bouland, SP Jordan
Physical review letters 117 (12), 120501, 2016
Noise and the frontier of quantum supremacy
A Bouland, B Fefferman, Z Landau, Y Liu
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
Complexity classification of two-qubit commuting Hamiltonians
A Bouland, L Mančinska, X Zhang
arXiv preprint arXiv:1602.04145, 2016
Classical lower bounds from quantum upper bounds
S Ben-David, A Bouland, A Garg, R Kothari
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
The computational complexity of ball permutations
S Aaronson, A Bouland, G Kuperberg, S Mehraban
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
Trading inverses for an irrep in the Solovay-Kitaev theorem
A Bouland, M Ozols
arXiv preprint arXiv:1712.09798, 2017
Rescuing complementarity with little drama
N Bao, A Bouland, A Chatwin-Davies, J Pollack, H Yuen
Journal of High Energy Physics 2016 (12), 1-21, 2016
Efficient Universal Quantum Compilation: An Inverse-free Solovay-Kitaev Algorithm
A Bouland, T Giurgica-Tiron
arXiv preprint arXiv:2112.02040, 2021
On Certified Randomness from Quantum Advantage Experiments
R Bassirian, A Bouland, B Fefferman, S Gunn, A Tal
arXiv preprint arXiv:2111.14846, 2021
Caching and interpolated likelihoods: accelerating cosmological Monte Carlo Markov chains
A Bouland, R Easther, K Rosenfeld
Journal of Cosmology and Astroparticle Physics 2011 (05), 016, 2011
The system can't perform the operation now. Try again later.
Articles 1–20