Hi! This is Sunny, I am a graduate student at MIT advised by Professor Peter Shor and Anand Natarajan. My research is in quantum computation, with a focus in quantum error correction. I believe quantum computational power is a fundamental new resource bestowed to us by nature, and quantum error correction is the procedure that refines this raw resource for use in applications. I hope my work contributes to the constructions and later improvements of truly fault-tolerant, large-scale quantum computers in not-too-many decades.

Prior to grad school I was an undergrad at CMU. I worked in graph algorithms with Professor Anupam Gupta and Jason Li, and combinatorics with Professor Boris Bukh and Michael Tait.

Talks and Travel

Experiences

Publications

Quantum

  1. Quantum Codes with Addressable and Transversal Non-Clifford Gates, Feb 2025 Zhiyang He, Vinod Vaikuntanathan, Adam Wills, Rachel Yun Zhang. [arxiv]

  2. Experimental Demonstration of Logical Magic State Distillation, Dec 2024
    QuEra Team and Collaborators.
    [arXiv], [Blog post by QuEra]

  3. Permutation gates in the third level of the Clifford hierarchy, Oct 2024
    Zhiyang He, Luke Robitaille, Xinyu Tan. [arXiv]

  4. Improved QLDPC Surgery: Logical Measurements and Bridging Codes, July 2024
    Andrew Cross, Zhiyang He, Patrick Rall, Theodore Yoder.
    QIP 2025. Voted talk at FTQT 2024. [arXiv]

  5. Single-shot decoding of good quantum LDPC codes, June 2023
    Shouzhen Gu, Eugene Tang, Libor Caha, Shin Ho Choe, Zhiyang He, Aleksander Kubica.
    QEC 2023, TQC 2024.
    Talk at Advances in Quantum Coding Theory at Simons Institute.

    Communications in Mathematical Physics.
    [arXiv], [Shouzhen’s Talk at Simons], [Talk at TQC], [Slides]

  6. Quantum Locally Testable Code with Constant Soundness, Sep 2022
    Andrew Cross, Zhiyang He, Anand Natarajan, Mario Szegedy, Guanyu Zhu.
    QIP 2023. Talk at IBM Yorktown.
    Quantum. [arXiv], [Talk at QIP]

Graph Algorithms

  1. Breaking the \(n^k\) Barrier for Minimum \(k\)-cut on Simple Graphs, Nov 2021
    Zhiyang He, Jason Li.
    STOC 2022. [arXiv], [Talk at STOC]

  2. Near-linear-time, Optimal Vertex Cut Sparsifier in Directed Acyclic Graphs, Nov 2020
    Zhiyang He, Jason Li, Magnus Wahlström.
    European Symposium on Algorithms (ESA) 2021, Best Paper Award. [arXiv]

Combinatorics

  1. New Upper Bound on Extremal Number of Even Cycles, Sep 2020
    Zhiyang He.
    The Electronic Journal of Combinatorics. [arXiv]

  2. Hypergraphs with Few Berge Paths of Fixed Length between Vertices, July 2018
    Zhiyang He, Michael Tait.
    SIAM Journal on Discrete Mathematics. [arXiv]