Henry Yuen

ASSISTANT PROFESSOR OF COMPUTER SCIENCE [STARTING JANUARY 2021]

Research Interests

Quantum Computing, Quantum Information Theory, Complexity Theory, Cryptography, Theoretical Computer Science

Henry Yuen is a theoretical computer scientist whose goal is to understand the fundamental principles of computation and communication in a universe governed by quantum physics (such as ours). These days, he studies questions at the interface of quantum information theory, computational complexity theory, and cryptography.

In his research, Yuen utilizes ideas and tools from a variety of disciplines, ranging from complexity theory to quantum physics to information theory. He has made a number of contributions to the theory of quantum multiprover interactive proofs, including the discovery that such interactive proofs can verify solutions to uncomputable problems. Yuen also works on quantum cryptography; some of his contributions include designing protocols for infinite randomness expansion using untrusted quantum hardware.

Yuen received a BA in mathematics from the University of Southern California in 2010, and received his PhD in computer science at MIT in 2016. He was an assistant professor in the Computer Science and Mathematics departments at the University of Toronto between 2018 - 2020, and joined the faculty of Columbia in 2021.

Research Experience

  • Postdoctoral Associate, UC Berkeley Computer Science, 2016 - 2018

Professional Experience

  • Assistant Professor, Computer Science, Columbia University, 2021 - present
  • Assistant Professor, Computer Science and Mathematics, University of Toronto, 2018 - 2020

Professional Affiliations

  • Special Interest Group on Algorithms and Computation Theory (SIGACT)

Honors & Awards

  • Simons-Berkeley Research Fellowship 2020
  • Google Quantum Research Award, 2019-2020

Selected Publications

  • Hamoon Mousavi, Seyed Sajjad Nezhadi, and Henry Yuen. “On the complexity of zero-gap MIP*”, 47th International Colloquium on Automata, Languages, and Programming (ICALP). 2020
  • Alex B. Grilo, William Slofstra, and Henry Yuen. "Perfect zero knowledge for quantum multiprover interactive proofs", IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS). 2019
  • Joseph Fitzsimons, Zhengfeng Ji, Thomas Vidick, and Henry Yuen. "Quantum proof systems for iterated exponential time, and beyond", 51st Annual ACM Symposium on Theory of Computing (STOC). 2019
  • Sumegha Garg, Henry Yuen, and Mark Zhandry. "New security notions and feasibility results for authentication of quantum data", Annual International Cryptology Conference (CRYPTO). 2017
  • Mohammad Bavarian, Thomas Vidick, and Henry Yuen. "Hardness amplification for entangled games via anchoring", 49th Annual ACM Symposium on Theory of Computing (STOC). 2017
  • Henry Yuen. "A Parallel Repetition Theorem for All Entangled Games", 43rd International Colloquium on Automata, Languages, and Programming (ICALP). 2016
  • Matthew Coudron and Henry Yuen. "Infinite randomness expansion with a constant number of devices", 46th Annual ACM Symposium on Theory of Computing (STOC). 2014