I am a second 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.
Submitted / Manuscripts
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 15the Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020)
Quantum Copy-Protection from Hidden Subspaces
Scott Aaronson, Jiahui Liu, Ruizhe Zhang