About Me

I am a third year Ph.D student studying Computer Science at University of Texas at Austin, advised by Prof. Dana Moshkovitz. My research is mainly focused on complexity theory, especially in hardness of approximation and circuit lower bounds.

I am also interested in topics such as quantum complexity, coding theory and spectral graph theory.

Publications / Manuscripts

  • Quantum Meets Minimum Circuit Size Problem
    Nai-Hui Chia, Chi-Ning Chou, Jiayu Zhang, Ruizhe Zhang

  • Hybrid Quantum-Classical Implementation of Training Over-Parameterized Neural Networks
    Zhao Song, Ruizhe Zhang

  • Symmetric Boolean Factor Analysis with Applications to InstaHide
    Sitan Chen, Zhao Song, Runzhou Tao, Ruizhe Zhang

  • InstaHide's Sample Complexity When Mixing Two Private Images
    Baihe Huang, Zhao Song, Runzhou Tao, Ruizhe Zhang, Danyang Zhuo

  • Hyperbolic polynomials I: Concentration and Discrepancy
    Zhao Song, Ruizhe Zhang

  • New Approaches for Quantum Copy-Protection
    Scott Aaronson, Jiahui Liu, Qipeng Liu, Mark Zhandry, Ruizhe Zhang

  • QED driven QAOA for network-flow optimization
    Yuxuan Zhang, Ruizhe Zhang, Andrew C. Potter

  • On the Quantum Complexity of Closest Pair and Related Problems
    Scott Aaronson, Nai-Hui Chia, Han-Hsuan Lin, Chunhao Wang, Ruizhe Zhang
    Computational Complexity Conference (CCC 2020)
    Contributed talk at the 15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020)