Bill Fefferman
Bill Fefferman
Verified email at uchicago.edu - Homepage
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
862019
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
742008
Quantum supremacy and the complexity of random circuit sampling
A Bouland, B Fefferman, C Nirkhe, U Vazirani
arXiv preprint arXiv:1803.04402, 2018
422018
Quantum computer systems for scientific discovery
Y Alexeev, D Bacon, KR Brown, R Calderbank, LD Carr, FT Chong, ...
PRX Quantum 2 (1), 017001, 2021
402021
Computational security of quantum encryption
G Alagic, A Broadbent, B Fefferman, T Gagliardoni, C Schaffner, MS Jules
International Conference on Information Theoretic Security, 47-71, 2016
322016
On beating the hybrid argument
B Fefferman, R Shaltiel, C Umans, E Viola
Proceedings of the 3rd Innovations in Theoretical Computer Science …, 2012
322012
The power of quantum fourier sampling
B Fefferman, C Umans
arXiv preprint arXiv:1507.05592, 2015
302015
Dynamical phase transitions in sampling complexity
A Deshpande, B Fefferman, MC Tran, M Foss-Feig, AV Gorshkov
Physical review letters 121 (3), 030501, 2018
242018
A complete characterization of unitary quantum space
B Fefferman, CYY Lin
arXiv preprint arXiv:1604.01384, 2016
222016
On quantum obfuscation
G Alagic, B Fefferman
arXiv preprint arXiv:1602.01771, 2016
162016
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
152020
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
142019
Pseudorandom generators and the BQP vs. PH problem
B Fefferman, C Umans
arXiv preprint arXiv:1007.0305, 2010
132010
Efficient classical simulation of noisy random quantum circuits in one dimension
K Noh, L Jiang, B Fefferman
Quantum 4, 318, 2020
112020
Quantum vs classical proofs and subset verification
B Fefferman, S Kimmel
arXiv preprint arXiv:1510.06750, 2015
92015
Space-efficient error reduction for unitary quantum computations
B Fefferman, H Kobayashi, CYY Lin, T Morimae, H Nishimura
arXiv preprint arXiv:1604.08192, 2016
82016
On quantum obfuscation (2016)
G Alagic, B Fefferman
arXiv preprint arXiv:1602.01771, 0
8
Complexity phase diagram for interacting and long-range bosonic Hamiltonians
N Maskara, A Deshpande, A Ehrenberg, MC Tran, B Fefferman, ...
arXiv preprint arXiv:1906.04178, 2019
72019
Quantum merlin arthur with exponentially small gap
B Fefferman, C Lin
arXiv preprint arXiv:1601.01975, 2016
62016
Computational security of quantum encryption (2016)
G Alagic, A Broadbent, B Fefferman, T Gagliardoni, C Schaffner, ...
arXiv preprint arXiv:1602.01441, 0
6
The system can't perform the operation now. Try again later.
Articles 1–20