A probability-based optimization model of entanglement distribution and quantum source positioning on quantum communication networks. The overall probabilistic model is derived first to include the overall effect of fiber attenuation, depolarizing noise, dephasing effects, loss of photon generation in the qubit generation, and imperfections in teleportation on successful qubit reception. According to this model, a mixed-integer non-linear programming model is formulated, which simultaneously optimizes the placement of quantum sources and equitable photon-pair scheduling of nodepairs. In order to work around the non-convexity, a structured solution method based on a combination of Block Coordinate Descent, Karush-Kuhn-Tucker conditions and Successive Convex Approximation is suggested. The simulation outcomes show that centroid-based placement is only adequate when dealing with small-scale networks but probability-based optimal positioning effectively enhances entanglement throughput in larger deployments especially in higher attenuation and dephasing environments. The results offer theoretical and practical information to be used in scalable and reliability-conscious development of next-generation quantum communication infrastructures.
A probability-based optimization model of entanglement distribution and quantum source positioning on quantum communication networks. The overall probabilistic model is derived first to include the overall effect of fiber attenuation, depolarizing noise, dephasing effects, loss of photon generation in the qubit generation, and imperfections in teleportation on successful qubit reception. According to this model, a mixed-integer non-linear programming model is formulated, which simultaneously optimizes the placement of quantum sources and equitable photon-pair scheduling of nodepairs. In order to work around the non-convexity, a structured solution method based on a combination of Block Coordinate Descent, Karush-Kuhn-Tucker conditions and Successive Convex Approximation is suggested. The simulation outcomes show that centroid-based placement is only adequate when dealing with small-scale networks but probability-based optimal positioning effectively enhances entanglement throughput in larger deployments especially in higher attenuation and dephasing environments. The results offer theoretical and practical information to be used in scalable and reliability-conscious development of next-generation quantum communication infrastructures.
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.
Future quantum networks will support not only point-to-point communication but also multiparty applications, such as multiparty quantum key distribution and quantum secret sharing. While bipartite entanglement routing has been studied extensively, multipartite routing with probabilistic link generation and fusion operations has not been previously addressed. This paper proposes a routing model for multipartite entanglement distribution, formulated as an optimization problem using a mixed-integer linear programming problem. This model explicitly incorporates the probabilistic nature of quantum operations, aiming to maximize the probability of successfully distributing a multipartite entangled state, particularly the Greenberger-Horne-Zeilinger state, to all requesting users. Maximizing this probability is essential for ensuring the feasibility and robustness of multiparty quantum communication in practical networks, thereby enabling the reliable execution of multiparty quantum applications. Numerical results show that the proposed model improves the success probability and maintains robustness across diverse network conditions, including scenarios with stringent quantum memory limitations and relatively large terminal sets.
Quantum networks enable secure communication and distributed quantum computation using entanglement, quantum teleportation, and the no-cloning theorem. Future quantum networks will support multiparty applications such as multiparty quantum key distribution and quantum secret sharing, which require simultaneous entanglement distribution among multiple users. Therefore, efficient routing that accounts for quantum network constraints is crucial for practical multiparty quantum communications. Although bipartite entanglement routing has been studied extensively, multipartite entanglement routing with probabilistic quantum link generation and fusion operations remains inadequately addressed. This paper proposes a routing model for multipartite entanglement distribution that explicitly incorporates the probabilistic nature of quantum operations and maximizes the probability of successfully distributing a Greenberger-Horne-Zeilinger (GHZ) state to all requesting users under practical quantum network constraints. We formulate this model as a mixed-integer linear programming (MILP) problem. We prove that finding the optimal Steiner entanglement tree under the proposed model is NP-hard. For large-scale scenarios where MILP becomes computationally intractable, we develop a heuristic approach. Numerical results demonstrate that the proposed model achieves a higher entanglement tree success probability and greater robustness than baseline methods across diverse network conditions, including scenarios with stringent quantum memory constraints and large terminal sets.
Quantum communication networks are emerging as a promising technology that could constitute a key building block in future communication networks in the 6G era and beyond. These networks have an inherent feature of parallelism that allows them to boost the capacity and enhance the security of communication systems. Recent advances led to the deployment of small- and large-scale quantum communication networks with real quantum hardware. In quantum networks, entanglement is a key resource that allows for data transmission between different nodes. However, to reap the benefits of entanglement and enable efficient quantum communication, the number of generated entangled pairs must be optimized. Indeed, if the entanglement generation rates are not optimized, then some of these valuable resources will be discarded and lost. In this paper, the problem of optimizing the entanglement generation rates and their distribution over a quantum memory is studied. In particular, a quantum network in which users have heterogeneous distances and applications is considered. This problem is posed as a mixed integer nonlinear programming optimization problem whose goal is to efficiently utilize the available quantum memory by distributing the quantum entangled pairs in a way that maximizes the user satisfaction. An interior point optimization method is used to solve the optimization problem and extensive simulations are conducted to evaluate the effectiveness of the proposed system. Simulation results show the key design considerations for efficient quantum networks, and the effect of different network parameters on the network performance.
Entanglement distribution is a fundamental building block of quantum communication networks, enabling the secure and reliable exchange of quantum information over long distances. Unlike classical communication, quantum networks exploit the unique properties of quantum entanglement to support applications such as quantum key distribution, quantum teleportation, distributed quantum computing, and networked quantum sensing. Although significant progress has been made in recent years, the efficient generation, transmission, and preservation of entangled states remain major research challenges due to photon loss, decoherence, and limitations in current communication infrastructure.This review provides a comprehensive overview of entanglement distribution in quantum communication networks, focusing on the technologies that enable practical implementation and the latest experimental developments. It discusses key approaches for generating and distributing entangled photons through optical fibers, free-space links, and satellite-based communication, together with supporting technologies such as quantum repeaters, quantum memories, and photonic devices. The review also examines recent experimental demonstrations that have advanced long-distance quantum communication while highlighting the technical barriers that must be overcome for large-scale deployment. Finally, emerging applications and future research directions are presented, including the development of scalable quantum networks, the quantum internet, and secure global communication systems. This review aims to provide researchers and students with a clear understanding of the current state of entanglement distribution and its growing role in next-generation quantum communication technologies.
Entanglement distribution is a crucial problem in quantum information science, owing to the essential role that entanglement plays in enabling advanced quantum protocols, including quantum teleportation and quantum cryptography. We investigate strategies for distributing quantum entanglement between two distant parties through noisy quantum channels. Specifically, we compare two configurations: one where the entanglement source is placed at the midpoint of the communication line, and another where it is located at one end. For certain families of qubit channels we show analytically that the midpoint strategy is optimal. Based on extensive numerical analysis, we conjecture that this strategy is generally optimal for all qubit channels. Focusing on the midpoint configuration, we develop semidefinite programming (SDP) techniques to assess whether entanglement can be successfully distributed through the network, and to quantify the amount of entanglement that can be distributed in the process. In many relevant cases the SDP formulation reliably captures the maximal amount of entanglement which can be distributed, if entanglement is quantified using the negativity. We analyze several channel models and demonstrate that, for various combinations of amplitude damping and depolarizing noise, entanglement distribution is only possible with weakly entangled input states. Excessive entanglement in the input state can hinder the channel's ability to establish entanglement. Our findings have implications for optimizing entanglement distribution in realistic quantum communication networks.