| 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 | 325 | 2019 |
| Quantum computer systems for scientific discovery Y Alexeev, D Bacon, KR Brown, R Calderbank, LD Carr, FT Chong, ... PRX quantum 2 (1), 017001, 2021 | 305 | 2021 |
| Efficient classical simulation of noisy random quantum circuits in one dimension K Noh, L Jiang, B Fefferman Quantum 4, 318, 2020 | 111 | 2020 |
| The power of unentanglement S Aaronson, S Beigi, A Drucker, B Fefferman, P Shor 2008 23rd Annual IEEE Conference on Computational Complexity, 223-236, 2008 | 97 | 2008 |
| Quantum computational advantage via high-dimensional Gaussian boson sampling A Deshpande, A Mehta, T Vincent, N Quesada, M Hinsche, M Ioannou, ... Science advances 8 (1), eabi7894, 2022 | 83 | 2022 |
| 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 | 83 | 2019 |
| Quantum supremacy and the complexity of random circuit sampling A Bouland, B Fefferman, C Nirkhe, U Vazirani arXiv preprint arXiv:1803.04402, 2018 | 70 | 2018 |
| Dynamical phase transitions in sampling complexity A Deshpande, B Fefferman, MC Tran, M Foss-Feig, AV Gorshkov Physical review letters 121 (3), 030501, 2018 | 62 | 2018 |
| 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 | 57 | 2022 |
| Computational security of quantum encryption G Alagic, A Broadbent, B Fefferman, T Gagliardoni, C Schaffner, ... Information Theoretic Security: 9th International Conference, ICITS 2016 …, 2016 | 57 | 2016 |
| Benchmarking near-term quantum computers via random circuit sampling Y Liu, M Otten, R Bassirianjahromi, L Jiang, B Fefferman arXiv preprint arXiv:2105.05232, 2021 | 53 | 2021 |
| On beating the hybrid argument B Fefferman, R Shaltiel, C Umans, E Viola Proceedings of the 3rd Innovations in Theoretical Computer Science …, 2012 | 52 | 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 | 50 | 2020 |
| The power of quantum fourier sampling B Fefferman, C Umans arXiv preprint arXiv:1507.05592, 2015 | 49 | 2015 |
| Tight bounds on the convergence of noisy random circuits to the uniform distribution A Deshpande, P Niroula, O Shtanko, AV Gorshkov, B Fefferman, ... PRX Quantum 3 (4), 040329, 2022 | 46 | 2022 |
| Classical simulation of lossy boson sampling using matrix product operators C Oh, K Noh, B Fefferman, L Jiang Physical Review A 104 (2), 022407, 2021 | 44 | 2021 |
| A complete characterization of unitary quantum space B Fefferman, CYY Lin arXiv preprint arXiv:1604.01384, 2016 | 37 | 2016 |
| On quantum obfuscation G Alagic, B Fefferman arXiv preprint arXiv:1602.01771, 2016 | 36 | 2016 |
| Complexity phase diagram for interacting and long-range bosonic Hamiltonians N Maskara, A Deshpande, A Ehrenberg, MC Tran, B Fefferman, ... Physical Review Letters 129 (15), 150604, 2022 | 33 | 2022 |
| The learnability of Pauli noise S Chen, Y Liu, M Otten, A Seif, B Fefferman, L Jiang Nature Communications 14 (1), 52, 2023 | 31 | 2023 |
