arXiv:2609.32024
Robust Entanglement Witnessing via Dense Network Coding with Graph States
Brian Doolittle, Ian George
Abstract
Practical tests for witnessing entanglement in the presence of noise are needed to verify and apply entanglement-based applications in real-world communication networks. Quantum dense network coding is a communication protocol that uses an entangled state preparation together with quantum communication to halve the amount of communication needed to evaluate certain bijective functions in networks having multiple senders and one receiver. In this work, we consider a dense network coding protocol that uses graph state entanglement to implement a family of affine transformations, we derive a bound on the success probability that can be achieved by classical networks, and we show that the noise robustness exponentially amplifies with the number of senders. We apply our results in a semi-device-independent protocol for robustly estimating the effective visibility of graph states and measurement bases. Overall, our approaches are robust to noise, can support the usage of uncharacterized state preparations or measurements, and can be applied to any graph state.
AI Summary
The paper studies whether graph-state-assisted distributed computation can certify entanglement under communication-dimension constraints, including with uncharacterized preparations or measurements. It considers $n$ senders, each receiving $(x_i,y_i)\in\mathbb Z_d^2$, and one receiver tasked with computing $g^{A}(x,y)=y-Ax\pmod d$ for a weighted graph adjacency matrix $A$. A shared graph state, local Weyl encodings, transmission of one qudit per sender, and a joint graph-basis measurement compute this function perfectly. For graphs without isolated vertices, zero-error classical computation requires $2n$ dits, versus $n$ transmitted qudits. The central claimed bound is $P_S\le d^{-m}$ for $m$ the maximum induced-matching size, covering classical communication even with nonsignaling assistance and quantum communication without sender entanglement. Its derivation combines conditional-bijectivity bounds for individual edges with a claimed multiplicative decomposition over induced-matching edges. Explicit classical encodings establish tightness for several graph families. Under global depolarizing noise, success is $v+(1-v)d^{-n}$, giving the sufficient visibility threshold $v>(d^{n-m}-1)/(d^n-1)$. This decreases exponentially when $m=\Theta(n)$, but approaches $1/d$ for GHZ and uniformly weighted complete graphs. The score also defines an effective visibility; with ideal graph-basis measurements it equals graph-state fidelity after rescaling. Certification assumes the network topology and communication dimensions, excluding hidden side channels and sender–receiver entanglement. Communication advantage does not generally certify genuine multipartite entanglement. Interpreting effective visibility as preparation or measurement visibility uses a depolarizing model. Joint entangled measurements, synchronization, loss handling, and error correction remain implementation challenges.
Error found: Exponential improvement with sender number is established for graph families whose maximum induced matching grows linearly, whereas GHZ and uniformly weighted complete graphs have thresholds tending to 1/d. The demonstrated exponential noise tolerance concerns global depolarization and does not establish comparable scaling under independent local noise or loss. The appendix's guessing-probability factorization is not justified by output independence alone, although grouping matching endpoints and applying conditional bijectivity directly repairs the MIM bound. The visibility-calibration discussion incorrectly treats division by a lower bound on measurement visibility as an improved lower bound on preparation visibility; within its noise model, it instead gives an upper bound.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 23 pages, 5 figures, 3 tables