Concurrence Percolation in Quantum Networks
Xiangyi Meng, Jianxi Gao, Shlomo Havlin

TL;DR
This paper introduces concurrence percolation theory (ConPT), a novel framework for understanding entanglement transmission in quantum networks that predicts lower thresholds for successful communication than classical models.
Contribution
The paper develops a new statistical theory, ConPT, that generalizes classical percolation to quantum entanglement, revealing a quantum advantage in network connectivity thresholds.
Findings
ConPT predicts lower entanglement transmission thresholds than classical percolation.
ConPT demonstrates universal critical behavior in various network geometries.
Quantum networks can achieve entanglement distribution more efficiently than classical predictions.
Abstract
Establishing long-distance quantum entanglement, i.e., entanglement transmission, in quantum networks (QN) is a key and timely challenge for developing efficient quantum communication. Traditional comprehension based on classical percolation assumes a necessary condition for successful entanglement transmission between any two infinitely distant nodes: they must be connected by at least a path of perfectly entangled states (singlets). Here, we relax this condition by explicitly showing that one can focus not on optimally converting singlets but on establishing concurrence -- a key measure of bipartite entanglement. We thereby introduce a new statistical theory, concurrence percolation theory (ConPT), remotely analogous to classical percolation but fundamentally different, built by generalizing bond percolation in terms of "sponge-crossing" paths instead of clusters. Inspired by…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
