Multipartite quantum correlation and communication complexities
From MaRDI portal
Publication:2012182
DOI10.1007/s00037-016-0126-yzbMath1371.68089arXiv1405.6015OpenAlexW1696453256MaRDI QIDQ2012182
Penghui Yao, Rahul Jain, Shengyu Zhang, Zhao Hui Wei
Publication date: 28 July 2017
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.6015
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Expressing combinatorial optimization problems by linear programs
- Exponential Lower Bounds for Polytopes in Combinatorial Optimization
- Quantum strategic game theory
- Quantum Computation and Quantum Information
- The Quantum Communication Complexity of Sampling
- The Communication Complexity of Correlation
- Efficient Protocols for Generating Bipartite Classical Distributions and Quantum States