Entanglement Routing in Quantum Networks: A Comprehensive Survey
- URL: http://arxiv.org/abs/2408.01234v1
- Date: Fri, 2 Aug 2024 12:48:40 GMT
- Title: Entanglement Routing in Quantum Networks: A Comprehensive Survey
- Authors: Amar Abane, Michael Cubeddu, Van Sy Mai, Abdella Battou,
- Abstract summary: 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.
- Score: 2.624902795082451
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Entanglement routing in near-term quantum networks consists of choosing the optimal sequence of short-range entanglements to combine through swapping operations to establish end-to-end entanglement between two distant nodes. Similar to traditional routing technologies, a quantum routing protocol uses network information to choose the best paths to satisfy a set of end-to-end entanglement requests. However, in addition to network state information, a quantum routing protocol must also take into account the requested entanglement fidelity, the probabilistic nature of swapping operations, and the short lifetime of entangled states. In this work, we formulate a practical entanglement routing problem and analyze and categorize the main approaches to address it, drawing comparisons to, and inspiration from, classical network routing strategies where applicable. We classify and discuss the studied quantum routing schemes into reactive, proactive, opportunistic, and virtual routing
Related papers
- Differentiated Service Entanglement Routing for Quantum Networks [4.522468619087071]
We propose a differentiated service entanglement routing (DSER) scheme, which firstly finds out the lowest loss paths and supported wavelength channels with the tensor-based path searching algorithm, and then allocates the paired channels with the differentiated routing strategies.
The evaluation results show that the proposed DSER scheme can be performed for constructing various large scale quantum networks.
arXiv Detail & Related papers (2024-01-30T23:37:16Z) - 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) - 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) - Adaptive, Continuous Entanglement Generation for Quantum Networks [59.600944425468676]
Quantum networks rely on entanglement between qubits at distant nodes to transmit information.
We present an adaptive scheme that uses information from previous requests to better guide the choice of randomly generated quantum links.
We also explore quantum memory allocation scenarios, where a difference in latency performance implies the necessity of optimal allocation of resources for quantum networks.
arXiv Detail & Related papers (2022-12-17T05:40:09Z) - Fidelity-Guarantee Entanglement Routing in Quantum Networks [64.49733801962198]
Entanglement routing establishes remote entanglement connection between two arbitrary nodes.
We propose purification-enabled entanglement routing designs to provide fidelity guarantee for multiple Source-Destination (SD) pairs in quantum networks.
arXiv Detail & Related papers (2021-11-15T14:07:22Z) - 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) - Qubit Routing using Graph Neural Network aided Monte Carlo Tree Search [0.0]
Near-term quantum hardware can support two-qubit operations only on the qubits that can interact with each other.
We propose a procedure for qubit routing that is architecture agnostic and that outperforms other available routing implementations on various circuit benchmarks.
arXiv Detail & Related papers (2021-04-01T17:08:28Z) - Two-excitation routing via linear quantum channels [0.0]
We apply the perturbative transfer scheme to a two-excitation routing protocol on a network where multiple two-receivers block are coupled to a linear chain.
We find that the protocol allows for efficient two-excitation routing on a fermionic network, although for a spin-$frac12$ network only a limited region of the network is suitable for high-quality routing.
arXiv Detail & Related papers (2020-11-27T12:50:17Z) - 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) - Effective routing design for remote entanglement generation on quantum
networks [6.695045642641268]
Efficient entanglement generation on quantum networks with relatively limited resources such as quantum memories is essential to fully realize the network's capabilities.
We propose an effective routing scheme to enable automatic responses for multiple requests of entanglement generation between source-terminal stations.
Multiple connection paths are exploited for each connection request while entanglement fidelity is ensured for each path by performing entanglement purification.
arXiv Detail & Related papers (2020-01-07T18:16:55Z)
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.