| 2026 | ICALP | A Lifting Theorem for Hybrid Classical-Quantum Communication Complexity. | Xudong Wu, Guangxu Yang, Penghui Yao |
| 2025 | ICALP | A Pseudorandom Generator for Functions of Low-Degree Polynomial Threshold Functions. | Penghui Yao, Mingnan Zhao |
| 2025 | ICASSP | Time-independent Spiking Neuron via Membrane Potential Estimation for Efficient Spiking Neural Networks. | Hanqi Chen, Lixing Yu, Shaojie Zhan, Penghui Yao, Jiankun Shao |
| 2025 | STOC | On the Computational Power of QAC0 with Barely Superlinear Ancillae. | Anurag Anshu, Yangjing Dong, Fengning Ou, Penghui Yao |
| 2025 | SPAA | Optimal quantum sampling on distributed databases. | Longyun Chen, Jingcheng Liu, Penghui Yao |
| 2024 | STACS | Quantum and Classical Communication Complexity of Permutation-Invariant Functions. | Ziyi Guan, Yunqi Huang, Penghui Yao, Zekun Ye |
| 2024 | TCC | Quantum Pseudorandom Scramblers. | Chuhan Lu, Minglong Qin, Fang Song, Penghui Yao, Mingnan Zhao |
| 2023 | COLT | On Testing and Learning Quantum Junta Channels. | Zongbo Bao, Penghui Yao |
| 2023 | ICALP | Decidability of Fully Quantum Nonlocal Games with Noisy Maximally Entangled States. | Minglong Qin, Penghui Yao |
| 2023 | ISAAC | On the Fine-Grained Query Complexity of Symmetric Functions. | Supartha Podder, Penghui Yao, Zekun Ye |
| 2022 | ICALP | Polynomial-Time Approximation of Zero-Free Partition Functions. | Penghui Yao, Yitong Yin, Xinyuan Zhang |
| 2022 | PODC | Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks. | Xudong Wu, Penghui Yao |
| 2022 | STOC | Positive spectrahedra: invariance principles and pseudorandom generators. | Srinivasan Arunachalam, Penghui Yao |
| 2018 | ISIT | Expected Communication Cost of Distributed Quantum Tasks. | Anurag Anshu, Ankit Garg, Aram W. Harrow, Penghui Yao |
| 2018 | STOC | Capacity approaching coding for low noise interactive quantum communication. | Debbie W. Leung, Ashwin Nayak, Ala Shayeghi, Dave Touchette, Penghui Yao, Nengkun Yu |
| 2017 | STOC | Exponential separation of quantum communication and classical information. | Anurag Anshu, Dave Touchette, Penghui Yao, Nengkun Yu |
| 2012 | FOCS | A Direct Product Theorem for the Two-Party Bounded-Round Public-Coin Communication Complexity. | Rahul Jain, Attila Pereszlnyi, Penghui Yao |
| 2011 | FOCS | A Parallel Approximation Algorithm for Positive Semidefinite Programming. | Rahul Jain, Penghui Yao |
| 2008 | WoLLIC | Adversary Lower Bounds for Nonadaptive Quantum Algorithms. | Pascal Koiran, Jrgen Landes, Natacha Portier, Penghui Yao |