2016/06/01 by Koji Azuma, Go Kato
Computer Science · Engineering · Physics and Astronomy · #Computer network #Computer science #Molecular Communication and Nanonetworks #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum capacity #Quantum channel #Quantum entanglement #Quantum information #Quantum information science #Quantum mechanics #Quantum network #quant-ph
paper · pdf · doi:10.1103/physreva.96.032332
published as Phys. Rev. A 96, 032332 (2017) · 5 pages, 2 figures
arxiv created 2016/06/01 · openalex publication_date 2017/09/22 · arxiv updated 2017/09/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
The quantum internet holds promise for accomplishing quantum teleportation and unconditionally secure communication freely between arbitrary clients all over the globe, as well as the simulation of quantum many-body systems. For such a quantum internet protocol, a general fundamental upper bound on the obtainable entanglement or secret key has been derived [K. Azuma, A. Mizutani, and H.-K. Lo, Nat. Commun. 7, 13523 (2016)]. Here we consider its converse problem. In particular, we present a universal protocol constructible from any given quantum network, which is based on running quantum repeater schemes in parallel over the network. For arbitrary lossy optical channel networks, our protocol has no scaling gap with the upper bound, even based on existing quantum repeater schemes. In an asymptotic limit, our protocol works as an optimal entanglement or secret-key distribution over any quantum network composed of practical channels such as erasure channels, dephasing channels, bosonic quantum amplifier channels, and lossy optical channels.