An efficient Progressive Swapping to the Middle distribution protocol adapted to imperfect quantum memories in quantum networks

• URL: http://arxiv.org/abs/2605.31493v1
• Date: Fri, 29 May 2026 16:15:01 GMT
• Title: An efficient Progressive Swapping to the Middle distribution protocol adapted to imperfect quantum memories in quantum networks
• Abstract summary: Entanglement distribution establishes an end-to-end entangled pair while consuming intermediate pairs on links.<n> Progressive Swapping to the Middle (PSM) combines the existing Progressive Swapping protocol from both extremities of a path that meet in the middle where the received pairs are swapped.<n>We demonstrate that PSM yields a much better link probability than PS while keeping a reasonable link fidelity, and shows an advantage in resource consumption over other protocols.
• Score: 0.897214437002284
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The distribution of entangled pairs of photons on the links composing a quantum network, combined with Bell state measurements and teleportation, is the basic apparatus to transfer quantum bits (qubits) over long distances. Entanglement distribution establishes an end-to-end entangled pair while consuming intermediate pairs on links and holding them for a certain time period. The technical literature identifies two main kinds of protocols, parallel and sequential ones, the latter having an advantage in resource consumption over the former. In this paper, we introduce an efficient swapping protocol called Progressive Swapping to the Middle (PSM) as it combines the existing Progressive Swapping (PS) protocol from both extremities of a path that meet in the middle where the received pairs are swapped. We compare PSM with two parallel protocols and PS; in our evaluation, we take into account imperfect memories and fidelity degradation. We demonstrate that PSM yields a much better link probability than PS while keeping a reasonable link fidelity, and shows an advantage in resource consumption over other protocols.

Related papers

• Entanglement distribution protocols under imperfect fidelity and quantum memory conditions [0.897214437002284]
  We develop an existing protocol taking account of fidelity and imperfect memories.<n>We shorten the execution time and thus increase its link success probability.<n>It turns out that the proposed protocol outperforms some previous protocols.
  arXiv  Detail & Related papers  (2026-05-29T14:26:09Z)
• Performance Analysis of One- and Two-way DV-QKD with MIMO FSO Communication Systems [33.44770581515422]
  Two legitimate users attempt to exchange secret keys over free-space optical channels.<n>Novel frameworks for the use of the one- and two-way discrete-variable quantum key distribution protocols are presented.
  arXiv  Detail & Related papers  (2025-11-07T11:42:25Z)
• Voting-Based Semi-Parallel Proof-of-Work Protocol [45.776687601070705]
  We first consider the existing parallel PoW protocols and develop hard-coded incentive attack structures.<n>We introduce a voting-based semi-parallel PoW protocol that outperforms both Nakamoto consensus and the existing parallel PoW protocols.
  arXiv  Detail & Related papers  (2025-08-08T17:57:35Z)
• Design Tradeoffs in Photonically Linked Qubit Networks [0.0]
  Quantum networking can be realized by distributing pairs of entangled qubits between remote quantum processing nodes.<n>We consider two such protocols based on trapped ion communication qubits strongly coupled to small optical cavities.<n>We find that adoption of the strong-coupling protocols could provide substantial distribution rate improvements of $30-75%$ while maintaining the high-fidelities.
  arXiv  Detail & Related papers  (2025-06-06T17:50:32Z)
• Mentor initiated Bi-directional Hybrid quantum Communication Protocol [0.0]
  We present a hybrid bidirectional controlled quantum communication protocol between two parties.<n>The protocol operates deterministically in the absence of environmental noise.<n>The quantum circuits for entanglement generation and also of the entire protocol are presented.
  arXiv  Detail & Related papers  (2025-03-07T06:35:26Z)
• Analysis of Asynchronous Protocols for Entanglement Distribution in Quantum Networks [9.971549076128268]
  We explore two minimal asynchronous protocols for entanglement in quantum networks. A parallel scheme generating entanglement independently at the link level, and a sequential scheme extending entanglement iteratively from one party to the other. Our findings suggest the sequential scheme's superiority due to comparable performance with the parallel scheme, coupled with simpler implementation.
  arXiv  Detail & Related papers  (2024-05-03T18:04:11Z)
• Quantum Two-Way Protocol Beyond Superdense Coding: Joint Transfer of Data and Entanglement [33.2699333323263]
  We introduce a generalization of one-way superdense coding to two-way communication protocols for transmitting classical bits by using entangled quantum pairs.<n>The proposed protocol jointly addresses the provision of entangled pairs and superdense coding, introducing an integrated approach for managing entanglement within the communication protocol.<n>We present the results of implementing the protocol in a computer simulation based on the NetSquid framework.
  arXiv  Detail & Related papers  (2023-09-06T08:48:07Z)
• Reliable Quantum Communications based on Asymmetry in Distillation and Coding [35.693513369212646]
  We address the problem of reliable provision of entangled qubits in quantum computing schemes. We combine indirect transmission based on teleportation and distillation; (2) direct transmission, based on quantum error correction (QEC) Our results show that ad-hoc asymmetric codes give, compared to conventional QEC, a performance boost and codeword size reduction both in a single link and in a quantum network scenario.
  arXiv  Detail & Related papers  (2023-05-01T17:13:23Z)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• Entanglement distribution with minimal memory requirements using time-bin photonic qudits [0.0]
  We propose a novel protocol based on $2m$-dimensional time-bin photonic qudits. By adopting the qudit protocol, the required qubit memory time is independent of the transmission loss between the nodes. Our protocol can significantly boost the performance of near-term quantum networks.
  arXiv  Detail & Related papers  (2022-10-29T09:23:04Z)
• Conference key agreement in a quantum network [67.410870290301]
  Quantum conference key agreement (QCKA) allows multiple users to establish a secure key from a shared multi-partite entangled state. In a quantum network, this protocol can be efficiently implemented using a single copy of a N-qubit Greenberger-Horne-Zeilinger (GHZ) state to distil a secure N-user conference key bit.
  arXiv  Detail & Related papers  (2022-07-04T18:00:07Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.