Bill Fefferman

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

Bill Fefferman is a postdoctoral researcher in QuICS. His research interests include quantum computation and information, with a specific focus on complexity theory. Fefferman analyzes 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.




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.