The distribution of entangled qubits over a noisy quantum channel and its evaluation with a quality metric as the fidelity is a key enabler of future quantum internet. We use a noisy entanglement pair generator providing pairs with dynamic fidelity. Furthermore, we model and implement the quantum channel as a rotational gate which negatively affects the distributed pair’s fidelity over time. Thus, forcing favourable and non-favourable times for the distribution of entanglement in terms of its fidelity. In this dynamic context, the entangled qubits are sequentially generated and distributed, revealing a frame with a certain number of distributed entangled pairs. A frame’s associated fidelity is fundamental to assessing the quality of the distributed pairs. It is computed by measuring a subset of the frame’s entangled pairs; therefore implying an overhead and leaving an effective payload of distributed entangled pairs. Additionally, the accuracy of the estimated frame’s fidelity depends on the amount of measured entangled pairs implying a trade-off between overhead and accuracy. In this work, we analyze the distribution of entanglement for the proposed dynamics by estimating the associated fidelity of frames with varying lengths at different operational points.
The distribution of entangled qubits over a noisy quantum channel and its evaluation with a quality metric as the fidelity is a key enabler of future quantum internet. We use a noisy entanglement pair generator providing pairs with dynamic fidelity. Furthermore, we model and implement the quantum channel as a rotational gate which negatively affects the distributed pair’s fidelity over time. Thus, forcing favourable and non-favourable times for the distribution of entanglement in terms of its fidelity. In this dynamic context, the entangled qubits are sequentially generated and distributed, revealing a frame with a certain number of distributed entangled pairs. A frame’s associated fidelity is fundamental to assessing the quality of the distributed pairs. It is computed by measuring a subset of the frame’s entangled pairs; therefore implying an overhead and leaving an effective payload of distributed entangled pairs. Additionally, the accuracy of the estimated frame’s fidelity depends on the amount of measured entangled pairs implying a trade-off between overhead and accuracy. In this work, we analyze the distribution of entanglement for the proposed dynamics by estimating the associated fidelity of frames with varying lengths at different operational points.
This work introduces a compact framework for analyzing asynchronous entanglement distribution protocols under realistic error models. We focus on two contemporary protocols: sequential, where entanglement is established one node at a time, and parallel, where all nodes attempt to generate entanglement simultaneously. We derive an analytical expression for the fidelity of distributed entangled states, showing that the fidelity depends only on the total time all qubits spend in memory, rather than the individual memory times for each qubit. This result distills the complex dynamics of entanglement distribution into a compact accessible form, providing an scalable tool for evaluating protocol efficiency. Using this lightweight framework, we analyze the performance of parallel and sequential protocols, demonstrating that parallel distribution consistently outperforms sequential and highlighting the potential of parallel protocols for practical quantum network implementations.
Quantum networks intersect a paradigmatic shift in communication technologies, offering unprecedented capabilities for secure communication and distributed computation through the exploitation of quantum mechanical phenomena.These networks facilitate revolutionary and unlimited of possibility applications such as quantum key distribution (QKD), distributed quantum computing (DQC), quantum teleportation (QT), quantum clock synchronization (QCS), etc. -all fundamentally predicated on quantum entanglement as their operational cornerstone.Moreover, on the contrary with classical computer communication protocol, quantum networks have the fundamental no-cloning theorem in the quantum mechanic prohibits conventional signal amplification techniques, necessitating the development of quantum-native routing strategies that operate within these unique constraints.However, the practical realization of quantum networks until now still faces a crucial challenge: The reliability and efficient distribution of highfidelity entangled quantum states across long distances.Due to this distribution, the process faces intrinsic limitations arising from quantum decoherence, photonic loss in transmission channels, and the inherently probabilistic nature of entanglement generation protocols.In quantum communication, fidelity serves as a fundamental metric, representing the degree of similarity or correlation between the actual distributed entangled state and an ideal maximally entangled Bell pair.Fidelity is a crucial measure of the quality of quantum states in a network since it directly affects the reliability and effectiveness of quantum communication protocols.High fidelity ensures that the transmitted entangled states maintain their quantum properties, closely resembling the ideal Bell pair, and are thus suitable for performing secure and efficient quantum operations.Latency, on the other hand, refers to the total time delay involved in the entire process of entanglement establishment, from the initial creation of the entangled pairs to the final verification and confirmation of the entanglement quality.This includes several distinct components: the physical propagation delay, which accounts for the time it takes for quantum information to travel through the communication channel (such as optical fibers); the entanglement generation time, which involves the probabilistic creation of entangled states between quantum nodes; and the quantum memory storage time, which reflects the duration for which quantum states I
End-to-end entanglement distribution is a key capability of upcoming quantum networks, enabling applications like distributed quantum computing, quantum sensor networks, and secure communications. Hence, its realistic and efficient simulation is crucial for quantum network design and for assessing the ability of a network to run certain applications. This work provides tools to scale-up and improve the realism of entanglement generation simulations in quantum networks. This is achieved by deriving analytical results that directly return the success probability, the output state and corresponding fidelity of a selected entanglement generation protocol, while accounting for a variety of noise sources affecting the protocol. These results are then integrated and streamlined in an upgraded version of SeQUeNCe, one of the most popular quantum network simulators. The resulting simulator features increased scalability by reducing computation time by more than 60%, while allowing for a variety of realistic noise sources, including imperfect mode matching, dark counts, and imperfect memory initialization. The simulator is also benchmarked with real experimental data and is capable of replicating the average entanglement generation time and the final state fidelity of a selected experiment. Altogether, the results can enhance current quantum network simulation capabilities towards large-scale networks, paving the way for the future quantum internet.
Fidelity estimation is a crucial component for the quality control of entanglement distribution networks. This work studies a scenario in which multiple nodes share noisy Greenberger-Horne-Zeilinger (GHZ) states. Due to the collapsing nature of quantum measurements, the nodes randomly sample a subset of noisy GHZ states for measurement and then estimate the average fidelity of the unsampled states conditioned on the measurement outcome. By developing a fidelity-preserving diagonalization operation, analyzing the Bloch representation of GHZ states, and maximizing the Fisher information, the proposed estimation protocol achieves the minimum mean squared estimation error in a challenging scenario characterized by arbitrary noise and the absence of prior information. Additionally, this protocol is implementation-friendly as it only uses local Pauli operators according to a predefined sequence. Numerical studies demonstrate that, compared to existing fidelity estimation protocols, the proposed protocol reduces estimation errors in both scenarios involving independent and identically distributed (i.i.d.) noise and correlated noise.
Fidelity estimation is essential for the quality control of entanglement distribution networks. Because measurements collapse quantum states, we consider a setup in which nodes randomly sample a subset of the entangled qubit pairs to measure and then estimate the average fidelity of the unsampled pairs conditioned on the measurement outcome. The proposed estimation protocol achieves the lowest mean-square estimation error in a difficult scenario with arbitrary noise and no prior information. Moreover, this protocol is implementation friendly because it only performs local Pauli operators according to a predefined sequence. Numerical studies show that compared to existing fidelity estimation protocols, the proposed protocol reduces the estimation error in both scenarios with independent and identically distributed noise and correlated noise.
The reliable distribution of entanglement is essential for the effective operation of quantum networks. Due to fundamental differences between quantum and classical communication systems, it is necessary to develop specialised algorithms and protocols that also account for quantum-specific constraints. In this work, we focus on the issue of recalibration. As suggested by recent experimental studies, the process of local entanglement generation in a quantum link degrades over time due to environmental changes that have to be estimated and compensated via a fixed-duration calibration operation, during which the link is not available. Therefore, in such a quantum network, every link alternates between an activation period, during which it operates normally, and a calibration period, during which it cannot participate in the end-to-end entanglement distribution, thereby creating a trade-off between link quality (the initial fidelity of generated pairs, which decays during activation) and availability (the fraction of time the link is usable, which calibration reduces). We develop analytically a protocol for optimally assigning activation periods to each link in linear quantum repeater chains, subject to any general end-to-end fidelity requirements and local initial fidelity thresholds. Building on this foundation, we extend to general quantum networks, where multiple paths may cross at common links. To this, we propose a heuristic approach, evaluate it through simulations, and compare its performance with a benchmark, a numerical approach and theoretical bounds, confirming the analytical ordering of their performance.