arXiv:2609.26367
An Operator-Theoretic Model of Entanglement Percolation in Series-Parallel Quantum Networks
Kan He, Jinchuan Hou, Yaqi Zhao
Abstract
The realization of entanglement distribution (ED) in large-scale quantum networks (QNs), as a fundamental theoretical framework of quantum communication, faces significant challenges. Percolation theory, drawn from statistical physics, has been identified as a potential solution to this problem. Nevertheless, when addressing ED, percolation theory primarily relies on numerical simulations and approximate algorithms. This approach often lacks interpretability and controllability for many phenomena occurring during the ED process in large-scale networks, including emergent phenomena near the threshold. To address these limitations, in this paper, we {focus on} leveraging operator theory to construct a mathematical framework for entanglement percolation in series-parallel QNs. Through the application of operator-theoretic methodologies, we analyze several critical issues within the entanglement percolation process.
AI Summary
The paper asks how deterministic entanglement distribution in two-terminal series–parallel quantum networks can be described through compositions of swapping and concentration maps, and when end-to-end entanglement survives increasing network length. It formalizes these operations and studies how their execution order affects a chosen entanglement measure. Using existing deterministic protocols for pure qubit/qudit states and two-mode squeezed vacuum states (TMSVSs), it derives scalar series and parallel rules. Series transmission multiplies concurrence, $G$-concurrence, or ratio negativity in the examples considered. Sufficient conditions for order-independent transmission combine three-state order independence with preservation of equal entanglement values. Infinite-chain results follow from convergence of products: $E_n\geq1-(n+1)^{-p}$ with $p>1$ guarantees positive limiting entanglement, whereas $E_n\leq1-(n+1)^{-1}$ forces it to vanish. For identical pure two-qubit resources with concurrence $c$, concentrating $K$ parallel links at each chain segment gives perfect end-to-end transmission when $[(1+\sqrt{1-c^2})/2]^K\leq1/2$. For $K=2$, the threshold is approximately $0.910$. For identical TMSVS resources with ratio negativity $\chi_0>0$, choosing segment widths $K_n=n$ yields nonzero limiting transmission; no fixed finite width gives this for identical finite-squeezing resources. The stated open problems include general topological criteria for scalable networks, order-dependent scalable swapping protocols, alternative architectures, heterogeneous or mixed-state resources, and a complete percolation definition for oscillatory asymptotic behavior. The concrete constructions concern restricted pure-state families and prescribed deterministic protocols.
Error found: The repeater-only trace-preserving map in Eqs. (eq-Lambda)–(eq-SwapPhi), followed by discarding the repeater, leaves the terminals in their original product state and cannot perform the claimed entanglement swapping without the feedforward introduced later. The assertion that network percolation requires independent percolation along every constituent series path is contradicted by the paper's own concentration-assisted DV parallel-then-series construction. The preliminary concurrence definition, its immediately stated two-qubit specialization, and the standard concurrence used later give three inconsistent functions of the same Schmidt probabilities. The infinite-network threshold statement assigns incompatible values at equality, and the exact critical-width formula implies K_c∼4 ln(2)/c² rather than the stated 2 ln(2)/c². The claimed CV limiting ratio negativity of approximately 0.27 for χ_0=0.5 is incompatible with the displayed decreasing product, which is already approximately 0.1692 at three segments.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 55 pages, 19 figures