Adversary lower bounds for nonadaptive quantum algorithms. - Pascal Koiran; Jürgen Landes; Natacha Portier; Penghui Yao (J. Comput. Syst. Sci., 2010)

A Parallel Approximation Algorithm for Positive Semidefinite Programming. - Rahul Jain 001; Penghui Yao (FOCS, 2011)

A direct product theorem for bounded-round public-coin randomized communication complexity - Rahul Jain 001; Attila Pereszlényi; Penghui Yao (CoRR, 2012)

A parallel approximation algorithm for mixed packing and covering semidefinite programs - Rahul Jain 001; Penghui Yao (CoRR, 2012)

A strong direct product theorem in terms of the smooth rectangle bound - Rahul Jain 001; Penghui Yao (CoRR, 2012)

A Parallel Repetition Theorem for Entangled Two-Player One-Round Games under Product Distributions. - Rahul Jain 001; Attila Pereszlényi; Penghui Yao (CCC, 2014)

A new operational interpretation of relative entropy and trace distance between quantum states. - Anurag Anshu; Rahul Jain 001; Priyanka Mukhopadhyay; Ala Shayeghi; Penghui Yao (CoRR, 2014)

Approximate and Multipartite Quantum Correlation (Communication) Complexity. - Rahul Jain 001; Zhaohui Wei; Penghui Yao; Shengyu Zhang 002 (CoRR, 2014)

Lower Bound on Expected Communication Cost of Quantum Huffman Coding. - Anurag Anshu; Ankit Garg; Aram W. Harrow; Penghui Yao (TQC, 2016)

A Direct Product Theorem for Two-Party Bounded-Round Public-Coin Communication Complexity. - Rahul Jain 001; Attila Pereszlényi; Penghui Yao (Algorithmica, 2016)

Parity Decision Tree Complexity and 4-Party Communication Complexity of XOR-functions Are Polynomially Equivalent. - Penghui Yao (Chic. J. Theor. Comput. Sci., 2016)

New One Shot Quantum Protocols With Application to Communication Complexity. - Anurag Anshu; Rahul Jain 001; Priyanka Mukhopadhyay; Ala Shayeghi; Penghui Yao (IEEE Trans. Inf. Theory, 2016)

Exponential separation of quantum communication and classical information. - Anurag Anshu; Dave Touchette; Penghui Yao; Nengkun Yu (STOC, 2017)

Multipartite Quantum Correlation and Communication Complexities. - Rahul Jain 001; Zhaohui Wei; Penghui Yao; Shengyu Zhang 002 (Comput. Complex., 2017)

Raz-McKenzie simulation with the inner product gadget. - Xiaodi Wu 001; Penghui Yao; Henry S. Yuen (Electron. Colloquium Comput. Complex., 2017)

Capacity approaching coding for low noise interactive quantum communication. - Debbie W. Leung; Ashwin Nayak 001; Ala Shayeghi; Dave Touchette; Penghui Yao; Nengkun Yu (STOC, 2018)

Expected Communication Cost of Distributed Quantum Tasks. - Anurag Anshu; Ankit Garg; Aram W. Harrow; Penghui Yao (IEEE Trans. Inf. Theory, 2018)

Quantum Insertion-Deletion Channels. - Janet Leahy; Dave Touchette; Penghui Yao (CoRR, 2019)

A doubly exponential upper bound on noisy EPR states for binary games. - Penghui Yao (CoRR, 2019)

On the Compression of Messages in the Multi-Party Setting. - Anurag Anshu; Penghui Yao (IEEE Trans. Inf. Theory, 2020)

On the Gaussian surface area of spectrahedra. - Srinivasan Arunachalam; Oded Regev 001; Penghui Yao (Electron. Colloquium Comput. Complex., 2021)

Positive spectrahedrons: Geometric properties, Invariance principles and Pseudorandom generators. - Srinivasan Arunachalam; Penghui Yao (Electron. Colloquium Comput. Complex., 2021)

Nonlocal Games with Noisy Maximally Entangled States are Decidable. - Minglong Qin; Penghui Yao (SIAM J. Comput., 2021)

Capacity Approaching Coding for Low Noise Interactive Quantum Communication Part I: Large Alphabets. - Debbie W. Leung; Ashwin Nayak 001; Ala Shayeghi; Dave Touchette; Penghui Yao; Nengkun Yu (IEEE Trans. Inf. Theory, 2021)

