The following pages link to Penghui Yao (Q343851):
Displaying 6 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)
- Lower Bound on Expected Communication Cost of Quantum Huffman Coding (Q5278344) (← links)
