End-to-end entanglement of quantum network paths with multi-parameter states

• URL: http://arxiv.org/abs/2506.22245v1
• Date: Fri, 27 Jun 2025 14:12:01 GMT
• Title: End-to-end entanglement of quantum network paths with multi-parameter states
• Authors: Md Sohel Mondal, Aniket Zambare, Siddhartha Santra,
• Abstract summary: We study the end-to-end entanglement of paths in a quantum network.<n>The scaling behaviour of the average end-to-end entanglement reveals that its distribution gets increasingly concentrated around the mean.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Long-range entanglement distribution in a quantum network relies on entanglement swapping at intermediate nodes along a network path to connect short-range entangled states established over the network edges. The end-to-end entanglement of a network path obtained via this process determines the utility of the network path for executing entanglement enabled tasks and for the design of entanglement routing protocols in the quantum network. Here, we study the end-to-end entanglement of paths in a quantum network when the edges are characterised by multi-parameter quantum states that may be considered to be the output of arbitrary and unknown quantum channels described by the network's edges. We find that over ensembles of multi-parameter states with fixed concurrence but varying density matrix elements, the end-to-end entanglement takes a range of values upper bounded by a function of the concurrence of the network-edge states. The scaling behaviour of the average end-to-end entanglement reveals that its distribution gets increasingly concentrated around the mean as the paths become longer. For a network path of a given length, the average end-to-end entanglement vanishes for edge concurrence values below a threshold that increases with the path-length. Whereas, for edge concurrence values greater than the threshold the average end-to-end entanglement increases faster with the length of the path. As an implication of our results, we show that the optimal path for entanglement distribution between a pair of end nodes, connected by alternate paths with multi-parameter states along the edges, can be indeterminate given only entanglement guarantees along the network edges.

Related papers

• On Selecting Paths for End-to-End Entanglement Creation in Quantum Networks [0.9582800998895141]
  We show that textitprior entanglements are an important consideration in optimal path selection due to the dynamic nature of quantum networks.<n>Longer paths with prior entanglements can establish e2e entanglement faster than shorter paths under certain conditions.
  arXiv  Detail & Related papers  (2025-05-04T22:45:38Z)
• Percolation thresholds and connectivity in quantum networks [0.0]
  We study entanglement percolation in qubit-based planar quantum network models.<n>We develop an algorithm designed to find a sequence of entanglement swapping and distillation operations.<n>We find distinct regimes of quantum percolation, which are clearly separated by the percolation thresholds of the employed strategies.
  arXiv  Detail & Related papers  (2025-02-24T14:26:09Z)
• Statistical analysis of Multipath Entanglement Purification in Quantum Networks [0.0]
  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.<n>We investigate the network scenarios in which MP-EP outperforms entanglement distribution over single network paths.<n>We find that MP-EP can bost the entanglement connection between suitably separated node pairs to reach fidelities sufficient for a given quantum task.
  arXiv  Detail & Related papers  (2025-02-13T07:00:53Z)
• Hierarchical Multi-Marginal Optimal Transport for Network Alignment [52.206006379563306]
  Multi-network alignment is an essential prerequisite for joint learning on multiple networks. We propose a hierarchical multi-marginal optimal transport framework named HOT for multi-network alignment. Our proposed HOT achieves significant improvements over the state-of-the-art in both effectiveness and scalability.
  arXiv  Detail & Related papers  (2023-10-06T02:35:35Z)
• 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)
• Scaling Limits of Quantum Repeater Networks [62.75241407271626]
  Quantum networks (QNs) are a promising platform for secure communications, enhanced sensing, and efficient distributed quantum computing. Due to the fragile nature of quantum states, these networks face significant challenges in terms of scalability. In this paper, the scaling limits of quantum repeater networks (QRNs) are analyzed.
  arXiv  Detail & Related papers  (2023-05-15T14:57:01Z)
• Entanglement Routing Based on Fidelity Curves [0.0]
  We consider quantum networks where each link is characterized by a trade-off between the entanglement generation rate and fidelity. Two entanglement distribution models are considered: one where entangled qubits are distributed one at a time, and a flow model where a large number of entangled qubits are distributed simultaneously.
  arXiv  Detail & Related papers  (2023-03-22T18:59:36Z)
• 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)
• Adaptive, Continuous Entanglement Generation for Quantum Networks [59.600944425468676]
  Quantum networks rely on entanglement between qubits at distant nodes to transmit information. We present an adaptive scheme that uses information from previous requests to better guide the choice of randomly generated quantum links. We also explore quantum memory allocation scenarios, where a difference in latency performance implies the necessity of optimal allocation of resources for quantum networks.
  arXiv  Detail & Related papers  (2022-12-17T05:40:09Z)
• 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)
• 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.