We introduce a merging-based quantum repeater that departs from the conventional swapping paradigm by progressively growing multipartite entanglement. In contrast to swapping-based schemes, where a single failed operation often forces the entire protocol to restart, our approach reuses previously established entanglement through iterative gap-patching, thereby reducing waiting times, improving distribution rates, and introducing enhanced flexibility in the communication requests. We analyze this protocol in the context of probabilistic operations and a time-dependent dephasing noise model. We compare it with standard repeater protocols and demonstrate a clear advantage in secret-key rate across relevant operating regimes, underscoring its potential for practical quantum communication scenarios. These results establish merging-based repeaters as a promising alternative design principle for scalable and resource-efficient quantum-network architectures.
First-generation quantum repeaters are essential in distributing entanglement over long distances since they could mitigate losses in optical fiber. Repeaters split the total distance into shorter, easier to generate links. Then, entanglement swapping establishes long range entanglement by performing local measurements...
Long-distance entanglement distribution requires error correction protocols to compensate for qubit decoherence in quantum memories and noise introduced during entanglement swapping. We argue that repeater chains with error-correction capabilities should exploit more than one physical platform, combining the complement...
S. Haldar, Saikat Guha, Don Towsley et al.· 0 citations
A closed-form end-to-end fidelity recursion is derived that embeds single-segment DAEPP into the BDCZ scheme and gives a strict resource lower bound for any BDCZ baseline utilising BBPSSW purification to match DAHR's per-segment effective fidelity.
Vinay Kumar, Krishan Joshi, C. Cicconetti· 0 citations
A simple repeat-until-success protocol is introduced that makes entanglement consumption adaptive to interaction strength and yields a total entanglement cost that scales linearly with evolution time and remains independent of Trotter error.
Tian-Feng Feng, Jin-Zhao Sun, Yun-Long Xiao et al.· 0 citations
High-dimensional quantum entanglement offers significant advantages over its two-dimensional counterparts in various quantum information processing tasks. We propose a scalable method for implementing an arbitrary high-dimensional entanglement purification protocol (HDEPP) using path superposition. By selecting appropr...
Zi-Han Zheng, Wen-Qiang Liu, Chen-Ming Bai et al.· Optics Express· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
