1. Shortcuts to Quantum Network Routing
- Author
-
Schoute, E. (author) and Schoute, E. (author)
- Abstract
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 unlimited (quantum) computational power. It is, however, infeasible to have a direct quantum connection between all users of quantum communications. We thus look into the possibilities of a \emph{quantum network}, which is able to connect arbitrary users of the network as if they had direct quantum channel available. Once such a quantum network is built, we will need to route quantum messages effectively to their destination. In this work, we take the first step in studying network structures for quantum networks on a high level, and their accompanying routing algorithms. Current ongoing research into quantum communication with satellites and the possibility of a global network made the case of a quantum network of satellites relevant. We will consider a simplified model where each satellite can perform quantum communication with its immediate neighbours, and can create quantum virtual links that form shortcuts through the network. The first step towards a quantum network that we take is the structure of the network. Using virtual links as shortcuts we can reduce the maximum distance between nodes (the diameter) by an exponential factor. Let $|V|$ be the size of the set of all vertices in a graph, equal to the number of satellites. Then for the case of satellites we give a network structure with the following properties: \begin{itemize} \item The diameter of the graph is $4\log_2\left( \frac{|V|-2}{10} \right) +3 = O(\log |V|)$. This means that the distance between any two nod, Cyber Security Group, Intelligent Systems, Electrical Engineering, Mathematics and Computer Science
- Published
- 2015