1,511 research outputs found
Entanglement Availability Differentiation Service for the Quantum Internet
A fundamental concept of the quantum Internet is quantum entanglement. In a
quantum Internet scenario where the legal users of the network have different
priority levels or where a differentiation of entanglement availability between
the users is a necessity, an entanglement availability service is essential.
Here we define the entanglement availability differentiation (EAD) service for
the quantum Internet. In the proposed EAD framework, the differentiation is
either made in the amount of entanglement with respect to the relative entropy
of entanglement associated with the legal users, or in the time domain with
respect to the amount of time that is required to establish a maximally
entangled system between the legal parties. The framework provides an efficient
and easily-implementable solution for the differentiation of entanglement
availability in experimental quantum networking scenarios.Comment: 18 pages, Journal-ref: Scientific Report
Topology Adaption for the Quantum Internet
In the quantum repeater networks of the quantum Internet, the varying
stability of entangled quantum links makes dynamic topology adaption an
emerging issue. Here we define an efficient topology adaption method for
quantum repeater networks. The model assumes the random failures of entangled
links and several parallel demands from legal users. The shortest path defines
a set of entangled links for which the probability of stability is above a
critical threshold. The scheme is utilized in a base-graph of the overlay
quantum network to provide an efficient shortest path selection for the demands
of all users of the network. We study the problem of entanglement assignment in
a quantum repeater network, prove its computational complexity, and show an
optimization procedure. The results are particularly convenient for future
quantum networking, quantum-Internet, and experimental long-distance quantum
communications.Comment: 17 pages, Journal-ref: Quant. Inf. Proc. (2018
Optimal Remote Qubit Teleportation Using Node2vec
Much research work is done on implementing quantum teleportation and entanglement swapping for remote entanglement. Due to dynamical topological changes in quantum networks, nodes have to construct the shortest paths every time they want to communicate with a remote neighbour. But due to the entanglement failures remote entanglement establishment is still a challenging task. Also as the nodes know only about their neighbouring nodes computing optimal paths between source and remote nodes is time consuming too. In finding the next best neighbour in the optimal path between a given source and remote nodes so as to decrease the entanglement cost, deep learning techniques can be applied. In this paper we defined throughput of the quantum network as the maximum qubits transmitted with minimum entanglement cost. Much of research work is done to improve the throughput of the quantum network using the deep learning techniques. In this paper we adopted deep learning techniques for implementing remote entanglement between two non-neighbour nodes using remote qubit teleportation and entanglement swapping. The proposed method called Optimal Remote Qubit Teleportation outperforms the throughput obtained by the state of art approach
Decentralized Base-Graph Routing for the Quantum Internet
Quantum repeater networks are a fundamental of any future quantum Internet
and long-distance quantum communications. The entangled quantum nodes can
communicate through several different levels of entanglement, leading to a
heterogeneous, multi-level network structure. The level of entanglement between
the quantum nodes determines the hop distance and the probability of the
existence of an entangled link in the network. Here, we define a decentralized
routing for entangled quantum networks. The proposed method allows an efficient
routing to find the shortest paths in entangled quantum networks by using only
local knowledge of the quantum nodes. We give bounds on the maximum value of
the total number of entangled links of a path. The proposed scheme can be
directly applied in practical quantum communications and quantum networking
scenarios.Comment: 13 pages, Journal-ref: Phys. Rev.
Decentralized Base-Graph Routing for the Quantum Internet
Quantum repeater networks are a fundamental of any future quantum Internet
and long-distance quantum communications. The entangled quantum nodes can
communicate through several different levels of entanglement, leading to a
heterogeneous, multi-level network structure. The level of entanglement between
the quantum nodes determines the hop distance and the probability of the
existence of an entangled link in the network. Here, we define a decentralized
routing for entangled quantum networks. The proposed method allows an efficient
routing to find the shortest paths in entangled quantum networks by using only
local knowledge of the quantum nodes. We give bounds on the maximum value of
the total number of entangled links of a path. The proposed scheme can be
directly applied in practical quantum communications and quantum networking
scenarios.Comment: 13 pages, Journal-ref: Phys. Rev.
- …