On the Bipartite Entanglement Capacity of Quantum Networks

• URL: http://arxiv.org/abs/2307.04477v2
• Date: Fri, 17 May 2024 20:15:43 GMT
• Title: On the Bipartite Entanglement Capacity of Quantum Networks
• Authors: Gayane Vardoyan, Emily van Milligen, Saikat Guha, Stephanie Wehner, Don Towsley,
• Abstract summary: 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.
• Score: 9.377912974064227
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We consider the problem of multi-path entanglement distribution to a pair of nodes in a quantum network consisting of devices with non-deterministic entanglement swapping capabilities. Multi-path entanglement distribution enables a network to establish end-to-end entangled links across any number of available paths with pre-established link-level entanglement. Probabilistic entanglement swapping, on the other hand, limits the amount of entanglement that is shared between the nodes; this is especially the case when, due to architectural and other practical constraints, swaps must be performed in temporal proximity to each other. Limiting our focus to the case where only bipartite entangled states are generated across the network, we cast the problem as an instance of generalized flow maximization between two quantum end nodes wishing to communicate. We propose a mixed-integer quadratically constrained program (MIQCP) to solve this flow problem for networks with arbitrary topology. We then compute the overall network capacity, defined as the maximum number of EPR states distributed to users per time unit, by solving the flow problem for all possible network states generated by probabilistic entangled link presence and absence, and subsequently by averaging over all network state capacities. The MIQCP can also be applied to networks with multiplexed links. While our approach for computing the overall network capacity has the undesirable property that the total number of states grows exponentially with link multiplexing capability, it nevertheless yields an exact solution that serves as an upper bound comparison basis for the throughput performance of easily-implementable yet non-optimal entanglement routing algorithms. We apply our capacity computation method to several networks, including a topology based on SURFnet -- a backbone network used for research purposes in the Netherlands.

Related papers

• 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)
• Distributing circuits over heterogeneous, modular quantum computing network architectures [2.550561768977603]
  We consider a heterogeneous network of quantum computing modules, sparsely connected via Bell states. Operations across these connections constitute a computational bottleneck. We introduce several techniques for transforming a given quantum circuit into one implementable on a network of the aforementioned type.
  arXiv  Detail & Related papers  (2023-05-23T15:14:53Z)
• 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)
• 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)
• A Reconfigurable Quantum Local Area Network Over Deployed Fiber [1.1713998235451095]
  We implement flex-grid entanglement distribution in a deployed network for the first time. We quantify the quality of the distributed polarization entanglement via log-negativity. We demonstrate one possible quantum protocol enabled by the distributed entanglement network.
  arXiv  Detail & Related papers  (2021-02-26T17:08:03Z)
• 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)
• Effective routing design for remote entanglement generation on quantum networks [6.695045642641268]
  Efficient entanglement generation on quantum networks with relatively limited resources such as quantum memories is essential to fully realize the network's capabilities. We propose an effective routing scheme to enable automatic responses for multiple requests of entanglement generation between source-terminal stations. Multiple connection paths are exploited for each connection request while entanglement fidelity is ensured for each path by performing entanglement purification.
  arXiv  Detail & Related papers  (2020-01-07T18:16:55Z)

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.