Henry Yuen

Papers

  • A parallel repetition theorem for all entangled games [arxiv]
    ICALP 2016
  • Parallel repetition via fortification: analytic view and the quantum case [arxiv]
    With Mohammad Bavarian and Thomas Vidick.
    Manuscript
  • A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-Kilian [pdf]
    With Dana Moshkovitz and Govind Ramnarayan.
    Submitted
  • Anchoring games for parallel repetition [arxiv]
    With Mohammad Bavarian and Thomas Vidick.
    Quantum Information Processing (QIP) 2016 (Plenary talk) [video]
  • On the sum-of-squares degree of symmetric quadratic functions [arxiv]
    With Troy Lee, Anupam Prakash, and Ronald de Wolf.
    Computational Complexity Conference (CCC) 2016
  • On the limits of communication with non-local resources [pdf]
    With Xiaodi Wu.
    Manuscript
  • Parallel repetition for entangled k-player games via fast quantum search [arxiv] [video]
    With Kai-Min Chung and Xiaodi Wu.
    Computational Complexity Conference (CCC) 2015
  • Infinite Randomness Expansion and Amplification with a Constant Number of Devices [arxiv]
    With Matt Coudron.
    Quantum Information Processing (QIP) 2014
    ACM Symposium on Theory of Computing (STOC) 2014
  • A quantum lower bound for distinguishing random functions from random permutations [arxiv]
    Quantum Information and Computation, 14(9-10), 2014
  • Robust Randomness Amplifiers: Upper and Lower Bounds [arxiv] [PPTX]
    With Matt Coudron and Thomas Vidick.
    APPROX-RANDOM 2013
  • Continuous Time Channels with Interference [arxiv]
    With Ioana Ivan, Michael Mitzenmacher, and Justin Thaler.
    International Symposium on Information Theory (ISIT) 2012
  • DNA Sequencing via Machine Learning and Quantum Mechanics
    With F. Shimojo, K. Zhang, A. Nakano, K. Nomura, P. Vashishta, and R. Kalia. 2010.

Code

  • ToughSAT - a tool to generate SAT instances based off of hard problems such as FACTORING and SUBSET SUM.

Research Interests

I study theoretical computer science, with a focus on complexity theory, quantum computing, and quantum information. Recently, I have been very interested in applications of information theory to computational complexity. I am also interested in quantum cryptography and the limits of convex optimization algorithms.

Expository writings

About Me

I'm a PhD student in the Theory Group at MIT, advised by Professor Dana Moshkovitz. I'm supported by the Simons Graduate Award in Theoretical Computer Science, and enjoyed the support of a NSF Graduate Fellowship in the past. I received my B.A. in Mathematics from the University of Southern California, where I worked with Leonard Adleman and Aiichiro Nakano.

Contact

32 Vassar Street, G614
Cambridge, MA 02139

electronic mail: