Shortcuts to quantum network routing
arXiv:1610.05238
Abstract
A quantum network promises to enable long distance quantum communication, and assemble small quantum devices into a large quantum computing cluster. Each network node can thereby be seen as a small few qubit quantum computer. Qubits can be sent over direct physical links connecting nearby quantum nodes, or by means of teleportation over pre-established entanglement amongst distant network nodes. Such pre-shared entanglement effectively forms a shortcut - a virtual quantum link - which can be used exactly once. Here, we present an abstraction of a quantum network that allows ideas from computer science to be applied to the problem of routing qubits, and manage entanglement in the network. Specifically, we consider a scenario in which each quantum network node can create EPR pairs with its immediate neighbours over a physical connection, and perform entanglement swapping operations in order to create long distance virtual quantum links. We proceed to discuss the features unique to quantum networks, which call for the development of new routing techniques. As an example, we present two simple hierarchical routing schemes for a quantum network of N nodes for a ring and sphere topology. For these topologies we present efficient routing algorithms requiring O(log N) qubits to be stored at each network node, O(polylog N) time and space to perform routing decisions, and O(log N) timesteps to replenish the virtual quantum links in a model of entanglement generation.
29+16 pages, Comments very welcome!
References in corpus (7)
- Cavity-based quantum networks with single atoms and optical photons
- System Design for a Long-Line Quantum Repeater
- Entanglement percolation in quantum complex networks
- Fundamental rate-loss tradeoff for the quantum internet
- Aggregating quantum repeaters for the quantum internet
- Capacities of repeater-assisted quantum communications
- Quantum Capacities for Entanglement Networks
Cited by in corpus (25)
- Entanglement-Assisted Quantum Networks: Mechanics, Enabling Technologies, Challenges, and Research Directions
- Automated distribution of quantum circuits via hypergraph partitioning
- Distributing Graph States Over Arbitrary Quantum Networks
- Decentralized Base-Graph Routing for the Quantum Internet
- Tools for quantum network design
- Opportunistic Entanglement Distribution for the Quantum Internet
- On the Stochastic Analysis of a Quantum Entanglement Switch
- Optimising repeater schemes for the quantum internet
- Experimental Quantum Network Coding
- Modeling of Measurement-based Quantum Network Coding on IBM Q Experience Devices
- Entanglement Accessibility Measures for the Quantum Internet
- Adaptive Routing for Quantum Memory Failures in the Quantum Internet
- Influence of noise in entanglement-based quantum networks
- Pre-Distribution of Entanglements in Quantum Networks
- Quantum Internet Addressing
- Limitations of nearest-neighbour quantum networks
- Rates of multi-partite entanglement transformations and applications in quantum networks
- Theory of Noise-Scaled Stability Bounds and Entanglement Rate Maximization in the Quantum Internet
- Quantum Internet: The Future of Internetworking
- Complex quantum network models from spin clusters
- Entanglement generation in a quantum network with finite quantum memory lifetime
- Modeling and Designing Routing Protocols in Quantum Networks
- On the Bipartite Entanglement Capacity of Quantum Networks
- A Linear Algebraic Framework for Dynamic Scheduling Over Memory-Equipped Quantum Networks
- Generating EPR-pairs from an -party resource state