Improved analytical bounds on delivery times of long-distance entanglement

• URL: http://arxiv.org/abs/2103.11454v2
• Date: Tue, 8 Feb 2022 18:38:58 GMT
• Title: Improved analytical bounds on delivery times of long-distance entanglement
• Authors: Tim Coopmans, Sebastiaan Brand, David Elkouss
• Abstract summary: We provide improved analytical bounds on the average and on the quantiles of the completion time of entanglement distribution protocols. A canonical example of such a protocol is a nested quantum repeater scheme which consists of heralded entanglement generation and entanglement swaps.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The ability to distribute high-quality entanglement between remote parties is a necessary primitive for many quantum communication applications. A large range of schemes for realizing the long-distance delivery of remote entanglement has been proposed, both for bipartite and multipartite entanglement. For assessing the viability of these schemes, knowledge of the time at which entanglement is delivered is crucial. Specifically, if the communication task requires multiple remote-entangled quantum states and these states are generated at different times by the scheme, the earlier states will need to wait and thus their quality will decrease while being stored in an (imperfect) memory. For the remote-entanglement delivery schemes which are closest to experimental reach, this time assessment is challenging, as they consist of nondeterministic components such as probabilistic entanglement swaps. For many such protocols even the average time at which entanglement can be distributed is not known exactly, in particular when they consist of feedback loops and forced restarts. In this work, we provide improved analytical bounds on the average and on the quantiles of the completion time of entanglement distribution protocols in the case that all network components have success probabilities lower bounded by a constant. A canonical example of such a protocol is a nested quantum repeater scheme which consists of heralded entanglement generation and entanglement swaps. For this scheme specifically, our results imply that a common approximation to the mean entanglement distribution time, the 3-over-2 formula, is in essence an upper bound to the real time. Our results rely on a novel connection with reliability theory.

Related papers

• Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning [0.0]
  Quantum repeaters play a crucial role in the effective distribution of entanglement over long distances. We introduce and evaluate a fixed local policy, the predictive swap-asap' policy, where nodes only coordinate with nearest neighbours. Our work showcases the merit of considering policies acting with incomplete information in the realistic case when classical communication effects are significant.
  arXiv  Detail & Related papers  (2024-12-09T19:26:49Z)
• 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)
• Secure and robust randomness with sequential quantum measurements [0.0]
  We prove a Tsirelson-like boundary for sequential quantum correlations, which represents a trade-off in nonlocality shared by sequential users. Our simple qubit protocol reaches this boundary, and numerical analysis shows improved robustness under realistic noise. This study advances understanding of sequential quantum correlations and offers insights for efficient device-independent protocols.
  arXiv  Detail & Related papers  (2023-09-21T17:50:29Z)
• Multipartite entanglement theory with entanglement-nonincreasing operations [91.3755431537592]
  We extend the resource theory of entanglement for multipartite systems beyond the standard framework of local operations and classical communication. We demonstrate that in this adjusted framework, the transformation rates between multipartite states are fundamentally dictated by the bipartite entanglement entropies of the respective quantum states.
  arXiv  Detail & Related papers  (2023-05-30T12:53:56Z)
• Entanglement Distribution in Quantum Repeater with Purification and Optimized Buffer Time [53.56179714852967]
  We explore entanglement distribution using quantum repeaters with optimized buffer time. We observe that increasing the number of memories on end nodes leads to a higher entanglement distribution rate per memory. When imperfect operations are considered, however, we make the surprising observation that the per-memory entanglement rate decreases with increasing number of memories.
  arXiv  Detail & Related papers  (2023-05-23T23:23:34Z)
• An Analysis of the Completion Time of the BB84 Protocol [5.421615560456378]
  The BB84 QKD protocol is based on the idea that the sender and the receiver can reconcile a certain fraction of the teleported qubits. decoherence of quantum states poses a significant challenge to performing perfect or efficient teleportation. We do a performance analysis of the completion time of the BB84 protocol in a setting where the sender and the receiver are connected via a single quantum repeater.
  arXiv  Detail & Related papers  (2023-04-20T11:30:44Z)
• 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)
• Resource analysis for quantum-aided Byzantine agreement with the four-qubit singlet state [1.2094859111770522]
  In distributed computing, a Byzantine fault is a condition where a component behaves inconsistently, showing different symptoms to different components of the system. Our work highlights important engineering aspects of the future deployment of quantum communication protocols with multi-qubit entangled states.
  arXiv  Detail & Related papers  (2022-07-11T15:17:58Z)
• Telecom-heralded entanglement between remote multimode solid-state quantum memories [55.41644538483948]
  Future quantum networks will enable the distribution of entanglement between distant locations and allow applications in quantum communication, quantum sensing and distributed quantum computation. Here we report the demonstration of heralded entanglement between two spatially separated quantum nodes, where the entanglement is stored in multimode solid-state quantum memories. We also show that the generated entanglement is robust against loss in the heralding path, and demonstrate temporally multiplexed operation, with 62 temporal modes.
  arXiv  Detail & Related papers  (2021-01-13T14:31:54Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• Entanglement-assisted entanglement purification [62.997667081978825]
  We present a new class of entanglement-assisted entanglement purification protocols that can generate high-fidelity entanglement from noisy, finite-size ensembles. Our protocols can deal with arbitrary errors, but are best suited for few errors, and work particularly well for decay noise.
  arXiv  Detail & Related papers  (2020-11-13T19:00:05Z)

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.