Key points are not available for this paper at this time.
Quantum Internet (QI) is a system of interconnected quantum computers able to exchange information encoded in the so called quantum bits (qubits). Differently from the classical counterpart, qubits benefit from a manifold properties guaranteed by quantum mechanics, such as superposition and entanglement. Despite the fact that quantum networks bring significant advantages, several phenomena can negatively impact the overall system, potentially hindering communication. In order to evaluate the network performance, a comprehensive probability expression is derived in this work to ultimately determine how many qubits are expected to be successfully received by nodes. On this basis, a Mixed-Integer Non-Linear Programming (MINLP) problem is formulated to fairly maximize the qubits exchanged between node pairs and jointly optimize (i) the position of the quantum source, and (ii) the entanglement distribution plan. To cope with the non-convexity of the problem, an iterative optimization algorithm, leveraging Block Coordinate Descendent (BCD) and Successive Convex Approximation (SCA) techniques, is proposed. A thorough simulation campaign is conducted to corroborate the theoretical findings. Numerical results demonstrates, under different parameter setups, that the proposed algorithm provides superior performance with respect to a baseline approach.
Iacovelli et al. (Thu,) studied this question.