HOPPER: A Hop-by-hop Entanglement Distribution Protocol for Asynchronous Quantum Networks

• URL: http://arxiv.org/abs/2605.15869v1
• Date: Fri, 15 May 2026 11:36:01 GMT
• Title: HOPPER: A Hop-by-hop Entanglement Distribution Protocol for Asynchronous Quantum Networks
• Abstract summary: The quantum Internet relies on the ability to distribute entangled quantum bits (ebits) between quantum memories at the end nodes.<n>This need creates new challenges due to the fragile nature of entanglement, which decoheres over short timescales.<n>In this paper, we study the implications of multiplexing concurrent ebit requests on the same quantum, for both synchronous and asynchronous operation.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The quantum Internet relies on the ability to distribute entangled quantum bits (ebits) between quantum memories at the end nodes, to perform applications like blind or distributed quantum computing that are impossible if end nodes are connected via a classical, i.e., non-quantum network. This need creates new challenges due to the fragile nature of entanglement, which decoheres over short timescales and cannot be amplified, buffered, or retransmitted. Two broad categories of approaches have been proposed in the scientific literature to realize such an entanglement distribution in a given path: one relying on a synchronous time-slotted model, and another one where intermediate nodes interact asynchronously. However, both of them implicitly assume a serial operation, where one ebit is established and made available to the application on end nodes before creating a new one. This is inefficient in long-range networks, with high transmission latencies, if the intermediate nodes have multiple memory qubits that could be used in parallel. To overcome this limitation, in this paper, we study the implications of multiplexing concurrent ebit requests on the same quantum, for both synchronous and asynchronous operation. Furthermore, for the latter, we define a novel distribution protocol, called HOPPER, where the intermediate nodes make autonomous and hop-by-hop decisions on the use of their local resources when establishing an ebit. With numerical simulations, we show that HOPPER is effective in handling multiple ebit requests in parallel, and it exhibits significantly better performance than a synchronous alternative in different scenarios.

Related papers

• Asynchronous Routing for Multipartite Entanglement in Quantum Networks [11.815937275904467]
  In quantum networks, one way to communicate is to distribute entanglements through swapping at intermediate nodes.<n>This article extends this approach to multipartite entanglements, particularly the three-party Greenberger-Horne-Zeilinger (GHZ) states.<n>It shows that our asynchronous protocol outperforms traditional synchronous methods in entanglement rates, especially as coherence times increase.
  arXiv  Detail & Related papers  (2026-03-29T07:06:31Z)
• Improved Simulation of Asynchronous Entanglement Distribution in Noisy Quantum Networks [0.0]
  This work introduces a lightweight simulation framework for evaluating asynchronous entanglement distribution protocols.<n>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.
  arXiv  Detail & Related papers  (2025-07-30T18:00:05Z)
• 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)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Asynchronous Entanglement Routing for the Quantum Internet [0.42855555838080833]
  We propose a new set of asynchronous routing protocols for quantum networks. The protocols update the entanglement-link asynchronous topologyly, identify optimal entanglement-swapping paths, and preserve unused direct-link entanglements. Our results indicate that asynchronous protocols achieve a larger upper bound with an appropriate setting and significantly higher entanglement rate than existing synchronous approaches.
  arXiv  Detail & Related papers  (2023-12-21T21:14:21Z)
• 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)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Parallel Simulation of Quantum Networks with Distributed Quantum State Management [56.24769206561207]
  We identify requirements for parallel simulation of quantum networks and develop the first parallel discrete event quantum network simulator. Our contributions include the design and development of a quantum state manager that maintains shared quantum information distributed across multiple processes. We release the parallel SeQUeNCe simulator as an open-source tool alongside the existing sequential version.
  arXiv  Detail & Related papers  (2021-11-06T16:51:17Z)
• Accelerating variational quantum algorithms with multiple quantum processors [78.36566711543476]
  Variational quantum algorithms (VQAs) have the potential of utilizing near-term quantum machines to gain certain computational advantages. Modern VQAs suffer from cumbersome computational overhead, hampered by the tradition of employing a solitary quantum processor to handle large data. Here we devise an efficient distributed optimization scheme, called QUDIO, to address this issue.
  arXiv  Detail & Related papers  (2021-06-24T08:18:42Z)
• Purification and Entanglement Routing on Quantum Networks [55.41644538483948]
  A quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We introduce effectives enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network.
  arXiv  Detail & Related papers  (2020-11-23T19:00:01Z)

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.