default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPenghui Yao
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j13]Penghui Yao, Zekun Ye:
On the exact quantum query complexity of MOD and EXACT functions. Frontiers Comput. Sci. 19(4): 194901 (2025)- 2024
- [j12]Zhenyu Chen, Lijinzhi Lin, Xiaodie Lin
, Zhaohui Wei, Penghui Yao:
The Generations of Classical Correlations via Quantum Schemes. IEEE Trans. Inf. Theory 70(6): 4160-4169 (2024) - [j11]Yangjing Dong, Penghui Yao:
Communication Complexity of Common Randomness Generation With Isotropic States. IEEE Trans. Inf. Theory 70(8): 5681-5691 (2024) - [c18]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: 30:1-30:71 - [c17]Ziyi Guan, Yunqi Huang, Penghui Yao, Zekun Ye:
Quantum and Classical Communication Complexity of Permutation-Invariant Functions. STACS 2024: 39:1-39:19 - [c16]Chuhan Lu, Minglong Qin, Fang Song, Penghui Yao, Mingnan Zhao:
Quantum Pseudorandom Scramblers. TCC (2) 2024: 3-35 - [c15]Sirui Bai, Xinyu Fu, Xudong Wu, Penghui Yao, Chaodong Zheng:
Almost Optimal Algorithms for Token Collision in Anonymous Networks. DISC 2024: 4:1-4:20 - [i33]Ziyi Guan, Yunqi Huang, Penghui Yao, Zekun Ye:
Quantum and Classical Communication Complexity of Permutation-Invariant Functions. CoRR abs/2401.00454 (2024) - [i32]Sirui Bai, Xinyu Fu, Xudong Wu, Penghui Yao, Chaodong Zheng:
Almost Optimal Algorithms for Token Collision in Anonymous Networks. CoRR abs/2408.10519 (2024) - [i31]Hanqi Chen, Lixing Yu, Shaojie Zhan, Penghui Yao, Jiankun Shao:
Time-independent Spiking Neuron via Membrane Potential Estimation for Efficient Spiking Neural Networks. CoRR abs/2409.04978 (2024) - [i30]Chuhan Lu, Minglong Qin, Fang Song, Penghui Yao, Mingnan Zhao:
Quantum Pseudorandom Scramblers. IACR Cryptol. ePrint Arch. 2024: 1470 (2024) - 2023
- [c14]Zongbo Bao, Penghui Yao:
On Testing and Learning Quantum Junta Channels. COLT 2023: 1064-1094 - [c13]Minglong Qin, Penghui Yao:
Decidability of Fully Quantum Nonlocal Games with Noisy Maximally Entangled States. ICALP 2023: 97:1-97:20 - [c12]Supartha Podder, Penghui Yao, Zekun Ye:
On the Fine-Grained Query Complexity of Symmetric Functions. ISAAC 2023: 55:1-55:18 - [i29]Zhenyu Chen, Lijinzhi Lin, Xiaodie Lin, Zhaohui Wei, Penghui Yao:
The Generations of Classical Correlations via Quantum Schemes. CoRR abs/2304.12690 (2023) - [i28]Zongbo Bao, Penghui Yao:
Nearly Optimal Algorithms for Testing and Learning Quantum Junta Channels. CoRR abs/2305.12097 (2023) - [i27]Chuhan Lu, Minglong Qin, Fang Song, Penghui Yao, Mingnan Zhao:
Quantum Pseudorandom Scramblers. CoRR abs/2309.08941 (2023) - [i26]Supartha Podder, Penghui Yao, Zekun Ye:
On the Fine-Grained Query Complexity of Symmetric Functions. CoRR abs/2309.11279 (2023) - [i25]Nai-Hui Chia, Honghao Fu, Fang Song, Penghui Yao:
A Cryptographic Perspective on the Verifiability of Quantum Advantage. CoRR abs/2310.14464 (2023) - [i24]Yangjing Dong, Penghui Yao:
Communication Complexity of Common Randomness Generation with Isotropic States. CoRR abs/2311.04723 (2023) - [i23]Yangjing Dong, Honghao Fu, Anand Natarajan, Minglong Qin, Haochen Xu, Penghui Yao:
The Computational Advantage of MIP* Vanishes in the Presence of Noise. CoRR abs/2312.04360 (2023) - 2022
- [j10]Xiaodie Lin, Zhaohui Wei, Penghui Yao:
Quantum and Classical Hybrid Generations for Classical Correlations. IEEE Trans. Inf. Theory 68(1): 302-310 (2022) - [c11]Penghui Yao, Yitong Yin, Xinyuan Zhang:
Polynomial-Time Approximation of Zero-Free Partition Functions. ICALP 2022: 108:1-108:20 - [c10]Xudong Wu, Penghui Yao:
Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks. PODC 2022: 120-130 - [c9]Srinivasan Arunachalam, Penghui Yao:
Positive spectrahedra: invariance principles and pseudorandom generators. STOC 2022: 208-221 - [i22]Penghui Yao, Yitong Yin, Xinyuan Zhang:
Polynomial-Time Approximation of Zero-Free Partition Functions. CoRR abs/2201.12772 (2022) - [i21]ChengSheng Wang, Xudong Wu, Penghui Yao:
Complexity of Eccentricities and All-Pairs Shortest Paths in the Quantum CONGEST Model. CoRR abs/2206.02766 (2022) - [i20]Xudong Wu, Penghui Yao:
Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks. CoRR abs/2206.02767 (2022) - 2021
- [j9]Minglong Qin, Penghui Yao:
Nonlocal Games with Noisy Maximally Entangled States are Decidable. SIAM J. Comput. 50(6): 1800-1891 (2021) - [j8]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): 5443-5490 (2021) - [i19]Srinivasan Arunachalam, Penghui Yao:
Positive spectrahedrons: Geometric properties, Invariance principles and Pseudorandom generators. CoRR abs/2101.08141 (2021) - [i18]Srinivasan Arunachalam, Oded Regev, Penghui Yao:
On the Gaussian surface area of spectrahedra. Electron. Colloquium Comput. Complex. TR21 (2021) - [i17]Srinivasan Arunachalam, Penghui Yao:
Positive spectrahedrons: Geometric properties, Invariance principles and Pseudorandom generators. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j7]Anurag Anshu, Penghui Yao:
On the Compression of Messages in the Multi-Party Setting. IEEE Trans. Inf. Theory 66(4): 2091-2114 (2020) - [i16]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 abs/2001.02818 (2020) - [i15]Xiaodie Lin, Zhaohui Wei, Penghui Yao:
Quantum and Classical Hybrid Generations for Classical Correlations. CoRR abs/2007.10673 (2020)
2010 – 2019
- 2019
- [i14]Janet Leahy, Dave Touchette, Penghui Yao:
Quantum Insertion-Deletion Channels. CoRR abs/1901.00984 (2019) - [i13]Penghui Yao:
A doubly exponential upper bound on noisy EPR states for binary games. CoRR abs/1904.08832 (2019) - 2018
- [j6]Anurag Anshu, Ankit Garg, Aram W. Harrow, Penghui Yao:
Expected Communication Cost of Distributed Quantum Tasks. IEEE Trans. Inf. Theory 64(11): 7395-7423 (2018) - [c8]Anurag Anshu, Ankit Garg, Aram W. Harrow, Penghui Yao:
Expected Communication Cost of Distributed Quantum Tasks. ISIT 2018: 806-810 - [c7]Debbie W. Leung, Ashwin Nayak, Ala Shayeghi, Dave Touchette, Penghui Yao, Nengkun Yu:
Capacity approaching coding for low noise interactive quantum communication. STOC 2018: 339-352 - [i12]Anurag Anshu, Penghui Yao:
On the compression of messages in the multi-party setting. CoRR abs/1808.06449 (2018) - 2017
- [j5]Rahul Jain, Zhaohui Wei, Penghui Yao, Shengyu Zhang:
Multipartite Quantum Correlation and Communication Complexities. Comput. Complex. 26(1): 199-228 (2017) - [c6]Anurag Anshu, Dave Touchette, Penghui Yao, Nengkun Yu:
Exponential separation of quantum communication and classical information. STOC 2017: 277-288 - [i11]Xiaodi Wu, Penghui Yao, Henry S. Yuen:
Raz-McKenzie simulation with the inner product gadget. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j4]Rahul Jain, Attila Pereszlényi, Penghui Yao:
A Direct Product Theorem for Two-Party Bounded-Round Public-Coin Communication Complexity. Algorithmica 76(3): 720-748 (2016) - [j3]Penghui Yao:
Parity Decision Tree Complexity and 4-Party Communication Complexity of XOR-functions Are Polynomially Equivalent. Chic. J. Theor. Comput. Sci. 2016 (2016) - [j2]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): 7566-7577 (2016) - [c5]Anurag Anshu, Ankit Garg, Aram W. Harrow, Penghui Yao:
Lower Bound on Expected Communication Cost of Quantum Huffman Coding. TQC 2016: 3:1-3:18 - [i10]Anurag Anshu, Dave Touchette, Penghui Yao, Nengkun Yu:
Exponential Separation of Quantum Communication and Classical Information. CoRR abs/1611.08946 (2016) - 2015
- [i9]Penghui Yao:
Parity Decision Tree Complexity and 4-Party Communication Complexity of XOR-functions Are Polynomially Equivalent. CoRR abs/1506.02936 (2015) - 2014
- [c4]Rahul Jain, Attila Pereszlényi, Penghui Yao:
A Parallel Repetition Theorem for Entangled Two-Player One-Round Games under Product Distributions. CCC 2014: 209-216 - [i8]Anurag Anshu, Rahul Jain, Priyanka Mukhopadhyay, Ala Shayeghi, Penghui Yao:
A new operational interpretation of relative entropy and trace distance between quantum states. CoRR abs/1404.1366 (2014) - [i7]Rahul Jain, Zhaohui Wei, Penghui Yao, Shengyu Zhang:
Approximate and Multipartite Quantum Correlation (Communication) Complexity. CoRR abs/1405.6015 (2014) - 2013
- [i6]Rahul Jain, Attila Pereszlényi, Penghui Yao:
A parallel repetition theorem for entangled two-player one-round games under product distributions. CoRR abs/1311.6309 (2013) - 2012
- [c3]Rahul Jain, Attila Pereszlényi, Penghui Yao:
A Direct Product Theorem for the Two-Party Bounded-Round Public-Coin Communication Complexity. FOCS 2012: 167-176 - [i5]Rahul Jain, Attila Pereszlényi, Penghui Yao:
A direct product theorem for bounded-round public-coin randomized communication complexity. CoRR abs/1201.1666 (2012) - [i4]Rahul Jain, Penghui Yao:
A parallel approximation algorithm for mixed packing and covering semidefinite programs. CoRR abs/1201.6090 (2012) - [i3]Rahul Jain, Penghui Yao:
A strong direct product theorem in terms of the smooth rectangle bound. CoRR abs/1209.0263 (2012) - 2011
- [c2]Rahul Jain, Penghui Yao:
A Parallel Approximation Algorithm for Positive Semidefinite Programming. FOCS 2011: 463-471 - [i2]Rahul Jain, Penghui Yao:
A Parallel Approximation Algorithm for Positive Semidefinite Programming. CoRR abs/1104.2502 (2011) - 2010
- [j1]Pascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao:
Adversary lower bounds for nonadaptive quantum algorithms. J. Comput. Syst. Sci. 76(5): 347-355 (2010)
2000 – 2009
- 2008
- [c1]Pascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao:
Adversary Lower Bounds for Nonadaptive Quantum Algorithms. WoLLIC 2008: 226-237 - [i1]Pascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao:
Adversary lower bounds for nonadaptive quantum algorithms. CoRR abs/0804.1440 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
