• Corpus ID: 2816787

Shortcuts to quantum network routing

@article{Schoute2016ShortcutsTQ,
  title={Shortcuts to quantum network routing},
  author={Eddie Schoute and Laura Man{\vc}inska and Tanvirul Islam and Iordanis Kerenidis and Stephanie Wehner},
  journal={ArXiv},
  year={2016},
  volume={abs/1610.05238}
}
Communication is a key part of society that we make huge investments in. Each message has to both arrive quickly and use minimal network resources. Moreover, communications must sometimes also remain private, so encryption is used to prevent third parties from listening in. However, standard classical encryption protocols are proven not to be secure against quantum adversaries. With quantum communication we have a method that does provably attains perfect secrecy, even against adversaries with… 

Tables from this paper

Quantum Internet: The Future of Internetworking
TLDR
This chapter aims to present the main concepts, challenges, and opportunities for research in quantum information, quantum computing and quantum networking by paralleling theoretical and experimental work on physical layers and low-level error management and connection technologies.
Quantum network routing and local complementation
TLDR
This paper proposes a more general method for establishing EPR pairs in arbitrary networks that uses a graph state instead of maximally entangled pairs to achieve long-distance simultaneous communication, and demonstrates how graph-theoretic tools, and specifically local complementation, help decrease the number of required measurements compared to usual methods applied in repeater schemes.
Designing aQuantum Network Protocol
TLDR
A quantum data plane protocol that enables end-to-end quantum communication and can serve as a building block for more complex services is developed that is designed to be efficient in the face of short quantum memory lifetimes.
Maximizing Entanglement Routing Rate in Quantum Networks: Approximation Algorithms
TLDR
This paper formulate the MERR problem using an integer linear programming model to capture the traffic patent for all demands in the quantum network, and devise two algorithms including HBRA and RRA with provable approximation ratios for the objective function to solve the problem.
Designing a quantum network protocol
TLDR
This paper develops a quantum data plane protocol that enables end-to-end quantum communication and can serve as a building block for more complex services and shows that the protocol remains functional on the extremely resource limited hardware that is being developed today.
Entanglement-Enhanced Communication Networks
TLDR
It is argued that exactly these two figures of merit should be used again for the conception of new communication standards, and two new initial stages of development of the quantum Internet are defined, where in the first phase entanglement is only generated and used between network nodes, and in second phaseEntanglement swapping and thus distribution of entanglements over increasing distances becomes possible.
Concurrent Entanglement Routing for Quantum Networks: Model and Designs
TLDR
Evaluation results show that the proposed algorithm Q-CAST increases the number of successful long-distance entanglements by a big margin compared to other methods, and may encourage more network researchers to study the entanglement routing problem.
Distributed Routing in a Quantum Internet
TLDR
The objective is to find protocols, that minimise the latency of the network to serve a request to create entanglement between two distant nodes in the network, and proposes three routing algorithms that behave far better than the existing classical greedy routing algorithm.
Online Entanglement Routing in Quantum Networks
TLDR
This work demonstrates that OER not only outperforms two representative heuristics by up to 61.27% and 52.79%, respectively, in terms of average request completion time, but also achieves a better fairness performance than these two counterparts.
Modeling and Designing Routing Protocols in Quantum Networks
TLDR
This work focuses on the entanglement routing problem, whose objective is to build long-distance entanglements for the concurrent source-destination pairs through multiple hops, and presents a comprehensive entangler routing model that reflects the differences between quantum networks and classical networks and new entangled routing algorithms that utilize the unique properties of quantum networks.
...
...

References

SHOWING 1-10 OF 87 REFERENCES
Aggregating quantum repeaters for the quantum internet
TLDR
This work presents a universal protocol constructible from any given quantum network, which is based on running quantum repeater schemes in parallel over the network, and works as an optimal entanglement or secret-key distribution over any quantum network composed of practical channels.
Quantum Router with Network Coding
TLDR
This work describes how a scheme to distribute general two-colorable graph states via quantum routers with network coding can be constructed from classical linear network codes and shows that for any stabilizer error correction code there exists a corresponding quantum network code with similar error correcting capabilities.
Large-scale quantum networks based on graphs
TLDR
This work shows 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, and protects against errors via encoding.
Inside Quantum Repeaters
Most quantum communication tasks need to rely on the transmission of quantum signals over long distances. Unfortunately, transmission of such signals is most often limited by losses in the channel,
Quantum Network Communication—The Butterfly and Beyond
TLDR
Routing is proved optimal, and the free assisting classical communication can at best be used to modify the directions of quantum channels in the network.
Quantum Network Coding
TLDR
It is shown that quantum network coding is possible if approximation is allowed, by using a simple network model called Butterfly, and several impossibility results including the general upper bound of the fidelity are given.
Perfect quantum network communication protocol based on classical network coding
TLDR
It is proved that a lower bound of the rate at which this quantum communication task is possible is given by the classical min-cut max-flow theorem of network coding, where the capacities in question are the quantum capacities of the edges of the network.
Robust entanglement distribution via quantum network coding
TLDR
This work describes how a scheme to distribute general two-colourable graph states via quantum routers with network coding can be constructed from classical linear network codes and shows that for any stabilizer error correction code there exists a corresponding quantum network code with similar error correcting capabilities.
Fundamental rate-loss trade-off for the quantum internet
TLDR
This work derives a fundamental rate-loss trade-off for a quantum internet protocol, by generalizing the Takeoka–Guha–Wilde bound to be applicable to any network topology, and enables to grasp the potential of the future quantum internet.
...
...