Routing in Quantum Repeater Networks with Mixed Efficiency Figures
- URL: http://arxiv.org/abs/2310.08990v2
- Date: Wed, 26 Jun 2024 09:58:51 GMT
- Title: Routing in Quantum Repeater Networks with Mixed Efficiency Figures
- Authors: Vinay Kumar, Claudio Cicconetti, Marco Conti, Andrea Passarella,
- Abstract summary: This study explores an approach to routing in quantum networks, mirroring real-world classical networks.
We focus on some key parameters in an operational quantum network such as the fraction of nodes with a higher efficiency.
Our simulations show that incorporating knowledge of node quality not only helps boost the fidelity of some of the routing paths but also reduces the number of blocked paths in the quantum network.
- Score: 10.955844285189373
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Routing in a quantum network presents unique challenges due to its acquired properties of quantum mechanics like no-cloning, link failure, and entanglement. This study explores an approach to routing in quantum networks, which targets practical scenarios for quantum networks, mirroring real-world classical networks. Thus, it consists of access networks with users acting as sources and destinations, interconnected through a core network of nodes cooperating to establish end-to-end entanglement between them. By addressing practical constraints, we examine the impact of heterogeneous nodes with mixed efficiency figures on quantum network performance. In particular, we focus on some key parameters in an operational quantum network such as the fraction of nodes with a higher efficiency (called high-quality), path establishment order, end-to-end fidelity, i.e., a measure of the quality of the end-to-end entanglement established. Our simulations show that incorporating knowledge of node quality not only helps boost the fidelity of some of the routing paths but also reduces the number of blocked paths in the quantum network. The study also highlights the critical role of the fraction of high-quality nodes in end-to-end fidelity and explores the trade-offs between upgrading all nodes to high quality or retaining a subset of lower-quality nodes.
Related papers
- Guarantees on the structure of experimental quantum networks [105.13377158844727]
Quantum networks connect and supply a large number of nodes with multi-party quantum resources for secure communication, networked quantum computing and distributed sensing.
As these networks grow in size, certification tools will be required to answer questions regarding their properties.
We demonstrate a general method to guarantee that certain correlations cannot be generated in a given quantum network.
arXiv Detail & Related papers (2024-03-04T19:00:00Z) - Entanglement-Assisted Quantum Networks: Mechanics, Enabling
Technologies, Challenges, and Research Directions [66.27337498864556]
This paper presents a comprehensive survey of entanglement-assisted quantum networks.
It provides a detailed overview of the network structure, working principles, and development stages.
It also emphasizes open research directions, including architecture design, entanglement-based network issues, and standardization.
arXiv Detail & Related papers (2023-07-24T02:48:22Z) - Entangled Pair Resource Allocation under Uncertain Fidelity Requirements [59.83361663430336]
In quantum networks, effective entanglement routing facilitates communication between quantum source and quantum destination nodes.
We propose a resource allocation model for entangled pairs and an entanglement routing model with a fidelity guarantee.
Our proposed model can reduce the total cost by at least 20% compared to the baseline model.
arXiv Detail & Related papers (2023-04-10T07:16:51Z) - QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional
Networks [124.7972093110732]
We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations.
To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections.
Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
arXiv Detail & Related papers (2022-11-09T21:43:16Z) - End-to-End Capacities of Imperfect-Repeater Quantum Networks [0.0]
We present achievable end-to-end rates for noisy-repeater quantum networks.
These are obtained by extending the coherent and reverse coherent information.
We show how tight upper-bounds can also be derived by supplementing appropriate single-edge capacity bounds.
arXiv Detail & Related papers (2022-07-12T11:46:54Z) - Entanglement Rate Optimization in Heterogeneous Quantum Communication
Networks [79.8886946157912]
Quantum communication networks are emerging as a promising technology that could constitute a key building block in future communication networks in the 6G era and beyond.
Recent advances led to the deployment of small- and large-scale quantum communication networks with real quantum hardware.
In quantum networks, entanglement is a key resource that allows for data transmission between different nodes.
arXiv Detail & Related papers (2021-05-30T11:34:23Z) - Robustness of Noisy Quantum Networks [0.0]
We show that quantum networks based on typical noisy quantum-repeater nodes are prone to discontinuous phase transitions.
Our results indicate that a scale-free topology is a crucial design principle to establish a robust large-scale quantum internet.
arXiv Detail & Related papers (2021-03-04T19:01:49Z) - Quantum Network Discrimination [1.9036571490366496]
We study the discrimination of quantum networks and its fundamental limitations.
The simplest quantum network capturers the structure of the problem is given by a quantum superchannel.
We discuss achievability, symmetric network, the strong exponent to arbitrary quantum networks and finally an application to an active version of the quantum illumination problem.
arXiv Detail & Related papers (2021-03-03T13:54:24Z) - A Proactive Connection Setup Mechanism for Large Quantum Networks [0.0]
It is necessary to have an efficient mechanism to distribute entanglement among quantum network nodes.
This paper presents a novel way to quicken connection setup between two nodes using historical data.
Results show, with quantum network size increase, the proposed approach improves success rate of connection establishments.
arXiv Detail & Related papers (2020-12-25T11:48:40Z) - 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.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.