Continuously Distributing Entanglement in Quantum Networks with Regular Topologies
- URL: http://arxiv.org/abs/2402.01527v2
- Date: Thu, 22 Aug 2024 20:05:00 GMT
- Title: Continuously Distributing Entanglement in Quantum Networks with Regular Topologies
- Authors: Lars Talsma, Álvaro G. Iñesta, Stephanie Wehner,
- Abstract summary: Small interconnected quantum processors can collaborate to tackle quantum computational problems.
We analyze a protocol where entanglement is continuously distributed among nodes.
We investigate how nodes can optimize the frequency of attempting entanglement swaps.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Small interconnected quantum processors can collaborate to tackle quantum computational problems that typically demand more capable devices. These linked processors, referred to as quantum nodes, can use shared entangled states to execute nonlocal operations. As a consequence, understanding how to distribute entangled states among nodes is essential for developing hardware and software. We analyze a protocol where entanglement is continuously distributed among nodes that are physically arranged in a regular pattern: a chain, a honeycomb lattice, a square grid, and a triangular lattice. These regular patterns allow for the modular expansion of networks for large-scale distributed quantum computing. Within the distribution protocol, we investigate how nodes can optimize the frequency of attempting entanglement swaps, trading off multiple entangled states shared with neighboring nodes for fewer states shared with non-neighboring nodes. We evaluate the protocol's performance using the virtual neighborhood size -- a metric indicating the number of other nodes with which a given node shares entangled states. Employing numerical methods, we find that nodes must perform more swaps to maximize the virtual neighborhood size when coherence times are short. In a chain network, the virtual neighborhood size's dependence on swap attempt frequency differs for each node based on its distance from the end of the chain. Conversely, all nodes in the square grid exhibit a qualitatively similar dependence of the virtual neighborhood size on the swap frequency.
Related papers
- Percolation thresholds and connectivity in quantum networks [0.0]
We study entanglement percolation in qubit-based planar quantum network models.
We develop an algorithm designed to find a sequence of entanglement swapping and distillation operations.
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) - Communication-Efficient Decentralized Federated Learning via One-Bit
Compressive Sensing [52.402550431781805]
Decentralized federated learning (DFL) has gained popularity due to its practicality across various applications.
Compared to the centralized version, training a shared model among a large number of nodes in DFL is more challenging.
We develop a novel algorithm based on the framework of the inexact alternating direction method (iADM)
arXiv Detail & Related papers (2023-08-31T12:22:40Z) - Performance metrics for the continuous distribution of entanglement in
multi-user quantum networks [0.0]
Entangled states shared among distant nodes are frequently used in quantum network applications.
In this paper, we focus on the steady-state performance analysis of protocols for continuous distribution of entanglement.
One of the main conclusions from our analysis is that the entanglement consumption rate has a greater impact on the protocol performance than the fidelity requirements.
arXiv Detail & Related papers (2023-07-03T23:55: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) - 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) - Analysis of Multipartite Entanglement Distribution using a Central
Quantum-Network Node [0.0]
We study the performance of distributing multipartite entangled states in a quantum network through the use of a central node.
Specifically, we consider the scenario where the multipartite entangled state is first prepared locally at a central node, and then transmitted to the end nodes of the network through quantum teleportation.
arXiv Detail & Related papers (2022-03-10T18:14:40Z) - 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) - Accelerating variational quantum algorithms with multiple quantum
processors [78.36566711543476]
Variational quantum algorithms (VQAs) have the potential of utilizing near-term quantum machines to gain certain computational advantages.
Modern VQAs suffer from cumbersome computational overhead, hampered by the tradition of employing a solitary quantum processor to handle large data.
Here we devise an efficient distributed optimization scheme, called QUDIO, to address this issue.
arXiv Detail & Related papers (2021-06-24T08:18:42Z) - Realization of a multi-node quantum network of remote solid-state qubits [0.45823749779393547]
We report on the experimental realization of a three-node entanglement-based quantum network.
We achieve real-time communication and feed-forward gate operations across the network.
We capitalize on the novel capabilities of this network to realize two canonical protocols without post-selection.
arXiv Detail & Related papers (2021-02-08T19:00:03Z) - Distributing Graph States Across Quantum Networks [16.74626042261441]
We consider a quantum network consisting of nodes-quantum computers within which local operations are free-and EPR pairs shared between nodes that can continually be generated.
We prove upper bounds for our approach on the number of EPR pairs consumed, number of timesteps taken, and amount of classical communication required.
arXiv Detail & Related papers (2020-09-23T01:36:12Z) - Towards Deeper Graph Neural Networks with Differentiable Group
Normalization [61.20639338417576]
Graph neural networks (GNNs) learn the representation of a node by aggregating its neighbors.
Over-smoothing is one of the key issues which limit the performance of GNNs as the number of layers increases.
We introduce two over-smoothing metrics and a novel technique, i.e., differentiable group normalization (DGN)
arXiv Detail & Related papers (2020-06-12T07:18:02Z) - Time-Sliced Quantum Circuit Partitioning for Modular Architectures [67.85032071273537]
Current quantum computer designs will not scale.
To scale beyond small prototypes, quantum architectures will likely adopt a modular approach with clusters of tightly connected quantum bits and sparser connections between clusters.
We exploit this clustering and the statically-known control flow of quantum programs to create tractable partitionings which map quantum circuits to modular physical machines one time slice at a time.
arXiv Detail & Related papers (2020-05-25T17:58:44Z) - Genuine quantum networks: superposed tasks and addressing [68.8204255655161]
We show how to make quantum networks, both standard and entanglement-based, genuine quantum.
We provide them with the possibility of handling superposed tasks and superposed addressing.
arXiv Detail & Related papers (2020-04-30T18:00:06Z)
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.