Statistical analysis of Multipath Entanglement Purification in Quantum Networks

• URL: http://arxiv.org/abs/2502.09011v1
• Date: Thu, 13 Feb 2025 07:00:53 GMT
• Title: Statistical analysis of Multipath Entanglement Purification in Quantum Networks
• Authors: Rajni Bala, Md Sohel Mondal, Siddhartha Santra,
• Abstract summary: Multipath entanglement purification (MP-EP) can exploit the network's complex structure to strengthen the entanglement connection between node pairs separated by appropriate graph distances. We investigate the network scenarios in which MP-EP outperforms entanglement distribution over single network paths. We find that MP-EP can bost the entanglement connection between suitably separated node pairs to reach fidelities sufficient for a given quantum task.
• Score: 0.0
• License:
• Abstract: In quantum networks, a set of entangled states distributed over multiple, alternative, distinct paths between a pair of source-destination nodes can be purified to obtain a higher fidelity entangled state between the nodes. This multipath entanglement purification (MP-EP) strategy can exploit the network's complex structure to strengthen the entanglement connection between node pairs separated by appropriate graph distances. We investigate the network scenarios in which MP-EP outperforms entanglement distribution over single network paths utilising a statistical model of a quantum network and find that MP-EP can be an effective entanglement distribution strategy over a range of node separations determined by the average edge fidelities and probabilities of the network. We find that MP-EP can bost the entanglement connection between suitably separated node pairs to reach fidelities sufficient for a given quantum task thereby increasing the functionality of a quantum network. Further, we provide statistical criteria in terms of network parameters that can determine the regions of the network where MP-EP can be a useful entanglement distribution strategy.

Related papers

• Multipath entanglement purification strategies for quantum networks [0.0]
  In quantum networks multipath entanglement purification (MEP) between a pair of source-destination nodes can substantially strengthen their entanglement connection. We show that a careful choice of MEP strategy can make the entanglement connection strength between source-destination network nodes effectively independent of its topology.
  arXiv  Detail & Related papers  (2024-08-26T11:59:36Z)
• Guarantees on the structure of experimental quantum networks [105.13377158844727]
  Quantum networks connect and supply a large number of nodes with multi-party quantum resources for secure communication, networked quantum computing and distributed sensing. As these networks grow in size, certification tools will be required to answer questions regarding their properties. We demonstrate a general method to guarantee that certain correlations cannot be generated in a given quantum network.
  arXiv  Detail & Related papers  (2024-03-04T19:00:00Z)
• On the Bipartite Entanglement Capacity of Quantum Networks [9.377912974064227]
  We consider multi-path entanglement distribution to a pair of nodes in a quantum network consisting of devices with non-deterministic entanglement swapping capabilities. We propose a mixed-integer quadratically constrained program (MIQCP) to solve this flow problem. We then compute the overall network capacity, defined as the maximum number of EPR states distributed to users per time unit.
  arXiv  Detail & Related papers  (2023-07-10T10:58:02Z)
• 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)
• Scaling Network Topologies for Multi-User Entanglement Distribution [0.0]
  Future quantum internet relies on large-scale entanglement distribution. Quantum decoherence is a significant obstacle in large-scale networks, which otherwise perform better with multiple paths between the source and destination. We propose a new topology, connected tree, with a significant amount of redundant edges to support multi-path routing of entangled pairs.
  arXiv  Detail & Related papers  (2022-12-06T10:48:08Z)
• Multiparty Entanglement Routing in Quantum Networks [0.0]
  A protocol is proposed for extracting maximally entangled (GHZn) states for any number of parties in quantum networks. The protocol only requires local measurements at the network nodes and just a single qubit memory per user.
  arXiv  Detail & Related papers  (2022-11-12T15:40:34Z)
• A scheme for multipartite entanglement distribution via separable carriers [68.8204255655161]
  We develop a strategy for entanglement distribution via separable carriers that can be applied to any number of network nodes. We show that our protocol results in multipartite entanglement, while the carrier mediating the process is always in a separable state with respect to the network.
  arXiv  Detail & Related papers  (2022-06-20T10:50:45Z)
• Optimized Quantum Networks [68.8204255655161]
  Quantum networks offer the possibility to generate different kinds of entanglement prior to network requests. We utilize this to design entanglement-based quantum networks tailored to their desired functionality.
  arXiv  Detail & Related papers  (2021-07-21T18:00:07Z)
• Learning Autonomy in Management of Wireless Random Networks [102.02142856863563]
  This paper presents a machine learning strategy that tackles a distributed optimization task in a wireless network with an arbitrary number of randomly interconnected nodes. We develop a flexible deep neural network formalism termed distributed message-passing neural network (DMPNN) with forward and backward computations independent of the network topology.
  arXiv  Detail & Related papers  (2021-06-15T09:03:28Z)
• 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.