Entanglement-Gradient Routing for Quantum Networks

Gyöngyösi, László; Imre, Sándor

doi:10.1038/s41598-017-14394-w

Cited by 64 publications

(54 citation statements)

References 47 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Another algorithm for optimal routing in an end-toend setting was subject of study in [73]. Routing using an entanglement-gradient in quantum networks was studied in [58]. Reference [59] constructs a so-called base graph which represents the optimal entanglement structure of a repeater network to determine optimal paths, and a method for adapting this graph, e.g.…”

Section: Quantum Networkmentioning

confidence: 99%

A quantum network stack and protocols for reliable entanglement-based networks

2019

View full text Add to dashboard Cite

We present a stack model for breaking down the complexity of entanglement-based quantum networks. More specifically, we focus on the structures and architectures of quantum networks and not on concrete physical implementations of network elements. We construct the quantum network stack in a hierarchical manner comprising several layers, similar to the classical network stack, and identify quantum networking devices operating on each of these layers. The layers responsibilities range from establishing point-to-point connectivity, over intra-network graph state generation, to inter-network routing of entanglement. In addition we propose several protocols operating on these layers. In particular, we extend the existing intra-network protocols for generating arbitrary graph states to ensure reliability inside a quantum network, where here reliability refers to the capability to compensate for devices failures. Furthermore, we propose a routing protocol for quantum routers which enables the generation of arbitrary graph states across network boundaries. This protocol, in correspondence with classical routing protocols, can compensate dynamically for failures of routers, or even complete networks, by simply re-routing the given entanglement over alternative paths. We also consider how to connect quantum routers in a hierarchical manner to reduce complexity, as well as reliability issues arising in connecting these quantum networking devices. quantum network shall not be limited to the generation of Bell-pairs only [50][51][52][53], because many interesting applications require multipartite entangled quantum states. Therefore, the ultimate goal of quantum networks should be to enable their clients to share arbitrary entangled states to perform distributed quantum computational tasks. An important subclass of multipartite entangled states are so-called graph states [54], and many protocols in quantum information theory rely on this class of states.Here we consider entanglement-based quantum networks utilizing multipartite entangled states [51-53, 55-57] which are capable of generating arbitrary graph states among clients. In general, we identify three successive phases in entanglement-based quantum networks: dynamic, static, and adaptive. In the dynamic phase, which is the first phase, the quantum network devices utilize the quantum channels to distribute entangled states among each other. Once this phase completes, the quantum network devices share certain entangled quantum states, which results in the static phase. In this phase, the quantum network devices store these entangled states for future requests locally. Finally, in the adaptive phase, the network devices manipulate and adapt the entangled states of the static phase. This might be caused either due to requests of clients in networks, but also due to failures of devices in a quantum network.We follow the approach of [51] where a certain network state is stored in the static phase, and client requests to establish certain target (graph) states in the network ar...

show abstract

Section: Quantum Networkmentioning

confidence: 99%

A quantum network stack and protocols for reliable entanglement-based networks

2019

View full text Add to dashboard Cite

show abstract

“…For a review on some recent results of quantum computing technology, we suggest [49]. For some recent services developed for the quantum Internet, we suggest [29][30][31][32][33][34][35][36][37][38].…”

Section: Related Workmentioning

confidence: 99%

Entanglement accessibility measures for the quantum Internet

Gyöngyösi

Imre

2020

Quantum Inf Process

Self Cite

View full text Add to dashboard Cite

We define metrics and measures to characterize the ratio of accessible quantum entanglement for complex network failures in the quantum Internet. A complex network failure models a situation in the quantum Internet in which a set of quantum nodes and a set of entangled connections become unavailable. A complex failure can cover a quantum memory failure, a physical link failure, an eavesdropping activity, or any other random physical failure scenario. Here, we define the terms entanglement accessibility ratio, cumulative probability of entanglement accessibility ratio, probabilistic reduction of entanglement accessibility ratio, domain entanglement accessibility ratio, and occurrence coefficient. The proposed methods can be applied to an arbitrary topology quantum network to extract relevant statistics and to handle the quantum network failure scenarios in the quantum Internet. IntroductionAs quantum computers evolves significantly [1-10], there arises a fundamental need for a communication network that provides unconditionally secure communication and all the network functions of the traditional internet. This network structure is the quantum Internet [11][12][13][14][15]22]. The availability of quantum entanglement is a crucial aspect in any global-scale quantum Internet. The quantum Internet refers to a set of connected heterogeneous quantum communication networks realized by quantum nodes and channels (such as optical fibers or wireless optical quantum channels in the physical layer) [16,[59][60][61][62][63][64]. The quantum Internet also integrates a set of classical auxiliary communication channels to transmit auxiliary classical side-information between the quantum nodes. The quantum Internet is modeled as a global-scale quantum communication network composed of quantum subnetworks and networking components. The core network of the quantum Internet is assumed to be an entangled network structure [15,20,21,24,25,27,28,[39][40][41][42][43][44][45][46][47], which is a communication network in which the quantum nodes are connected by entangled connections. An entangled connection refers to a shared entangled system (i.e., a Bell state for qubit systems to connect two quantum nodes) between the quantum nodes. In an unentangled network structure, the quantum nodes are not necessarily connected by entanglement [16,78], and the communication between the nodes is realized in a point-to-point setting. This setting does not allow quantum communication over arbitrary distances, and an unentangled network structure can mostly be used for establishing a point-to-point quantum key distribution (QKD) [70,103] between the quantum nodes. These short distances can be extended to longer distances by the utilization of free-space quantum channels [15,70]. However, this solution is auxiliary, since it can be used only at some specific points of the unentangled network structure. Therefore, it does not represent an adequate and fundamental answer to the problem of long-distance quantum communication. Consequently, in an unentangl...

show abstract

“…To determine those quantum nodes for which both ω i,j (21) and p F * i,j are high, a redefined cost function, c i,j , can be defined for a given (i, j) as…”

Section: Parameterizationmentioning

confidence: 99%

Opportunistic Entanglement Distribution for the Quantum Internet

Gyöngyösi

Imre

2019

Sci Rep

Self Cite

View full text Add to dashboard Cite

Quantum entanglement is a building block of the entangled quantum networks of the quantum Internet. A fundamental problem of the quantum Internet is entanglement distribution. Since quantum entanglement will be fundamental to any future quantum networking scenarios, the distribution mechanism of quantum entanglement is a critical and emerging issue in quantum networks. Here we define the method of opportunistic entanglement distribution for the quantum Internet. The opportunistic model defines distribution sets that are aimed to select those quantum nodes for which the cost function picks up a local minimum. The cost function utilizes the error patterns of the local quantum memories and the predictability of the evolution of the entanglement fidelities. Our method provides efficient entanglement distributing with respect to the actual statuses of the local quantum memories of the node pairs. The model provides an easily-applicable, moderate-complexity solution for high-fidelity entanglement distribution in experimental quantum Internet scenarios.

show abstract

Entanglement-Gradient Routing for Quantum Networks

Cited by 64 publications

References 47 publications

A quantum network stack and protocols for reliable entanglement-based networks

A quantum network stack and protocols for reliable entanglement-based networks

Entanglement accessibility measures for the quantum Internet

Opportunistic Entanglement Distribution for the Quantum Internet

Contact Info

Product

Resources

About