2015/04/30 by Michael Epping, Hermann Kampermann, Dagmar Bruß · 51 citations
Computer Science · Physics and Astronomy · #Bipartite graph #Multipartite #Multipartite entanglement #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum capacity #Quantum entanglement #Quantum information #Quantum key distribution #Quantum network #quant-ph
paper · pdf · doi:10.1088/1367-2630/18/5/053036
published in New Journal of Physics 18(5), 053036 (IOP Publishing) · 11 pages, 5 figures, 2 tables, revised text and new results regarding the optimisation of quantum networks
arxiv created 2016/02/16 · openalex publication_date 2016/05/26 · arxiv updated 2016/05/27 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05
Society relies and depends increasingly on information exchange and communication. In the quantum world, security and privacy is a built-in feature for information processing. The essential ingredient for exploiting these quantum advantages is the resource of entanglement, which can be shared between two or more parties. The distribution of entanglement over large distances constitutes a key challenge for current research and development. Due to losses of the transmitted quantum particles, which typically scale exponentially with the distance, intermediate quantum repeater stations are needed. Here we show how to generalise the quantum repeater concept to the multipartite case, by describing large-scale quantum networks, i.e. network nodes and their long-distance links, consistently in the language of graphs and graph states. This unifying approach comprises both the distribution of multipartite entanglement across the network, and the protection against errors via encoding. The correspondence to graph states also provides a tool for optimising the architecture of quantum networks.