Bill Fefferman

bill-fefferman's picture
Assistant Research Professor
3100E Atlantic Building
Bill Fefferman is a Research Assistant Professor in QuICS and a Research Scientist at NIST.  His work focuses on quantum computation and computational complexity theory, with an emphasis on understanding the capabilities of near term quantum devices and experiments.  He previously held postdoctoral positions at UC Berkeley advised by Umesh Vazirani, and at the University of Maryland in QuICS.  He received his doctorate from Caltech in 2014, advised by Alexei Kitaev and Chris Umans.  In 2017 he was the recipient of a Young Investigator Award from the Air Force Office of Scientific Research to help support his research on the power of near-term quantum systems.



A. Deshpande, Fefferman, B., Tran, M. C., Foss-Feig, M., and Gorshkov, A. V., Dynamical phase transitions in sampling complexity, Phys. Rev. Lett., vol. 121, no. 030501, p. 12 pages, 4 figures. v3: published version, 2018.


B. Fefferman, Foss-Feig, M., and Gorshkov, A. V., Exact sampling hardness of Ising spin models, Physical Review A, vol. 96, no. 3, p. 032324, 2017.


G. Alagic, Broadbent, A., Fefferman, B., Gagliardoni, T., Schaffner, C., and Jules, M. St., Computational Security of Quantum Encryption, in Computational Security of Quantum Encryption. In: Nascimento A., Barreto P. (eds) Information Theoretic Security. , 2016.
B. Fefferman, Kobayashi, H., Lin, C. Yen- Yu, Morimae, T., and Nishimura, H., Space-Efficient Error Reduction for Unitary Quantum Computations, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), vol. 55, p. 14:1--14:14, 2016.



B. Fefferman, Shaltiel, R., Umans, C., and Viola, E., On Beating the Hybrid Argument, Proceedings, ITCS, vol. 9, pp. 809-843, 2012.