Multiparty Entanglement Routing in Quantum Networks
- URL: http://arxiv.org/abs/2211.06690v1
- Date: Sat, 12 Nov 2022 15:40:34 GMT
- Title: Multiparty Entanglement Routing in Quantum Networks
- Authors: Vaisakh Mannalath and Anirban Pathak
- Abstract summary: 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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Distributing entanglement among multiple users is a fundamental problem in
quantum networks, requiring an efficient solution. In this work, a protocol is
proposed for extracting maximally entangled (GHZn) states for any number of
parties in quantum networks of arbitrary topology. It is based on the graph
state formalism and requires minimal assumptions on the network state. The
protocol only requires local measurements at the network nodes and just a
single qubit memory per user. Existing protocols on bipartite entanglement
routing are also improved for specific nearest-neighbor network architectures.
To this end, the concept of majorization is utilized to establish a hierarchy
among different paths in a network based on their efficacy. This approach
utilizes the symmetry of the underlying graph state to obtain better-performing
algorithms.
Related papers
- Improved Routing of Multiparty Entanglement over Quantum Networks [4.757470449749876]
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.
arXiv Detail & Related papers (2024-09-23T03:52:44Z) - 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) - 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) - Bandwidth-efficient distributed neural network architectures with
application to body sensor networks [73.02174868813475]
This paper describes a conceptual design methodology to design distributed neural network architectures.
We show that the proposed framework enables up to a factor 20 in bandwidth reduction with minimal loss.
While the application focus of this paper is on wearable brain-computer interfaces, the proposed methodology can be applied in other sensor network-like applications as well.
arXiv Detail & Related papers (2022-10-14T12:35:32Z) - 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) - ESPN: Extremely Sparse Pruned Networks [50.436905934791035]
We show that a simple iterative mask discovery method can achieve state-of-the-art compression of very deep networks.
Our algorithm represents a hybrid approach between single shot network pruning methods and Lottery-Ticket type approaches.
arXiv Detail & Related papers (2020-06-28T23:09:27Z) - Designing Quantum Networks Using Preexisting Infrastructure [0.0]
We consider the problem of deploying a quantum network on an existing fiber infrastructure.
We propose a method based on integer linear programming (ILP) to place the minimal number of repeaters on such an existing network topology.
We show that our method performs well in practice for networks of up to 100 nodes.
arXiv Detail & Related papers (2020-05-29T17:58:21Z) - Network Adjustment: Channel Search Guided by FLOPs Utilization Ratio [101.84651388520584]
This paper presents a new framework named network adjustment, which considers network accuracy as a function of FLOPs.
Experiments on standard image classification datasets and a wide range of base networks demonstrate the effectiveness of our approach.
arXiv Detail & Related papers (2020-04-06T15:51:00Z)
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.