Polynomial-Time Approximation of Zero-Free Partition Functions. - Penghui Yao; Yitong Yin; Xinyuan Zhang (ICALP, 2022)

Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks. - Xudong Wu; Penghui Yao (PODC, 2022)

Positive spectrahedra: invariance principles and pseudorandom generators. - Srinivasan Arunachalam; Penghui Yao (STOC, 2022)

Complexity of Eccentricities and All-Pairs Shortest Paths in the Quantum CONGEST Model. - ChengSheng Wang; Xudong Wu; Penghui Yao (CoRR, 2022)

Quantum and Classical Hybrid Generations for Classical Correlations. - Xiaodie Lin; Zhaohui Wei; Penghui Yao (IEEE Trans. Inf. Theory, 2022)

Decidability of Fully Quantum Nonlocal Games with Noisy Maximally Entangled States. - Minglong Qin; Penghui Yao (ICALP, 2023)

Nearly Optimal Algorithms for Testing and Learning Quantum Junta Channels. - Zongbo Bao; Penghui Yao (CoRR, 2023)

A Cryptographic Perspective on the Verifiability of Quantum Advantage. - Nai-Hui Chia; Honghao Fu; Fang Song 001; Penghui Yao (CoRR, 2023)

The Computational Advantage of MIP^∗ Vanishes in the Presence of Noise. - Yangjing Dong; Honghao Fu; Anand Natarajan 001; Minglong Qin; Haochen Xu; Penghui Yao (CCC, 2024)

Almost Optimal Algorithms for Token Collision in Anonymous Networks. - Sirui Bai; Xinyu Fu 009; Xudong Wu; Penghui Yao; Chaodong Zheng (DISC, 2024)

Quantum Pseudorandom Scramblers. - Chuhan Lu; Minglong Qin; Fang Song 001; Penghui Yao; Mingnan Zhao (IACR Cryptol. ePrint Arch., 2024)

The Generations of Classical Correlations via Quantum Schemes. - Zhenyu Chen; Lijinzhi Lin; Xiaodie Lin; Zhaohui Wei; Penghui Yao (IEEE Trans. Inf. Theory, 2024)

Communication Complexity of Common Randomness Generation With Isotropic States. - Yangjing Dong; Penghui Yao (IEEE Trans. Inf. Theory, 2024)

A Pseudorandom Generator for Functions of Low-Degree Polynomial Threshold Functions. - Penghui Yao; Mingnan Zhao (ICALP, 2025)

Time-independent Spiking Neuron via Membrane Potential Estimation for Efficient Spiking Neural Networks. - Hanqi Chen; Lixing Yu; Shaojie Zhan; Penghui Yao; Jiankun Shao (ICASSP, 2025)

Optimal quantum sampling on distributed databases. - Longyun Chen; Jingcheng Liu 001; Penghui Yao (SPAA, 2025)

On the Computational Power of QAC0 with Barely Superlinear Ancillae. - Anurag Anshu; Yangjing Dong; Fengning Ou; Penghui Yao (STOC, 2025)

Parallel Kac's Walk Generates PRU. - Chuhan Lu; Minglong Qin; Fang Song 001; Penghui Yao; Mingnan Zhao (CoRR, 2025)

On the exact quantum query complexity of MOD and EXACT functions. - Penghui Yao; Zekun Ye (Frontiers Comput. Sci., 2025)

On Testing and Learning Quantum Junta Channels. - Zongbo Bao; Penghui Yao (IEEE Trans. Pattern Anal. Mach. Intell., 2025)

Quantum and Classical Communication Complexity of Permutation-Invariant Functions. - Ziyi Guan; Yunqi Huang; Penghui Yao; Zekun Ye (IEEE Trans. Inf. Theory, 2025)

On the Fine-Grained Query Complexity of Symmetric Functions. - Supartha Podder; Penghui Yao; Zekun Ye (Comput. Complex., 2025)

Optimal quantum sampling on distributed databases. - Longyun Chen; Jingcheng Liu; Penghui Yao (CoRR, 2025)

Hypercontractivity for Quantum Erasure Channels via Variable Multipartite Log-Sobolev Inequality. - Zongbo Bao; Yangjing Dong; Fengning Ou; Penghui Yao (IEEE Trans. Inf. Theory, 2025)