I am a Ph.D. student in Computer Science at the University of Southern California, very fortunate to be advised by Prof. Jiapeng Zhang.
My research focused on developing new techniques in communication complexity, motivated by challenges in quantum computing, cryptography, and circuit lower bounds:
- Lifting Theorems in Numbers-on-Forehead Communication: We propose a novel lifting framework connecting two-party communication with the Numbers-on-Forehead communication model. At present, we establish a deterministic lifting theorem that translates one-way two-party lower bounds into the one-way NOF setting.
- Gadgetless Lifting: We introduce a gadgetless lifting framework that extends query-to-communication lifting techniques to the gadgetless setting, resolving several open problems related to Collision Finding, Pointer Chasing, Set Intersection, and Key Agreement.
- Quantum vs. Classical Communication: We establish the first exponential separation between quantum and randomized communication complexity in the one-way NOF model, and we further developed lifting techniques to achieve the first non-trivial trade-off in hybrid classical-quantum two-way communication.
Publications & Manuscripts
Exponential Separation of Quantum and Classical One-Way Numbers-on-Forehead Communication
Guangxu Yang, Jiapeng Zhang
A Lifting Theorem for Hybrid Classical-Quantum Communication Complexity
Xudong Wu, Guangxu Yang, Penghui Yao
Deterministic Lifting Theorems for One-Way Numbers-on-Forehead Communication
Guangxu Yang, Jiapeng Zhang
A Min-Entropy Approach to Multi-Party Communication Lower Bounds
Mi-Ying Huang, Xinyu Mao, Shuo Wang, Guangxu Yang, and Jiapeng Zhang
40th Computational Complexity Conference (CCC 2025)
Gadgetless Lifting Beats Round Elimination: Improved Lower Bounds for Pointer Chasing
Xinyu Mao, Guangxu Yang, Jiapeng Zhang
16th Innovations in Theoretical Computer Science (ITCS 2025)
Communication Lower Bounds for Collision Problems via Density Increment Arguments
Guangxu Yang, Jiapeng Zhang
56th Annual ACM Symposium on Theory of Computing (STOC 2024)
Communication Lower Bounds of Key-Agreement Protocols via Density Increment Arguments
Mi-Ying Huang, Xinyu Mao, Guangxu Yang, and Jiapeng Zhang
21st Theory of Cryptography Conference (TCC 2023)
Simulation Methods in Communication Lower Bounds, Revisited
Guangxu Yang and Jiapeng Zhang