Related papers: A flexible quantum data bus

A flexible quantum data bus

URL: http://arxiv.org/abs/2404.06578v1
Date: Tue, 9 Apr 2024 18:55:55 GMT
Title: A flexible quantum data bus
Authors: Julia Freund, Alexander Pirker, Wolfgang Dür,
Abstract summary: We consider multi-path routing of entanglement in quantum networks, where a pre-prepared entangled 2D cluster state serves as a resource to perform different tasks on demand. We show how to achieve parallel connections between multiple, freely chosen groups of parties by performing appropriate local measurements among diagonal paths.
Score: 44.99833362998488
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: We consider multi-path routing of entanglement in quantum networks, where a pre-prepared multipartite entangled 2D cluster state serves as a resource to perform different tasks on demand. We show how to achieve parallel connections between multiple, freely chosen groups of parties by performing appropriate local measurements among diagonal paths, which preserves the entanglement structure of the remaining state. We demonstrate how to route multiple Bell-states along parallel lines via crossings, turns and fade-in/-outs, analogously to a data bus. The results apply to networks at any scale.

Related papers

Entanglement Routing in Quantum Networks: A Comprehensive Survey [2.624902795082451]
Entanglement routing in near-term quantum networks consists of choosing the optimal sequence of short-range entanglements to combine. We classify and discuss the studied quantum routing schemes into reactive, proactive, opportunistic, and virtual routing.
arXiv Detail & Related papers (2024-08-02T12:48:40Z)
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)
On Optimizing the Communication of Model Parallelism [74.15423270435949]
We study a novel and important communication pattern in large-scale model-parallel deep learning (DL) In cross-mesh resharding, a sharded tensor needs to be sent from a source device mesh to a destination device mesh. We propose two contributions to address cross-mesh resharding: an efficient broadcast-based communication system, and an "overlapping-friendly" pipeline schedule.
arXiv Detail & Related papers (2022-11-10T03:56:48Z)
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)
Entanglement Distribution in Multi-Platform Buffered-Router-Assisted Frequency-Multiplexed Automated Repeater Chains [0.0]
We propose a quantum network architecture based on quantum processing devices based on NV$-$ colour centers. Long-distance entanglement distribution is enabled by spectrally-multiplexed quantum repeaters based on rare-earth ion-doped crystals and imperfect entangled photon-pair sources.
arXiv Detail & Related papers (2021-06-08T20:25:43Z)
Cost vector analysis & multi-path entanglement routing in quantum networks [0.0]
We present a framework for analysing quantum routing protocols that we call the textitcost-vector formalism. We develop rudimentary greedy algorithms for routing in this framework and test them over a variety of toy networking scenarios. Our results indicate that congestion in quantum networks does not improve significantly when more nodes (computers) are added. Rather, we find that congestion is all but eliminated by waiting a small amount of time.
arXiv Detail & Related papers (2021-05-02T08:26:29Z)
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.