Follow
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
662016
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
452011
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
392014
Raz-McKenzie simulation with the inner product gadget.
X Wu, P Yao, HS Yuen
Electron. Colloquium Comput. Complex. 24, 10, 2017
272017
A strong direct product theorem in terms of the smooth rectangle bound
R Jain, P Yao
arXiv preprint arXiv:1209.0263, 2012
262012
A parallel approximation algorithm for mixed packing and covering semidefinite programs
R Jain, P Yao
arXiv preprint arXiv:1201.6090, 2012
162012
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
142017
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
112016
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 arXiv:1404.1366, 2014
92014
Quantum insertion-deletion channels
J Leahy, D Touchette, P Yao
arXiv preprint arXiv:1901.00984, 2019
82019
Multipartite quantum correlation and communication complexities
R Jain, Z Wei, P Yao, S Zhang
computational complexity 26 (1), 199-228, 2017
62017
Nonlocal games with noisy maximally entangled states are decidable
M Qin, P Yao
SIAM Journal on Computing 50 (6), 1800-1891, 2021
32021
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
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
32018
Quantum verification of NP problems with single photons and linear optics
A Zhang, H Zhan, J Liao, K Zheng, T Jiang, M Mi, P Yao, L Zhang
Light: Science & Applications 10 (1), 1-11, 2021
22021
Positive spectrahedrons: Geometric properties, invariance principles and pseudorandom generators
S Arunachalam, P Yao
22021
A doubly exponential upper bound on noisy EPR states for binary games
P Yao
arXiv preprint arXiv:1904.08832, 2019
22019
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
22010
Positive spectrahedra: Invariance principles and Pseudorandom generators
S Arunachalam, P Yao
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
12022
On the Gaussian surface area of spectrahedra
S Arunachalam, O Regev, P Yao
arXiv preprint arXiv:2112.01463, 2021
12021
The system can't perform the operation now. Try again later.
Articles 1–20