A direct product theorem for two-party bounded-round public-coin communication complexity R Jain, A Pereszlényi, P Yao Algorithmica 76, 720-748, 2016 | 77 | 2016 |

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 | 55 | 2011 |

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 | 44 | 2014 |

Raz-McKenzie simulation with the inner product gadget X Wu, P Yao, HS Yuen Electronic Colloquium on Computational Complexity (ECCC) 24 (10), 2017 | 33 | 2017 |

A strong direct product theorem in terms of the smooth rectangle bound R Jain, P Yao arXiv preprint arXiv:1209.0263, 2012 | 27 | 2012 |

A parallel approximation algorithm for mixed packing and covering semidefinite programs R Jain, P Yao arXiv preprint arXiv:1201.6090, 2012 | 19 | 2012 |

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 | 18 | 2017 |

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 | 14 | 2016 |

Quantum insertion-deletion channels J Leahy, D Touchette, P Yao arXiv preprint arXiv:1901.00984, 2019 | 13 | 2019 |

Quantum complexity of weighted diameter and radius in CONGEST networks X Wu, P Yao Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing …, 2022 | 10 | 2022 |

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), 169, 2021 | 9 | 2021 |

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 | 9 | 2014 |

Nonlocal games with noisy maximally entangled states are decidable M Qin, P Yao SIAM Journal on Computing 50 (6), 1800-1891, 2021 | 8 | 2021 |

Quantum pseudorandom scramblers C Lu, M Qin, F Song, P Yao, M Zhao arXiv preprint arXiv:2309.08941, 2023 | 7 | 2023 |

Multipartite quantum correlation and communication complexities R Jain, Z Wei, P Yao, S Zhang computational complexity 26, 199-228, 2017 | 7 | 2017 |

Nearly optimal algorithms for testing and learning quantum junta channels Z Bao, P Yao arXiv preprint arXiv:2305.12097 1, 10-11, 2023 | 5 | 2023 |

Positive spectrahedra: invariance principles and pseudorandom generators S Arunachalam, P Yao Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 4 | 2022 |

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 | 4 | 2010 |

The Computational Advantage of MIP* Vanishes in the Presence of Noise Y Dong, H Fu, A Natarajan, M Qin, H Xu, P Yao arXiv preprint arXiv:2312.04360, 2023 | 3 | 2023 |

Quantum and classical hybrid generations for classical correlations X Lin, Z Wei, P Yao IEEE Transactions on Information Theory 68 (1), 302-310, 2021 | 3 | 2021 |