Penghui Yao

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 44

Top Topics

Communication Cost

Top Venues

IEEE Trans. Inf. Theory

Electron. Colloquium Comput. Complex.

Publications

Zhenyu Chen, Lijinzhi Lin, Xiaodie Lin, Zhaohui Wei, Penghui Yao
The Generations of Classical Correlations via Quantum Schemes. IEEE Trans. Inf. Theory 70 (6) (2024)
Ziyi Guan, Yunqi Huang, Penghui Yao, Zekun Ye
Quantum and Classical Communication Complexity of Permutation-Invariant Functions. STACS (2024)
Yangjing Dong, Penghui Yao
Communication Complexity of Common Randomness Generation With Isotropic States. IEEE Trans. Inf. Theory 70 (8) (2024)
Yangjing Dong, Honghao Fu, Anand Natarajan, Minglong Qin, Haochen Xu, Penghui Yao
The Computational Advantage of MIP^∗ Vanishes in the Presence of Noise. CCC (2024)
Ziyi Guan, Yunqi Huang, Penghui Yao, Zekun Ye
Quantum and Classical Communication Complexity of Permutation-Invariant Functions. CoRR (2024)
Supartha Podder, Penghui Yao, Zekun Ye
On the Fine-Grained Query Complexity of Symmetric Functions. ISAAC (2023)
Zongbo Bao, Penghui Yao
On Testing and Learning Quantum Junta Channels. COLT (2023)
Chuhan Lu, Minglong Qin, Fang Song, Penghui Yao, Mingnan Zhao
Quantum Pseudorandom Scramblers. CoRR (2023)
Supartha Podder, Penghui Yao, Zekun Ye
On the Fine-Grained Query Complexity of Symmetric Functions. CoRR (2023)
Yangjing Dong, Penghui Yao
Communication Complexity of Common Randomness Generation with Isotropic States. CoRR (2023)
Zhenyu Chen, Lijinzhi Lin, Xiaodie Lin, Zhaohui Wei, Penghui Yao
The Generations of Classical Correlations via Quantum Schemes. CoRR (2023)
Zongbo Bao, Penghui Yao
Nearly Optimal Algorithms for Testing and Learning Quantum Junta Channels. CoRR (2023)
Yangjing Dong, Honghao Fu, Anand Natarajan, Minglong Qin, Haochen Xu, Penghui Yao
The Computational Advantage of MIP* Vanishes in the Presence of Noise. CoRR (2023)
Minglong Qin, Penghui Yao
Decidability of Fully Quantum Nonlocal Games with Noisy Maximally Entangled States. ICALP (2023)
Nai-Hui Chia, Honghao Fu, Fang Song, Penghui Yao
A Cryptographic Perspective on the Verifiability of Quantum Advantage. CoRR (2023)
ChengSheng Wang, Xudong Wu, Penghui Yao
Complexity of Eccentricities and All-Pairs Shortest Paths in the Quantum CONGEST Model. CoRR (2022)
Srinivasan Arunachalam, Penghui Yao
Positive spectrahedra: invariance principles and pseudorandom generators. STOC (2022)
Penghui Yao, Yitong Yin, Xinyuan Zhang
Polynomial-Time Approximation of Zero-Free Partition Functions. CoRR (2022)
Penghui Yao, Yitong Yin, Xinyuan Zhang
Polynomial-Time Approximation of Zero-Free Partition Functions. ICALP (2022)
Xiaodie Lin, Zhaohui Wei, Penghui Yao
Quantum and Classical Hybrid Generations for Classical Correlations. IEEE Trans. Inf. Theory 68 (1) (2022)
Xudong Wu, Penghui Yao
Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks. PODC (2022)
Xudong Wu, Penghui Yao
Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks. CoRR (2022)
Debbie W. Leung, Ashwin Nayak, Ala Shayeghi, Dave Touchette, Penghui Yao, Nengkun Yu
Capacity Approaching Coding for Low Noise Interactive Quantum Communication Part I: Large Alphabets. IEEE Trans. Inf. Theory 67 (8) (2021)
Minglong Qin, Penghui Yao
Nonlocal Games with Noisy Maximally Entangled States are Decidable. SIAM J. Comput. 50 (6) (2021)
Srinivasan Arunachalam, Oded Regev, Penghui Yao
On the Gaussian surface area of spectrahedra. Electron. Colloquium Comput. Complex. 28 (2021)
Srinivasan Arunachalam, Penghui Yao
Positive spectrahedrons: Geometric properties, Invariance principles and Pseudorandom generators. CoRR (2021)
Srinivasan Arunachalam, Penghui Yao
Positive spectrahedrons: Geometric properties, Invariance principles and Pseudorandom generators. Electron. Colloquium Comput. Complex. 28 (2021)
Anurag Anshu, Penghui Yao
On the Compression of Messages in the Multi-Party Setting. IEEE Trans. Inf. Theory 66 (4) (2020)
Debbie W. Leung, Ashwin Nayak, Ala Shayeghi, Dave Touchette, Penghui Yao, Nengkun Yu
Capacity Approaching Coding for Low Noise Interactive Quantum Communication, Part I: Large Alphabets. CoRR (2020)
Xiaodie Lin, Zhaohui Wei, Penghui Yao
Quantum and Classical Hybrid Generations for Classical Correlations. CoRR (2020)
Penghui Yao
A doubly exponential upper bound on noisy EPR states for binary games. CoRR (2019)
Janet Leahy, Dave Touchette, Penghui Yao
Quantum Insertion-Deletion Channels. CoRR (2019)
Anurag Anshu, Penghui Yao
On the compression of messages in the multi-party setting. CoRR (2018)
Anurag Anshu, Ankit Garg, Aram W. Harrow, Penghui Yao
Expected Communication Cost of Distributed Quantum Tasks. IEEE Trans. Inf. Theory 64 (11) (2018)
Debbie W. Leung, Ashwin Nayak, Ala Shayeghi, Dave Touchette, Penghui Yao, Nengkun Yu
Capacity approaching coding for low noise interactive quantum communication. STOC (2018)
Anurag Anshu, Ankit Garg, Aram W. Harrow, Penghui Yao
Expected Communication Cost of Distributed Quantum Tasks. ISIT (2018)
Anurag Anshu, Dave Touchette, Penghui Yao, Nengkun Yu
Exponential separation of quantum communication and classical information. STOC (2017)
Rahul Jain, Zhaohui Wei, Penghui Yao, Shengyu Zhang
Multipartite Quantum Correlation and Communication Complexities. Comput. Complex. 26 (1) (2017)
Xiaodi Wu, Penghui Yao, Henry S. Yuen
Raz-McKenzie simulation with the inner product gadget. Electron. Colloquium Comput. Complex. 24 (2017)
Rahul Jain, Attila Pereszlényi, Penghui Yao
A Direct Product Theorem for Two-Party Bounded-Round Public-Coin Communication Complexity. Algorithmica 76 (3) (2016)
Anurag Anshu, Dave Touchette, Penghui Yao, Nengkun Yu
Exponential Separation of Quantum Communication and Classical Information. CoRR (2016)
Anurag Anshu, Ankit Garg, Aram W. Harrow, Penghui Yao
Lower Bound on Expected Communication Cost of Quantum Huffman Coding. TQC (2016)
Anurag Anshu, Rahul Jain, Priyanka Mukhopadhyay, Ala Shayeghi, Penghui Yao
New One Shot Quantum Protocols With Application to Communication Complexity. IEEE Trans. Inf. Theory 62 (12) (2016)
Penghui Yao
Parity Decision Tree Complexity and 4-Party Communication Complexity of XOR-functions Are Polynomially Equivalent. Chic. J. Theor. Comput. Sci. 2016 (2016)
Penghui Yao
Parity Decision Tree Complexity and 4-Party Communication Complexity of XOR-functions Are Polynomially Equivalent. CoRR (2015)
Anurag Anshu, Rahul Jain, Priyanka Mukhopadhyay, Ala Shayeghi, Penghui Yao
A new operational interpretation of relative entropy and trace distance between quantum states. CoRR (2014)
Rahul Jain, Zhaohui Wei, Penghui Yao, Shengyu Zhang
Approximate and Multipartite Quantum Correlation (Communication) Complexity. CoRR (2014)
Rahul Jain, Attila Pereszlényi, Penghui Yao
A Parallel Repetition Theorem for Entangled Two-Player One-Round Games under Product Distributions. Computational Complexity Conference (2014)
Rahul Jain, Attila Pereszlényi, Penghui Yao
A parallel repetition theorem for entangled two-player one-round games under product distributions. CoRR (2013)
Rahul Jain, Attila Pereszlényi, Penghui Yao
A direct product theorem for bounded-round public-coin randomized communication complexity CoRR (2012)
Rahul Jain, Penghui Yao
A strong direct product theorem in terms of the smooth rectangle bound CoRR (2012)
Rahul Jain, Penghui Yao
A parallel approximation algorithm for mixed packing and covering semidefinite programs CoRR (2012)
Rahul Jain, Attila Pereszlényi, Penghui Yao
A Direct Product Theorem for the Two-Party Bounded-Round Public-Coin Communication Complexity. FOCS (2012)
Rahul Jain, Penghui Yao
A Parallel Approximation Algorithm for Positive Semidefinite Programming. FOCS (2011)
Rahul Jain, Penghui Yao
A Parallel Approximation Algorithm for Positive Semidefinite Programming CoRR (2011)
Pascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao
Adversary lower bounds for nonadaptive quantum algorithms. J. Comput. Syst. Sci. 76 (5) (2010)
Pascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao
Adversary lower bounds for nonadaptive quantum algorithms CoRR (2008)
Pascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao
Adversary Lower Bounds for Nonadaptive Quantum Algorithms. WoLLIC (2008)