Quantum Entanglement Percolation

Abstract

Quantum communication demands efficient distribution of quantum entanglement across a network of connected partners. The search for efficient strategies for the entanglement distribution may be based on percolation theory, which describes evolution of network connectivity with respect to some network parameters. In this framework, the probability to establish perfect entanglement between two remote partners decays exponentially with the distance between them before the percolation transition point, which unambiguously defines percolation properties of any classical network or lattice. Here we introduce quantum networks created with local operations and classical communication, which exhibit non-classical percolation transition points leading to the striking communication advantages over those offered by the corresponding classical networks. We show, in particular, how to establish perfect entanglement between any two nodes in the simplest possible network -- the 1D chain -- using imperfect entangled pairs of qubits.

5 pages, 2 figures

References in corpus (7)

• The Quantum Internet
• Quantum Computing
• Explosive Percolation: Novel critical and supercritical phenomena
• Entanglement Distribution in Pure-State Quantum Networks
• Small-World Bonds and Patchy Percolation on the Hanoi Network
• Limited path entanglement percolation in quantum complex networks
• Structural Complexity Of Quantum Networks

Cited by in corpus (6)

• Any Quantum Network is Structurally Controllable by a Single Driving Signal
• Complex Quantum Networks: a Topical Review
• Deterministic Entanglement Distribution on Series-Parallel Quantum Networks
• Gossip Algorithms in Quantum Networks
• Percolation Transition Control in Quantum Networks
• Entanglement percolation in random quantum networks