Adam Bouland

Cited by

	All	Since 2019
Citations	1285	1098
h-index	18	16
i10-index	22	21

320

160

240

2013201420152016201720182019202020212022202320245 15 16 29 52 57 72 105 166 183 252 316

Public access

View all

11 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Bill FeffermanUniversity of ChicagoVerified email at uchicago.edu
Joseph FitzsimonsHorizon Quantum ComputingVerified email at horizonquantum.com
Lijie ChenUC BerkeleyVerified email at berkeley.edu
Dax Enshan KohInstitute of High Performance ComputingVerified email at mit.edu
Soumik GhoshUniversity of ChicagoVerified email at uwaterloo.ca
Ning BaoNortheastern University/Brookhaven National LabVerified email at northeastern.edu
Chenyi ZhangStanford UniversityVerified email at stanford.edu
Justin ThalerGeorgetown UniversityVerified email at georgetown.edu
Dhiraj HoldenGraduate Student, MITVerified email at mit.edu
Prashant Nalini VasudevanUniversity of California BerkeleyVerified email at berkeley.edu
Patrick HaydenProfessor of Physics, Stanford UniversityVerified email at stanford.edu
Michelle XuStanford UniversityVerified email at stanford.edu
Chi-Fang (Anthony) ChenUC BerkeleyVerified email at berkeley.edu
Iordanis KerenidisCNRS and Quantum SignalsVerified email at irif.fr
Wim van DamMicrosoftVerified email at microsoft.com
Fernando BrandaoAWS and CaltechVerified email at caltech.edu
Lynn ChuaGoogleVerified email at google.com
Yunchao LiuHQI Postdoctoral Fellow, Harvard UniversityVerified email at g.harvard.edu
Dominik HangleiterSimons Institute for the Theory of Computing, UC BerkeleyVerified email at berkeley.edu
Jens EisertProfessor of Quantum Physics at Freie Universität Berlin, Fraunhofer HHI and Helmholtz Center BerlinVerified email at physik.fu-berlin.de

Adam Bouland

Stanford University

Verified email at stanford.edu - Homepage

Quantum Computing Theoretical Computer Science


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
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	394*	2019
Prospects and challenges of quantum finance A Bouland, W van Dam, H Joorati, I Kerenidis, A Prakash arXiv preprint arXiv:2011.06492, 2020	102	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	95*	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	71	2013
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	60	2022
Complexity classification of conjugated Clifford circuits A Bouland, JF Fitzsimons, DE Koh arXiv preprint arXiv:1709.01805, 2017	55*	2017
Generation of universal linear optics by any beam splitter A Bouland, S Aaronson Physical Review A 89 (6), 062316, 2014	54	2014
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	52	2020
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	50	2019
Quantum pseudoentanglement S Aaronson, A Bouland, B Fefferman, S Ghosh, U Vazirani, C Zhang, ... arXiv preprint arXiv:2211.00747, 2022	39*	2022
On tractable parameterizations of graph isomorphism A Bouland, A Dawar, E Kopczyński Parameterized and Exact Computation: 7th International Symposium, IPEC 2012 …, 2012	34	2012
The space" just above" bqp S Aaronson, A Bouland, J Fitzsimons, M Lee Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016	32	2016
Grover search and the no-signaling principle N Bao, A Bouland, SP Jordan Physical review letters 117 (12), 120501, 2016	31	2016
Complexity classification of two-qubit commuting hamiltonians A Bouland, L Mančinska, X Zhang arXiv preprint arXiv:1602.04145, 2016	26	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	23	2018
Efficient universal quantum compilation: An inverse-free Solovay-Kitaev algorithm A Bouland, T Giurgica-Tiron arXiv preprint arXiv:2112.02040, 2021	19	2021
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	19	2017
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	18	2024
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	17	2023
Trading inverses for an irrep in the Solovay-Kitaev theorem A Bouland, M Ozols arXiv preprint arXiv:1712.09798, 2017	15	2017

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors