Topology Adaption for the Quantum Internet
arXiv:1809.02928 · doi:10.1007/s11128-018-2064-x
Abstract
In the quantum repeater networks of the quantum Internet, the varying stability of entangled quantum links makes dynamic topology adaption an emerging issue. Here we define an efficient topology adaption method for quantum repeater networks. The model assumes the random failures of entangled links and several parallel demands from legal users. The shortest path defines a set of entangled links for which the probability of stability is above a critical threshold. The scheme is utilized in a base-graph of the overlay quantum network to provide an efficient shortest path selection for the demands of all users of the network. We study the problem of entanglement assignment in a quantum repeater network, prove its computational complexity, and show an optimization procedure. The results are particularly convenient for future quantum networking, quantum-Internet, and experimental long-distance quantum communications.
arXiv comment17 pages, Journal-ref: Quant. Inf. Proc. (2018)
References in corpus (25)
- The Quantum Internet
- Quantum Machine Learning
- Review article: Linear optical quantum computing
- Quantum Communication
- Quantum principal component analysis
- General Benchmarks for Quantum Repeaters
- Fundamental Limits of Repeaterless Quantum Communications
- The capacity of the noisy quantum channel
- Experimental demonstration of a BDCZ quantum repeater node
- Functional Quantum Nodes for Entanglement Distribution over Scalable Quantum Networks
- A Survey on Quantum Channel Capacities
- Ultrafast and Fault-Tolerant Quantum Communication across Long Distances
- Path Selection for Quantum Repeater Networks
- System Design for a Long-Line Quantum Repeater
- Quantum network communication -- the butterfly and beyond
- Theory of channel simulation and bounds for private communication
- Prior entanglement between senders enables perfect quantum network coding with modification
- General bounds for sender-receiver capacities in multipoint quantum communications
- Decentralized Base-Graph Routing for the Quantum Internet
- Perfect Quantum Network Communication Protocol Based on Classical Network Coding
- Entanglement-Gradient Routing for Quantum Networks
- General Scheme for Perfect Quantum Network Coding with Free Classical Communication
- Entanglement Availability Differentiation Service for the Quantum Internet
- Multi-copy and stochastic transformation of multipartite pure states
- Multilayer Optimization for the Quantum Internet
Cited by in corpus (9)
- Towards a Distributed Quantum Computing Ecosystem
- A quantum network stack and protocols for reliable entanglement-based networks
- Opportunistic Entanglement Distribution for the Quantum Internet
- Entanglement Access Control for the Quantum Internet
- Optimizing High-Efficiency Quantum Memory with Quantum Machine Learning for Near-Term Quantum Devices
- Entanglement Accessibility Measures for the Quantum Internet
- Quantum State Optimization and Computational Pathway Evaluation for Gate-Model Quantum Computers
- Adaptive Routing for Quantum Memory Failures in the Quantum Internet
- A Poisson Model for Entanglement Optimization in the Quantum Internet