The following pages link to Penghui Yao (Q343851):
Displaying 20 items.
- A direct product theorem for two-party bounded-round public-coin communication complexity (Q343852) (← links)
- Adversary lower bounds for nonadaptive quantum algorithms (Q980943) (← links)
- Multipartite quantum correlation and communication complexities (Q2012182) (← links)
- (Q2825306) (← links)
- New One Shot Quantum Protocols With Application to Communication Complexity (Q2976478) (← links)
- Adversary Lower Bounds for Nonadaptive Quantum Algorithms (Q3511461) (← links)
- Expected Communication Cost of Distributed Quantum Tasks (Q4562327) (← links)
- Capacity Approaching Coding for Low Noise Interactive Quantum Communication Part I: Large Alphabets (Q4958242) (← links)
- Exponential separation of quantum communication and classical information (Q4977978) (← links)
- Quantum and Classical Hybrid Generations for Classical Correlations (Q5030289) (← links)
- Nonlocal Games with Noisy Maximally Entangled States are Decidable (Q5096445) (← links)
- On the Compression of Messages in the Multi-Party Setting (Q5123842) (← links)
- Capacity approaching coding for low noise interactive quantum communication (Q5230301) (← links)
- Lower Bound on Expected Communication Cost of Quantum Huffman Coding (Q5278344) (← links)
- A Parallel Approximation Algorithm for Positive Semidefinite Programming (Q5495025) (← links)
- Polynomial-time approximation of zero-free partition functions (Q6560907) (← links)
- The generations of classical correlations via quantum schemes (Q6576598) (← links)
- Communication complexity of common randomness generation with isotropic states (Q6576721) (← links)
- On the Gaussian surface area of spectrahedra (Q6608542) (← links)
- Decidability of fully quantum nonlocal games with noisy maximally entangled states (Q6638103) (← links)
