Urmăriți
Adam Bouland
Adam Bouland
Stanford University
Adresă de e-mail confirmată pe stanford.edu - Pagina de pornire
Titlu
Citat de
Citat de
Anul
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
403*2019
Prospects and challenges of quantum finance
A Bouland, W van Dam, H Joorati, I Kerenidis, A Prakash
arXiv preprint arXiv:2011.06492, 2020
1072020
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
98*2019
-epistemic theories: The role of symmetry
S Aaronson, A Bouland, L Chua, G Lowther
Physical Review A—Atomic, Molecular, and Optical Physics 88 (3), 032111, 2013
722013
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
612022
Complexity classification of conjugated Clifford circuits
A Bouland, JF Fitzsimons, DE Koh
arXiv preprint arXiv:1709.01805, 2017
57*2017
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
532020
Generation of universal linear optics by any beam splitter
A Bouland, S Aaronson
Physical Review A 89 (6), 062316, 2014
532014
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
512019
Quantum pseudoentanglement
S Aaronson, A Bouland, B Fefferman, S Ghosh, U Vazirani, C Zhang, ...
arXiv preprint arXiv:2211.00747, 2022
492022
On tractable parameterizations of graph isomorphism
A Bouland, A Dawar, E Kopczyński
Parameterized and Exact Computation: 7th International Symposium, IPEC 2012 …, 2012
352012
The space" just above" bqp
S Aaronson, A Bouland, J Fitzsimons, M Lee
Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016
332016
Grover search and the no-signaling principle
N Bao, A Bouland, SP Jordan
Physical review letters 117 (12), 120501, 2016
312016
Complexity classification of two-qubit commuting Hamiltonians
A Bouland, L Mančinska, X Zhang
arXiv preprint arXiv:1602.04145, 2016
262016
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
242018
Efficient unitary designs and pseudorandom unitaries from permutations
CF Chen, A Bouland, FGSL Brandão, J Docter, P Hayden, M Xu
arXiv preprint arXiv:2404.16751, 2024
212024
Efficient universal quantum compilation: An inverse-free Solovay-Kitaev algorithm
A Bouland, T Giurgica-Tiron
arXiv preprint arXiv:2112.02040, 2021
202021
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
192017
Quantum speedups for zero-sum games via improved dynamic Gibbs sampling
A Bouland, YM Getachew, Y Jin, A Sidford, K Tian
International Conference on Machine Learning, 2932-2952, 2023
182023
Trading inverses for an irrep in the Solovay-Kitaev theorem
A Bouland, M Ozols
arXiv preprint arXiv:1712.09798, 2017
142017
Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.
Articole 1–20