Improved Simulation of Asynchronous Entanglement Distribution in Noisy Quantum Networks

2025-07-30

AI Summary

This work addresses the performance evaluation of asynchronous entanglement distribution protocols in noisy quantum networks. We propose a lightweight simulation framework that abstracts complex quantum processes into memory-time modeling, significantly improving simulation efficiency. The framework incorporates realistic physical noise models and employs two key metrics: distributed entanglement fidelity and hash rate—defined as the effective entanglement generation rate. Using these metrics, we systematically compare sequential and parallel protocols across varying network sizes and noise levels. Experimental results demonstrate that the parallel protocol consistently outperforms the sequential one in hash rate, achieving notably reduced execution time—especially under high noise or at large network scales. These findings validate the practical efficiency and feasibility of parallel strategies for real-world quantum internet deployment. Moreover, our framework establishes a scalable, physics-informed evaluation paradigm for asynchronous entanglement distribution protocols, offering a new direction for protocol design and optimization.

Technology Category

Search and Optimization: Distributed SearchMachine Learning: Quantum Machine LearningConstraint Satisfaction and Optimization: Distributed CSP/Optimization

Application Category

Search and Retrieval-Augmented AI: Web evaluation methodologies and metricsSystems and Infrastructure for Web, Mobile and WoT: Web performance, measurement, and characterizationSecurity and Privacy: Large-scale security measurements

Abstract

This work introduces a lightweight simulation framework for evaluating 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 evaluate the performance of each protocol using two key metrics: the fidelity of distributed entangled states, and the hashing rate, a measure of entanglement efficiency. These metrics are compared between both protocols across a range of network sizes and noise parameters. We demonstrate that the parallel protocol consistently outperforms the sequential, particularly in the hashing rate metric due to reduced runtime, suggesting that parallel protocols are a strong candidate for a realizable quantum Internet. Our framework offers an accessible and scalable tool for evaluating entanglement distribution strategies, by reducing the simulation of complex quantum processes to simple memory time calculations.

Problem

• Evaluating asynchronous entanglement distribution protocols under noise
• Comparing sequential and parallel protocols for entanglement efficiency
• Providing a scalable simulation framework for quantum network strategies

Innovation

• Lightweight framework simulates noisy quantum networks
• Compares sequential and parallel entanglement protocols
• Reduces quantum processes to memory time calculations