Topic
Quantum communication complexity
3 records: 3 unsolved, 0 solved. Filter the catalog by this topic →
-
Bidirectional classical-communication cost of bipartite channel simulation
What is the asymptotic classical-communication cost of simulating a bipartite quantum channel with bidirectional classical communication and non-signalling assistance?
Unsolved -
One-bit simulation of partially entangled qubits
Can shared randomness and one classical bit exactly simulate every pair of local projective measurements on every pure entangled two-qubit state?
Unsolved -
Polynomial shared-resource lower bounds for routing
Does an explicit total Boolean family require polynomial shared-state cost for bounded-error one-round \(f\)-routing?
Unsolved