Penghui Yao
Penghui Yao
Department ofComputer Science and Technology, Nanjing University
Verified email at nju.edu.cn
Title
Cited by
Cited by
Year
A direct product theorem for two-party bounded-round public-coin communication complexity
R Jain, A Pereszlényi, P Yao
Algorithmica 76 (3), 720-748, 2016
522016
A parallel approximation algorithm for positive semidefinite programming
R Jain, P Yao
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 463-471, 2011
332011
A parallel repetition theorem for entangled two-player one-round games under product distributions
R Jain, A Pereszlényi, P Yao
2014 IEEE 29th Conference on Computational Complexity (CCC), 209-216, 2014
292014
A strong direct product theorem in terms of the smooth rectangle bound
R Jain, P Yao
arXiv preprint arXiv:1209.0263, 2012
222012
Raz-McKenzie simulation with the inner product gadget.
X Wu, P Yao, HS Yuen
Electronic Colloquium on Computational Complexity (ECCC) 24 (10), 2017
172017
A parallel approximation algorithm for mixed packing and covering semidefinite programs
R Jain, P Yao
arXiv preprint arXiv:1201.6090, 2012
132012
Exponential separation of quantum communication and classical information
A Anshu, D Touchette, P Yao, N Yu
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
102017
New one shot quantum protocols with application to communication complexity
A Anshu, R Jain, P Mukhopadhyay, A Shayeghi, P Yao
IEEE Transactions on Information Theory 62 (12), 7566-7577, 2016
102016
A new operational interpretation of relative entropy and trace distance between quantum states
A Anshu, R Jain, P Mukhopadhyay, A Shayeghi, P Yao
arXiv preprint quant-ph/1404.1366, 2014
92014
Multipartite quantum correlation and communication complexities
R Jain, Z Wei, P Yao, S Zhang
computational complexity 26 (1), 199-228, 2017
42017
Expected communication cost of distributed quantum tasks
A Anshu, A Garg, AW Harrow, P Yao
IEEE Transactions on Information Theory 64 (11), 7395-7423, 2018
22018
Quantum Insertion-Deletion Channels
J Leahy, D Touchette, P Yao
arXiv preprint arXiv:1901.00984, 2019
12019
Capacity approaching coding for low noise interactive quantum communication
D Leung, A Nayak, A Shayeghi, D Touchette, P Yao, N Yu
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
12018
Lower bound on expected communication cost of quantum huffman coding
A Anshu, A Garg, AW Harrow, P Yao
11th Conference on the Theory of Quantum Computation, Communication and …, 2016
12016
Adversary lower bounds for nonadaptive quantum algorithms
P Koiran, J Landes, N Portier, P Yao
Journal of Computer and System Sciences 76 (5), 347-355, 2010
12010
Adversary lower bounds for nonadaptive quantum algorithms
P Koiran, J Landes, N Portier, P Yao
International Workshop on Logic, Language, Information, and Computation, 226-237, 2008
12008
Capacity Approaching Coding for Low Noise Interactive Quantum Communication, Part I: Large Alphabets
D Leung, A Nayak, A Shayeghi, D Touchette, P Yao, N Yu
arXiv preprint arXiv:2001.02818, 2020
2020
On the compression of messages in the multi-party setting
A Anshu, P Yao
IEEE Transactions on Information Theory 66 (4), 2091-2114, 2020
2020
A doubly exponential upper bound on noisy EPR states for binary games
P Yao
arXiv preprint arXiv:1904.08832, 2019
2019
Exponential Separation of Quantum Communication and Classical Information
D Touchette, A Anshu, P Yao, N Yu
arXiv preprint arXiv:1611.08946, 2016
2016
The system can't perform the operation now. Try again later.
Articles 1–20