Editing Entanglement Routing
Jump to navigation
Jump to search
The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then publish the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 3: | Line 3: | ||
==Functionality Description== | ==Functionality Description== | ||
Entanglement routing allows a quantum network to generate long distance entanglement between two or multiple nodes | Entanglement routing allows a quantum network to generate long distance entanglement between two or multiple nodes. As quantum information transmissivity decays exponentially in function of the distance, quantum routers are needed to successfully establish entangled states between any nodes on a quantum network. | ||
The main goal of entanglement routing is to develop efficient routing protocols to enable long distance entanglement. | The main goal of entanglement routing is to develop efficient routing protocols to enable long distance entanglement. | ||
Line 20: | Line 18: | ||
==Protocols== | ==Protocols== | ||
<!-- List of different types of example protocol achieving the functionality--> | <!-- List of different types of example protocol achieving the functionality--> | ||
* | * All the protocols within this functionality are in the [[:Category: Quantum Memory Network Stage|Quantum Memory Network Stage]]. | ||
* There are entanglement routing protocols that are specifically designed for certain network topology e.g: linear, rings, spheres, grids, recursively generated network or for networks with arbitrary topology. | |||
* | * Quantum repeater nodes have global (all the network) or local (just neighborhood) information on the state of other nodes. | ||
==Properties== | ==Properties== | ||
Line 35: | Line 29: | ||
* Quantum repeater nodes: | * Quantum repeater nodes: | ||
** Contain qubits that in the short and medium term are applicable to only basic operations i.e, Bell State Measurements to pairs of neighborhood nodes allowing the Entanglement Swapping operation. | ** Contain qubits that in the short and medium term are applicable to only basic operations i.e, Bell State Measurements to pairs of neighborhood nodes allowing the Entanglement Swapping operation. | ||
* Some protocols consider fault-tolerant operations on the nodes but other use [https://en.wikipedia.org/wiki/Entanglement_distillation Entanglement Distillation] or Error Corrections schemes on the repeater nodes [https://www.nature.com/articles/s41534-021-00438-7 5]. | * Some protocols consider fault-tolerant operations on the nodes but other use [https://en.wikipedia.org/wiki/Entanglement_distillation Entanglement Distillation] or Error Corrections schemes on the repeater nodes [https://www.nature.com/articles/s41534-021-00438-7 5]. | ||
==Further Information== | ==Further Information== | ||
<!-- Add Papers by Pirandola --> | |||
<!-- Any issue that could not be addressed or find a place in the above sections or any review paper discussing a feature of various types of protocols related to the functionality. --> | <!-- Any issue that could not be addressed or find a place in the above sections or any review paper discussing a feature of various types of protocols related to the functionality. --> | ||
<!-- 1) I'm not really sure if it is a good idea to add something about the Distributing Graph States Over Arbitrary Quantum Networks in this page/functionality, maybe as an example of usage of quantum networks ?--> | |||
<!-- 2) Should I add some of the references from the .doc I send you? --> | |||
All of the approaches below were based on the specific structure of the physical graphs and manipulation of multi-partite entangled states. However, with current day technologies, these solutions are very difficult to realize in practice. | All of the approaches below were based on the specific structure of the physical graphs and manipulation of multi-partite entangled states. However, with current day technologies, these solutions are very difficult to realize in practice. | ||
Line 71: | Line 67: | ||
* In [[Distributed Routing in a Quantum Internet]] their objective is to minimize the latency of the network to serve a request to create entanglement between two distant nodes in the network. | * In [[Distributed Routing in a Quantum Internet]] their objective is to minimize the latency of the network to serve a request to create entanglement between two distant nodes in the network. | ||
* In [https://ieeexplore.ieee.org/document/9210823 Entanglement Distribution in a Quantum Network: A Multicommodity Flow-Based Approach - Chakraborty et al. (2020)] they consider the problem of optimizing the achievable EPR-pair distribution rate between multiple source-destination pairs. | * In [https://ieeexplore.ieee.org/document/9210823 Entanglement Distribution in a Quantum Network: A Multicommodity Flow-Based Approach - Chakraborty et al. (2020)] they consider the problem of optimizing the achievable EPR-pair distribution rate between multiple source-destination pairs. | ||
==References== | ==References== | ||
Line 83: | Line 75: | ||
# [https://www.nature.com/articles/s41534-021-00438-7 Rozpędek et al. Quantum repeaters based on concatenated bosonic and discrete-variable quantum codes (2021)] | # [https://www.nature.com/articles/s41534-021-00438-7 Rozpędek et al. Quantum repeaters based on concatenated bosonic and discrete-variable quantum codes (2021)] | ||
<div style='text-align: right;'>'' | <div style='text-align: right;'>''contributed by Shraddha Singh and Lucas Arenstein''</div> | ||