Robust entanglement distribution via quantum network coding

DOI10.1088/1367-2630/18/10/103052MaRDI QIDQ5855113zbMATH OpenOpenAlexFDO

Authors M. Epping, H. Kampermann, D. Bruß

Publication date 12 March 2021

Published in New Journal of Physics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://arxiv.org/abs/1605.08384

Mathematics Subject Classification ID

Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum coding (general) (81P70)

Abstract: Many protocols of quantum information processing, like quantum key distribution or measurement-based quantum computation, "consume" entangled quantum states during their execution. When participants are located at distant sites, these resource states need to be distributed. Due to transmission losses quantum repeater become necessary for large distances (e.g. $gtrsim$ 300 km). Here we generalize the concept of the graph state repeater to $D$-dimensional graph states and to repeaters that can perform basic measurement-based quantum computations, which we call quantum routers. This processing of data at intermediate network nodes is called quantum network coding. We describe how a scheme to distribute general two-colorable graph states via quantum routers with network coding can be constructed from classical linear network codes. The robustness of the distribution of graph states against outages of network nodes is analysed by establishing a link to stabilizer error correction codes. Furthermore we show, that for any stabilizer error correction code there exists a corresponding quantum network code with similar error correcting capabilities.

Recommendations

• Quantum network coding for general repeater networks
• Long range failure-tolerant entanglement distribution
• Quantum network dense coding via continuous-variable graph states
• Quantum network coding on networks with arbitrarily distributed hidden channels
• General Scheme for Perfect Quantum Network Coding with Free Classical Communication

Cites work

• Extreme quantum entanglement in a superposition of macroscopically distinct states
• Graph states for quantum secret sharing
• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• Information theory and network coding
• Insufficiency of Linear Coding in Network Information Flow
• Mathematical Foundations of Computer Science 2003
• Multi-partite quantum cryptographic protocols with noisy GHZ states
• Multiparty entanglement in graph states
• Network Coding
• Network information flow
• Quantum Network Communication—The Butterfly and Beyond
• Stabilizer states and Clifford operations for systems of arbitrary dimensions and modular arithmetic
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels

Cited in

(12)

• Tripartite layered quantum key distribution scheme with a symmetrical key structure
• Recovery of quantum information from a node failure in a graph
• Quantum network coding without loss of information
• Quantum linear network coding as one-way quantum computation
• Network Coding for Distributed Quantum Computation Over Cluster and Butterfly Networks
• Long range failure-tolerant entanglement distribution
• New construction of binary and nonbinary quantum stabilizer codes based on symmetric matrices
• Streaming Universal Distortion-Free Entanglement Concentration
• Multi-partite entanglement can speed up quantum key distribution in networks
• A low complexity scheme for entanglement distributor buses
• Secure quantum network coding based on quantum homomorphic message authentication
• Quantum network coding for general repeater networks

This page was built for publication: Robust entanglement distribution via quantum network coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5855113)