Improved Routing of Multiparty Entanglement over Quantum Networks

• URL: http://arxiv.org/abs/2409.14694v1
• Date: Mon, 23 Sep 2024 03:52:44 GMT
• Title: Improved Routing of Multiparty Entanglement over Quantum Networks
• Authors: Nirupam Basak, Goutam Paul,
• Abstract summary: We propose two graph state-based routing protocols for sharing GHZ states. For arbitrary network topologies, we show special constructions of the above-mentioned tree that achieve optimal results.
• Score: 4.757470449749876
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Effective routing of entanglements over a quantum network is a fundamental problem in quantum communication. Due to the fragility of quantum states, it is difficult to route entanglements at long distances. Graph states can be utilized for this purpose, reducing the need for long-distance entanglement routing by leveraging local operations. In this paper, we propose two graph state-based routing protocols for sharing GHZ states, achieving larger sizes than the existing works, for given network topologies. For this improvement, we consider tree structures connecting the users participating in the final GHZ states, as opposed to the linear configurations used in the earlier ones. For arbitrary network topologies, we show that if such a tree is balanced, it achieves a larger size than unbalanced trees. In particular, for grid networks, we show special constructions of the above-mentioned tree that achieve optimal results. Moreover, if the user nodes among whom the entanglement is to be routed are pre-specified, we propose a strategy to accomplish the required routing.

Related papers

• Multi-tree Quantum Routing in Realistic Topologies [0.19972837513980318]
  We present a multi-tree approach with multiple DODAGs designed to improve end-to-end entanglement rates in large-scale networks. Our simulations show a marked improvement in end-to-end entanglement rates for specific topologies compared to the single-tree method.
  arXiv  Detail & Related papers  (2024-08-12T14:58:02Z)
• Network Alignment with Transferable Graph Autoencoders [79.89704126746204]
  We propose a novel graph autoencoder architecture designed to extract powerful and robust node embeddings. We prove that the generated embeddings are associated with the eigenvalues and eigenvectors of the graphs. Our proposed framework also leverages transfer learning and data augmentation to achieve efficient network alignment at a very large scale without retraining.
  arXiv  Detail & Related papers  (2023-10-05T02:58:29Z)
• 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)
• Entanglement Routing and Bottlenecks in Grid Networks [0.0]
  Existing protocols like $X$ protocol use graph theoretic tools like local complementation to optimize the number of measurements required to extract any Bell pair among the network users. Here, the existing results are extended to establish a counter-intuitive notion that, in general, the most optimal path to perform the $X$ protocol is not along the shortest path. Bottlenecks in establishing simultaneous Bell pairs in nearest-neighbor architectures are also explored.
  arXiv  Detail & Related papers  (2022-11-22T19:09:01Z)
• 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)
• Efficient Quantum Network Communication using Optimized Entanglement-Swapping Trees [2.934854825488435]
  We develop techniques that minimize entanglement generation latency. We develop a dynamic programming algorithm to select an optimal swapping-tree for a single pair of nodes. We present simulation results which show that our solutions outperform the prior approaches by an order of magnitude.
  arXiv  Detail & Related papers  (2021-12-21T06:04:51Z)
• 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)
• On Topology Optimization and Routing in Integrated Access and Backhaul Networks: A Genetic Algorithm-based Approach [70.85399600288737]
  We study the problem of topology optimization and routing in IAB networks. We develop efficient genetic algorithm-based schemes for both IAB node placement and non-IAB backhaul link distribution. We discuss the main challenges for enabling mesh-based IAB networks.
  arXiv  Detail & Related papers  (2021-02-14T21:52:05Z)
• 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)
• Dynamic Graph: Learning Instance-aware Connectivity for Neural Networks [78.65792427542672]
  Dynamic Graph Network (DG-Net) is a complete directed acyclic graph, where the nodes represent convolutional blocks and the edges represent connection paths. Instead of using the same path of the network, DG-Net aggregates features dynamically in each node, which allows the network to have more representation ability.
  arXiv  Detail & Related papers  (2020-10-02T16:50:26Z)
• Graph Highway Networks [77.38665506495553]
  Graph Convolution Networks (GCN) are widely used in learning graph representations due to their effectiveness and efficiency. They suffer from the notorious over-smoothing problem, in which the learned representations converge to alike vectors when many layers are stacked. We propose Graph Highway Networks (GHNet) which utilize gating units to balance the trade-off between homogeneity and heterogeneity in the GCN learning process.
  arXiv  Detail & Related papers  (2020-04-09T16:26:43Z)

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.