Entanglement Routing Based on Fidelity Curves for Quantum Photonics
Channels
- URL: http://arxiv.org/abs/2303.12864v2
- Date: Tue, 28 Mar 2023 11:09:47 GMT
- Title: Entanglement Routing Based on Fidelity Curves for Quantum Photonics
Channels
- Authors: Bruno C. Coutinho, Raul Monteiro, Lu\'is Bugalho, Francisco A.
Monteiro
- Abstract summary: Quantum internet promises to extend entanglement correlations from nearby neighbors to any two nodes in a network.
How to efficiently distribute entanglement over large-scale networks is still an open problem.
We consider quantum networks composed of photonic channels characterized by a trade-off between the entanglement generation rate and fidelity.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The quantum internet promises to extend entanglement correlations from nearby
neighbors to any two nodes in a network. How to efficiently distribute
entanglement over large-scale networks is still an open problem that greatly
depends on the technology considered. In this work, we consider quantum
networks composed of photonic channels characterized by a trade-off between the
entanglement generation rate and fidelity. For such networks we look at the two
following problems: the one of finding the best path to connect any two given
nodes in the network bipartite entanglement routing, and the problem of finding
the best starting node in order to connect three nodes in the network
multipartite entanglement routing. We consider two entanglement distribution
models: one where entangled qubit are distributed one at a time, and a flow
model where a large number of entangled qubits are distributed simultaneously.
We propose the use of continuous fidelity curves (i.e., entanglement generation
fidelity vs rate) as the main routing metric. Combined with multi-objective
path-finding algorithms, the fidelity curves describing each link allow finding
a set of paths that maximize both the end-to-end fidelity and the entanglement
generation rate. For the models and networks considered, we prove that the
algorithm always converges to the optimal solution, and we show through
simulation that its execution time grows polynomial with the number of nodes in
the network. Our implementation grows with the number of nodes with a power
between $1$ and $1.4$ depending on the network. This work paves the way for the
development of path-finding algorithms for networks with complex entanglement
distribution protocols, in particular for other protocols that exhibit a
trade-off between generation fidelity and rate, such as repeater-and-purify
protocols.
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) - A Control Architecture for Entanglement Generation Switches in Quantum
Networks [1.0282274843007797]
Entanglement between quantum network nodes is often produced using intermediary devices - such as heralding stations - as a resource.
Here, we propose a cost-effective architecture to connect many quantum network nodes via a central quantum network hub called an Entanglement Generation Switch (EGS)
The EGS allows multiple quantum nodes to be connected at a fixed resource cost, by sharing the resources needed to make entanglement.
arXiv Detail & Related papers (2023-09-05T10:06:48Z) - Network Centralities in Quantum Entanglement Distribution due to User
Preferences [5.243460995467895]
This paper studies the centralities of the network when the link layer topology of entanglements is driven by usage patterns of peer-to-peer connections.
It shows that the edge centralities (measured as usage of individual edges during entanglement distribution) of the entangled graph follow power law distributions.
These findings will help in quantum resource management, e.g., quantum technology with high reliability and lower decoherence time may be allocated to edges with high centralities.
arXiv Detail & Related papers (2023-08-16T07:00:09Z) - 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) - 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) - 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) - 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) - 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) - Wireless Power Control via Counterfactual Optimization of Graph Neural
Networks [124.89036526192268]
We consider the problem of downlink power control in wireless networks, consisting of multiple transmitter-receiver pairs communicating over a single shared wireless medium.
To mitigate the interference among concurrent transmissions, we leverage the network topology to create a graph neural network architecture.
We then use an unsupervised primal-dual counterfactual optimization approach to learn optimal power allocation decisions.
arXiv Detail & Related papers (2020-02-17T07:54:39Z)
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.