arXiv:2610.04734
Topology-independent quantum advantage in communication networks
Ankush Pandit, V. N. S. Meghanath Ashtakala, Leon George Padayatty, Debashis Saha
Abstract
Quantum communication can outperform classical communication in a variety of information-processing tasks, but such advantages are typically established for a fixed communication network. Here we introduce topology-independent quantum advantage, in which a quantum protocol outperforms every classical protocol subject to the same communication constraint, irrespective of how the classical communication resource is distributed among the parties or which communication topology is employed, even when the parties may share unlimited classical randomness. We first demonstrate this phenomenon through a simple three-party equality task: two senders receive ternary classical inputs, while an input-free receiver determines whether the inputs are equal. We then formulate a general framework for topology-independent communication and completely characterize the corresponding classical correlation polytope in the minimal three-party scenario. Its facet inequalities reveal several instances of topology-independent quantum advantage. Remarkably, one of these inequalities enables the semi-device-independent certification of a nonunitary quantum channel, while another certifies a sequential quantum network topology without any prior assumption about the network configuration. Finally, we extend the framework to four-party networks, characterize the relevant classical communication structures, and identify a communication task exhibiting quantum advantages against all admissible classical topologies. Our results establish topology independence as a genuine and robust form of quantum advantage in communication networks.
AI Summary
The paper asks whether bounded-dimensional quantum communication can outperform classical communication when the competing classical protocol may choose its network topology and resource allocation, including mixtures controlled by unlimited shared randomness. It defines the classical benchmark as a convex hull over weighted, sink-rooted directed acyclic networks, with an input-free receiver and a resource budget given by the sum of message dimensions. For two senders with ternary inputs and a binary-output receiver, it reports an equality-testing protocol using two sequential qubit transmissions with average success $5/6$, versus a topology-independent classical bound of $7/9$. This is identified as the minimal scenario admitting such an advantage. Deterministic-strategy enumeration and polyhedral computation give 330 classical facets, reducing to 11 nontrivial symmetry classes; sequential qubit strategies numerically violate ten classes. Quantum values are obtained by alternating semidefinite optimizations over preparations, channels and measurements. Two inequalities support semi-device-independent certification. One attains $3+\sqrt{2}\approx4.414$, exceeding a unitary-channel bound of $4.0981$ obtained using a dimension-bounded SDP hierarchy. Another attains $3\sqrt{3}/2\approx2.598$, while an analytical bound of $2$ excludes parallel and direct quantum topologies. A four-party extension yields a classical bound of $8$ and a reported quantum value of $7+\sqrt{2}$. Most optimized quantum values are lower bounds, and exclusion of parallel quantum violations is proved for only one facet. Four-party facets are not fully enumerated. Scaling separations, broader network models and cryptographic applications remain open.
The use of generative artificial intelligence tools was limited to language editing.
Error found: The framework covers party-level DAGs with an additive message-dimension budget, not every causal interactive protocol under the usual bit-cost constraint, so its unrestricted-topology language requires qualification. The equality protocol's output labels disagree with its success functional, yielding 1/6 as written rather than 5/6, and the stated algebraic maximum should be 1. The explicit I5 measurement vector is undernormalized, making the displayed strategy attain approximately 1.299 rather than the claimed 2.598 until its normalization is corrected. The explicit four-party implementation costs additive dimension 8 rather than 6 as written, although moving the final binary measurement to the last sender and communicating its outcome repairs the budget. Table 2 incorrectly labels deterministic-strategy enumeration counts as numbers of distinct correlation vertices.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 13 pages, 2 figures