Henry Yuen
Research Interests
Quantum computing, cryptography, quantum information theory, complexity theory.
About Me
News: I will be joining the Theory Group at the University of Toronto as an Assistant Professor of Computer Science and Mathematics in Summer 2018!
I'm currently a postdoctoral researcher in the group of Umesh Vazirani at UC Berkeley. I finished my PhD in 2016 at MIT, advised by Dana Moshkovitz. There I was a Simons Graduate Fellow in Theoretical Computer Science (20152016) and a recipient of a NSF Graduate Fellowship. I obtained my B.A. in Mathematics from the University of Southern California in 2010.
email: hyuen@cs.toronto.edu
Expository writings
 An exposition of the breakthrough on twosource extractors. (MIT Theory Blog)
 Can you tell if a bit is random? (MIT Theory Blog)
Service
 Program Committees: ITCS 2017, CCC 2018, TQC 2018
Papers

Approximate lowweight check codes and circuit lower bounds for noisy ground states.
Chinmay Nirkhe, Umesh Vazirani, Henry Yuen.
Submitted.
[arxiv] 
Noisetolerant testing of high entanglement of formation.
Rotem ArnonFriedman, Henry Yuen.
Submitted.
[arxiv]2017

Multiplayer parallel repetition for expander games.
Irit Dinur, Prahladh Harsha, Rakesh Venkat, Henry Yuen.
Innovations in Theoretical Computer Science (ITCS) 2017 (Invited talk)
[ECCC]  Parallel repetition via fortification: analytic view and the quantum case.
Mohammad Bavarian, Thomas Vidick, Henry Yuen.
Theory of Quantum Computing (TQC) 2016
Innovations in Theoretical Computer Science (ITCS) 2017
[arxiv]  New security notions and feasibility results for authentication of quantum data.
Sumegha Garg, Henry Yuen, Mark Zhandry.
CRYPTO 2017
International Conference on Quantum Cryptography (QCrypt) 2016
[arxiv]  Anchoring games for parallel repetition.
Mohammad Bavarian, Thomas Vidick, Henry Yuen.
Quantum Information Processing (QIP) 2016 (Plenary talk).
Symposium on the Theory of Computing (STOC) 2017.
[arxiv] [QIP 2016 talk]2016
 A parallel repetition theorem for all entangled games.
Henry Yuen.
International Colloquium of Automata, Languages,and Programming (ICALP) 2016
Quantum Information Processing (QIP) 2017
[arxiv] [QIP 2017 talk]  Rescuing Complementarity With Little Drama.
Ning Bao, Adam Bouland, Aidan ChatwinDavies, Jason Pollack, Henry Yuen.
In Journal of High Energy Physics (JHEP) 2016:26 (2016)
[arxiv] [JHEP]  A NoGo Theorem for Derandomized Parallel Repetition: Beyond FeigeKilian.
Dana Moshkovitz, Govind Ramnarayan, Henry Yuen.
RANDOM 2016
[arxiv]  On the sumofsquares degree of symmetric quadratic functions.
Troy Lee, Anupam Prakash, Ronald de Wolf, Henry Yuen.
Computational Complexity Conference (CCC) 2016
[arxiv]2015
 Parallel repetition for entangled kplayer games via fast quantum search.
KaiMin Chung, Xiaodi Wu, Henry Yuen.
Computational Complexity Conference (CCC) 2015
[arxiv] [video]2014
 Infinite Randomness Expansion and Amplification with a Constant Number of Devices.
Matt Coudron, Henry Yuen.
Quantum Information Processing (QIP) 2014
Symposium on the Theory of Computing (STOC) 2014
[arxiv] [blog post] [American Scientist article by Scott Aaronson]  A quantum lower bound for distinguishing random functions from random permutations.
Henry Yuen.
Quantum Information and Computation, 14(910), 2014
[arxiv]2013 and older
 Robust Randomness Amplifiers: Upper and Lower Bounds.
Matt Coudron, Thomas Vidick, Henry Yuen.
RANDOM 2013
[arxiv] [PPTX]  Continuous Time Channels with Interference.
Ioana Ivan, Michael Mitzenmacher, Justin Thaler, Henry Yuen.
International Symposium on Information Theory (ISIT) 2012
[arxiv]  DNA Sequencing via Machine Learning and Quantum Mechanics.
F. Shimojo, K. Zhang, A. Nakano, K. Nomura, P. Vashishta, R. Kalia, H. Yuen. 2010.
2018
Notes and other manuscripts
 RazMcKenzie simulation with the inner product gadget.
Xiaodi Wu, Penghui Yao, Henry Yuen.
Manuscript.
[ECCC]  A simple proof of Rennerâ€™s exponential de Finetti theorem.
Thomas Vidick, Henry Yuen.
Manuscript.
[arxiv]  On the limits of communication with nonlocal resources.
Xiaodi Wu, Henry Yuen.
Manuscript.
[pdf]
Code
 ToughSAT  a tool to generate SAT instances based off of hard problems such as FACTORING and SUBSET SUM.