Quantum communication complexity

Does there exist a family of bipartite unitaries requiring exponentially many shared Bell pairs for fixed-error implementation when classical communication is limited to one simultaneous exchange?

• Quantum Communication
• Quantum Resource Theory
• Entanglement cost
• Quantum communication complexity
• Local operations and classical communication

What is the asymptotic classical-communication cost of simulating a bipartite quantum channel with bidirectional classical communication and non-signalling assistance?

• Quantum Communication
• Quantum Resource Theory
• Channel simulation
• Quantum communication complexity
• Quantum relative entropy
• One-shot and finite-blocklength bounds

Can shared randomness and one classical bit exactly simulate every pair of local projective measurements on every pure entangled two-qubit state?

• Quantum Communication
• Quantum Resource Theory
• Bell nonlocality
• Quantum communication complexity

Does an explicit total Boolean family require polynomial shared-state cost for bounded-error one-round \(f\)-routing?

• Quantum Communication
• Quantum Cryptography
• Quantum communication complexity
• Position-based quantum cryptography