Bill Fefferman

bill-fefferman's picture
Postdoctoral Scholar (2014-2017)
3100E Atlantic Building
(301) 314-1763

Bill Fefferman was a postdoctoral researcher in QuICS. His research interests included quantum computation and information, with a specific focus on complexity theory. Fefferman analyzed the power of quantum computers from a complexity theoretic point of view. Despite the prevailing belief that quantum computers are more powerful than their classical counterparts this remains a conjecture backed by little formal evidence. Fefferman's research attempts to establish a rigorous basis for this belief. After QuICS, he continued on to NIST, but is spending the first year of it as a postdoc at Berkeley.



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.