Researchers proved quantum communication can outperform classical methods using just constant rounds. This resolves a longstanding question about whether quantum advantage requires polynomial interaction—enabling novel algorithmic approaches.

#QuantumCommunication #CommunicationComplexity #Research

A new two‑party protocol solves minimum cost flow with communication cost ~O(n¹·⁵) bits, down from ~O(n²); it also handles linear programs in ~O(n¹·⁵ k) bits. https://getnews.me/subquadratic-two-party-protocol-reduces-communication-for-minimum-cost-flow/ #minimumcostflow #communicationcomplexity

A new preprint classifies communication‑complexity measures into five constant‑equivalence classes, and the 45‑page manuscript is available via its arXiv DOI. Read more: https://getnews.me/new-hierarchy-classifies-constant-communication-complexity-measures/ #communicationcomplexity #research

USC researchers prove quantum communication solves the lifted Hidden Matching problem in O(log n), while any k-party randomised protocol requires Ω(n^1/3 / 2^k/3) — the first exponential separation in the one-way Numbers-on-Forehead model.

#QuantumCommunication #CommunicationComplexity #News