Penghui Yao - RankMe

82 papers A* 11A 4B 3C 1Misc 1Journal 59Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A Cryptographic Perspective on the Verifiability of Quantum Advantage. ACM Trans. Quantum Comput. Nai-Hui Chia, Honghao Fu, Fang Song, Penghui Yao
2026	—	`conf`	Efficient Non-Adaptive Quantum Algorithms for Tolerant Junta Testing. SOSA Zongbo Bao, Yuxuan Liu, Penghui Yao, Zekun Ye, Jialin Zhang
2025	J	`jnl`	A Lifting Theorem for Hybrid Classical-Quantum Communication Complexity. CoRR Xudong Wu, Guangxu Yang, Penghui Yao
2025	A*	`conf`	A Pseudorandom Generator for Functions of Low-Degree Polynomial Threshold Functions. ICALP Penghui Yao, Mingnan Zhao
2025	J	`jnl`	A Pseudorandom Generator for Functions of Low-Degree Polynomial Threshold Functions. CoRR Penghui Yao, Mingnan Zhao
2025	J	`jnl`	Decidability of Fully Quantum Nonlocal Games with Noisy Maximally Entangled States. Algorithmica Minglong Qin, Penghui Yao
2025	J	`jnl`	Hypercontractivity for Quantum Erasure Channels via Variable Multipartite Log-Sobolev Inequality. IEEE Trans. Inf. Theory Zongbo Bao, Yangjing Dong, Fengning Ou, Penghui Yao
2025	J	`jnl`	Nonlocal Games and Self-tests in the Presence of Noise. CoRR Honghao Fu, Minglong Qin, Haochen Xu, Penghui Yao
2025	J	`jnl`	On Optimal Local Discrimination Algorithm of Two-Qubit Unitary Operations. J. Comput. Sci. Technol. Penghui Yao, Ze-Kun Ye
2025	J	`jnl`	On Testing and Learning Quantum Junta Channels. IEEE Trans. Pattern Anal. Mach. Intell. Zongbo Bao, Penghui Yao
2025	A*	`conf`	On the Computational Power of QAC0 with Barely Superlinear Ancillae. STOC Anurag Anshu, Yangjing Dong, Fengning Ou, Penghui Yao
2025	J	`jnl`	On the Fine-Grained Query Complexity of Symmetric Functions. Comput. Complex. Supartha Podder, Penghui Yao, Zekun Ye
2025	J	`jnl`	On the exact quantum query complexity of MOD and EXACT functions. Frontiers Comput. Sci. Penghui Yao, Zekun Ye
2025	B	`conf`	Optimal quantum sampling on distributed databases. SPAA Longyun Chen, Jingcheng Liu, Penghui Yao
2025	J	`jnl`	Optimal quantum sampling on distributed databases. CoRR Longyun Chen, Jingcheng Liu, Penghui Yao
2025	J	`jnl`	Parallel Kac's Walk Generates PRU. CoRR Chuhan Lu, Minglong Qin, Fang Song, Penghui Yao, Mingnan Zhao
2025	J	`jnl`	Quantum and Classical Communication Complexity of Permutation-Invariant Functions. IEEE Trans. Inf. Theory Ziyi Guan, Yunqi Huang, Penghui Yao, Zekun Ye
2025	J	`jnl`	The Computational Advantage of MIP* Vanishes in the Presence of Noise. J. ACM Yangjing Dong, Honghao Fu, Anand Natarajan, Minglong Qin, Haochen Xu, Penghui Yao
2025	Misc	`conf`	Time-independent Spiking Neuron via Membrane Potential Estimation for Efficient Spiking Neural Networks. ICASSP Hanqi Chen, Lixing Yu, Shaojie Zhan, Penghui Yao, Jiankun Shao
2024	A	`conf`	Almost Optimal Algorithms for Token Collision in Anonymous Networks. DISC Sirui Bai, Xinyu Fu, Xudong Wu, Penghui Yao, Chaodong Zheng
2024	J	`jnl`	Almost Optimal Algorithms for Token Collision in Anonymous Networks. CoRR Sirui Bai, Xinyu Fu, Xudong Wu, Penghui Yao, Chaodong Zheng
2024	J	`jnl`	Communication Complexity of Common Randomness Generation With Isotropic States. IEEE Trans. Inf. Theory Yangjing Dong, Penghui Yao
2024	—	`conf`	Quantum Pseudorandom Scramblers. TCC (2) Chuhan Lu, Minglong Qin, Fang Song, Penghui Yao, Mingnan Zhao
2024	J	`jnl`	Quantum Pseudorandom Scramblers. IACR Cryptol. ePrint Arch. Chuhan Lu, Minglong Qin, Fang Song, Penghui Yao, Mingnan Zhao
2024	A	`conf`	Quantum and Classical Communication Complexity of Permutation-Invariant Functions. STACS Ziyi Guan, Yunqi Huang, Penghui Yao, Zekun Ye
2024	J	`jnl`	Quantum and Classical Communication Complexity of Permutation-Invariant Functions. CoRR Ziyi Guan, Yunqi Huang, Penghui Yao, Zekun Ye
2024	A	`conf`	The Computational Advantage of MIP^∗ Vanishes in the Presence of Noise. CCC Yangjing Dong, Honghao Fu, Anand Natarajan, Minglong Qin, Haochen Xu, Penghui Yao
2024	J	`jnl`	The Generations of Classical Correlations via Quantum Schemes. IEEE Trans. Inf. Theory Zhenyu Chen, Lijinzhi Lin, Xiaodie Lin, Zhaohui Wei, Penghui Yao
2024	J	`jnl`	Time-independent Spiking Neuron via Membrane Potential Estimation for Efficient Spiking Neural Networks. CoRR Hanqi Chen, Lixing Yu, Shaojie Zhan, Penghui Yao, Jiankun Shao
2023	J	`jnl`	A Cryptographic Perspective on the Verifiability of Quantum Advantage. CoRR Nai-Hui Chia, Honghao Fu, Fang Song, Penghui Yao
2023	J	`jnl`	Communication Complexity of Common Randomness Generation with Isotropic States. CoRR Yangjing Dong, Penghui Yao
2023	A*	`conf`	Decidability of Fully Quantum Nonlocal Games with Noisy Maximally Entangled States. ICALP Minglong Qin, Penghui Yao
2023	J	`jnl`	Nearly Optimal Algorithms for Testing and Learning Quantum Junta Channels. CoRR Zongbo Bao, Penghui Yao
2023	A*	`conf`	On Testing and Learning Quantum Junta Channels. COLT Zongbo Bao, Penghui Yao
2023	B	`conf`	On the Fine-Grained Query Complexity of Symmetric Functions. ISAAC Supartha Podder, Penghui Yao, Zekun Ye
2023	J	`jnl`	On the Fine-Grained Query Complexity of Symmetric Functions. CoRR Supartha Podder, Penghui Yao, Zekun Ye
2023	J	`jnl`	Quantum Pseudorandom Scramblers. CoRR Chuhan Lu, Minglong Qin, Fang Song, Penghui Yao, Mingnan Zhao
2023	J	`jnl`	The Computational Advantage of MIP* Vanishes in the Presence of Noise. CoRR Yangjing Dong, Honghao Fu, Anand Natarajan, Minglong Qin, Haochen Xu, Penghui Yao
2023	J	`jnl`	The Generations of Classical Correlations via Quantum Schemes. CoRR Zhenyu Chen, Lijinzhi Lin, Xiaodie Lin, Zhaohui Wei, Penghui Yao
2022	J	`jnl`	Complexity of Eccentricities and All-Pairs Shortest Paths in the Quantum CONGEST Model. CoRR ChengSheng Wang, Xudong Wu, Penghui Yao
2022	A*	`conf`	Polynomial-Time Approximation of Zero-Free Partition Functions. ICALP Penghui Yao, Yitong Yin, Xinyuan Zhang
2022	J	`jnl`	Polynomial-Time Approximation of Zero-Free Partition Functions. CoRR Penghui Yao, Yitong Yin, Xinyuan Zhang
2022	A*	`conf`	Positive spectrahedra: invariance principles and pseudorandom generators. STOC Srinivasan Arunachalam, Penghui Yao
2022	A*	`conf`	Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks. PODC Xudong Wu, Penghui Yao
2022	J	`jnl`	Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks. CoRR Xudong Wu, Penghui Yao
2022	J	`jnl`	Quantum and Classical Hybrid Generations for Classical Correlations. IEEE Trans. Inf. Theory Xiaodie Lin, Zhaohui Wei, Penghui Yao
2021	J	`jnl`	Capacity Approaching Coding for Low Noise Interactive Quantum Communication Part I: Large Alphabets. IEEE Trans. Inf. Theory Debbie W. Leung, Ashwin Nayak, Ala Shayeghi, Dave Touchette, Penghui Yao, Nengkun Yu
2021	J	`jnl`	Nonlocal Games with Noisy Maximally Entangled States are Decidable. SIAM J. Comput. Minglong Qin, Penghui Yao
2021	J	`jnl`	On the Gaussian surface area of spectrahedra. Electron. Colloquium Comput. Complex. Srinivasan Arunachalam, Oded Regev, Penghui Yao
2021	J	`jnl`	Positive spectrahedrons: Geometric properties, Invariance principles and Pseudorandom generators. CoRR Srinivasan Arunachalam, Penghui Yao
2021	J	`jnl`	Positive spectrahedrons: Geometric properties, Invariance principles and Pseudorandom generators. Electron. Colloquium Comput. Complex. Srinivasan Arunachalam, Penghui Yao
2020	J	`jnl`	Capacity Approaching Coding for Low Noise Interactive Quantum Communication, Part I: Large Alphabets. CoRR Debbie W. Leung, Ashwin Nayak, Ala Shayeghi, Dave Touchette, Penghui Yao, Nengkun Yu
2020	J	`jnl`	On the Compression of Messages in the Multi-Party Setting. IEEE Trans. Inf. Theory Anurag Anshu, Penghui Yao
2020	J	`jnl`	Quantum and Classical Hybrid Generations for Classical Correlations. CoRR Xiaodie Lin, Zhaohui Wei, Penghui Yao
2019	J	`jnl`	A doubly exponential upper bound on noisy EPR states for binary games. CoRR Penghui Yao
2019	J	`jnl`	Quantum Insertion-Deletion Channels. CoRR Janet Leahy, Dave Touchette, Penghui Yao
2018	A*	`conf`	Capacity approaching coding for low noise interactive quantum communication. STOC Debbie W. Leung, Ashwin Nayak, Ala Shayeghi, Dave Touchette, Penghui Yao, Nengkun Yu
2018	B	`conf`	Expected Communication Cost of Distributed Quantum Tasks. ISIT Anurag Anshu, Ankit Garg, Aram W. Harrow, Penghui Yao
2018	J	`jnl`	Expected Communication Cost of Distributed Quantum Tasks. IEEE Trans. Inf. Theory Anurag Anshu, Ankit Garg, Aram W. Harrow, Penghui Yao
2018	J	`jnl`	On the compression of messages in the multi-party setting. CoRR Anurag Anshu, Penghui Yao
2017	A*	`conf`	Exponential separation of quantum communication and classical information. STOC Anurag Anshu, Dave Touchette, Penghui Yao, Nengkun Yu
2017	J	`jnl`	Multipartite Quantum Correlation and Communication Complexities. Comput. Complex. Rahul Jain, Zhaohui Wei, Penghui Yao, Shengyu Zhang
2017	J	`jnl`	Raz-McKenzie simulation with the inner product gadget. Electron. Colloquium Comput. Complex. Xiaodi Wu, Penghui Yao, Henry S. Yuen
2016	J	`jnl`	A Direct Product Theorem for Two-Party Bounded-Round Public-Coin Communication Complexity. Algorithmica Rahul Jain, Attila Pereszlényi, Penghui Yao
2016	J	`jnl`	Exponential Separation of Quantum Communication and Classical Information. CoRR Anurag Anshu, Dave Touchette, Penghui Yao, Nengkun Yu
2016	—	`conf`	Lower Bound on Expected Communication Cost of Quantum Huffman Coding. TQC Anurag Anshu, Ankit Garg, Aram W. Harrow, Penghui Yao
2016	J	`jnl`	New One Shot Quantum Protocols With Application to Communication Complexity. IEEE Trans. Inf. Theory Anurag Anshu, Rahul Jain, Priyanka Mukhopadhyay, Ala Shayeghi, Penghui Yao
2016	J	`jnl`	Parity Decision Tree Complexity and 4-Party Communication Complexity of XOR-functions Are Polynomially Equivalent. Chic. J. Theor. Comput. Sci. Penghui Yao
2015	J	`jnl`	Parity Decision Tree Complexity and 4-Party Communication Complexity of XOR-functions Are Polynomially Equivalent. CoRR Penghui Yao
2014	A	`conf`	A Parallel Repetition Theorem for Entangled Two-Player One-Round Games under Product Distributions. CCC Rahul Jain, Attila Pereszlényi, Penghui Yao
2014	J	`jnl`	A new operational interpretation of relative entropy and trace distance between quantum states. CoRR Anurag Anshu, Rahul Jain, Priyanka Mukhopadhyay, Ala Shayeghi, Penghui Yao
2014	J	`jnl`	Approximate and Multipartite Quantum Correlation (Communication) Complexity. CoRR Rahul Jain, Zhaohui Wei, Penghui Yao, Shengyu Zhang
2013	J	`jnl`	A parallel repetition theorem for entangled two-player one-round games under product distributions. CoRR Rahul Jain, Attila Pereszlényi, Penghui Yao
2012	A*	`conf`	A Direct Product Theorem for the Two-Party Bounded-Round Public-Coin Communication Complexity. FOCS Rahul Jain, Attila Pereszlényi, Penghui Yao
2012	J	`jnl`	A direct product theorem for bounded-round public-coin randomized communication complexity CoRR Rahul Jain, Attila Pereszlényi, Penghui Yao
2012	J	`jnl`	A parallel approximation algorithm for mixed packing and covering semidefinite programs CoRR Rahul Jain, Penghui Yao
2012	J	`jnl`	A strong direct product theorem in terms of the smooth rectangle bound CoRR Rahul Jain, Penghui Yao
2011	J	`jnl`	A Parallel Approximation Algorithm for Positive Semidefinite Programming CoRR Rahul Jain, Penghui Yao
2011	A*	`conf`	A Parallel Approximation Algorithm for Positive Semidefinite Programming. FOCS Rahul Jain, Penghui Yao
2010	J	`jnl`	Adversary lower bounds for nonadaptive quantum algorithms. J. Comput. Syst. Sci. Pascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao
2008	C	`conf`	Adversary Lower Bounds for Nonadaptive Quantum Algorithms. WoLLIC Pascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao
2008	J	`jnl`	Adversary lower bounds for nonadaptive quantum algorithms CoRR Pascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao