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
652016
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
422011
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
382014
A strong direct product theorem in terms of the smooth rectangle bound
R Jain, P Yao
arXiv preprint arXiv:1209.0263, 2012
262012
Raz-McKenzie simulation with the inner product gadget.
X Wu, P Yao, HS Yuen
Electron. Colloquium Comput. Complex. 24, 10, 2017
242017
A parallel approximation algorithm for mixed packing and covering semidefinite programs
R Jain, P Yao
arXiv preprint arXiv:1201.6090, 2012
142012
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
92017
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
92016
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
Quantum insertion-deletion channels
J Leahy, D Touchette, P Yao
arXiv preprint arXiv:1901.00984, 2019
72019
Multipartite quantum correlation and communication complexities
R Jain, Z Wei, P Yao, S Zhang
computational complexity 26 (1), 199-228, 2017
52017
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
32018
A doubly exponential upper bound on noisy EPR states for binary games
P Yao
arXiv preprint arXiv:1904.08832, 2019
22019
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 and Classical Hybrid Generations for Classical Correlations
X Lin, Z Wei, P Yao
arXiv preprint arXiv:2007.10673, 2020
12020
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
Complexity of Eccentricities and All-Pairs Shortest Paths in the Quantum CONGEST Model
C Wang, X Wu, P Yao
SPIN, 2021
2021
Nonlocal games with noisy maximally entangled states are decidable
M Qin, P Yao
arXiv preprint arXiv:2108.09140, 2021
2021
The system can't perform the operation now. Try again later.
Articles 1–20