pith. sign in

Penghui Yao

Identifiers

  • name variant Penghui Yao 0.60 · backfill

Papers (15)

  1. On the Computational Complexity of Geometrically Local QAC0 circuits quant-ph · 2026 · author #3
  2. A Lifting Theorem for Hybrid Classical-Quantum Communication Complexity cs.CC · 2025 · author #3
  3. Nonlocal Games in the High-Noise Regime: Optimal Quantum Values and Rigidity quant-ph · 2025 · author #4
  4. Quantum Insertion-Deletion Channels quant-ph · 2019 · author #3
  5. Exponential Separation of Quantum Communication and Classical Information quant-ph · 2016 · author #3
  6. Expected communication cost of distributed quantum tasks quant-ph · 2016 · author #4
  7. Parity Decision Tree Complexity and 4-Party Communication Complexity of XOR-functions Are Polynomially Equivalent cs.CC · 2015 · author #1
  8. Multipartite Quantum Correlation and Communication Complexities quant-ph · 2014 · author #3
  9. New one shot quantum protocols with application to communication complexity quant-ph · 2014 · author #5
  10. A parallel repetition theorem for entangled two-player one-round games under product distributions quant-ph · 2013 · author #3
  11. A strong direct product theorem in terms of the smooth rectangle bound cs.CC · 2012 · author #2
  12. A parallel approximation algorithm for mixed packing and covering semidefinite programs cs.DS · 2012 · author #2
  13. A direct product theorem for bounded-round public-coin randomized communication complexity cs.CC · 2012 · author #3
  14. A Parallel Approximation Algorithm for Positive Semidefinite Programming cs.CC · 2011 · author #2
  15. Adversary lower bounds for nonadaptive quantum algorithms cs.CC · 2008 · author #4

Mentions

  • 1104.2502 #2 · backfill · confidence 0.70 Penghui Yao
  • 0804.1440 #4 · backfill · confidence 0.70 Penghui Yao

Frequent Coauthors