Related papers: Quantum walk-based protocol for secure communicati…
The quantum walk is the quantum analogue of the well-known random walk, which forms the basis for models and applications in many realms of science. Its properties are markedly different from the classical counterpart and might lead to…
The topology of classical networks is determined by physical links between nodes, and after a network request the links are used to establish the desired connections. Quantum networks offer the possibility to generate different kinds of…
We present a protocol for quantum cryptographic network consisting of a quantum network center and many users, in which any pair of parties with members chosen from the whole users on request can secure a quantum key distribution by help of…
A quantum repeater node is presented based on trapped ions that act as single photon emitters, quantum memories and an elementary quantum processor. The node's ability to establish entanglement across two 25 km-long optical fibers…
Distributing quantum state and entanglement between distant nodes is a crucial task in distributed quantum information processing on large-scale quantum networks. Quantum network coding provides an alternative solution for quantum state…
A quantum key distribution and identification protocol is proposed, which is based on entanglement swapping. Through choosing particles by twos from the sequence and performing Bell measurements, two communicators can detect eavesdropping,…
Entanglement with single-particle states is advantageous in quantum technology because of their ability to encode and process information more securely than their multi-particle analogs. Threeway and nonlocal two-way entangled…
Shared entanglement between spatially separated systems is an essential resource for quantum information processing including long-distance quantum cryptography and teleportation. While purification protocols for mixed distributed entangled…
We investigate entanglement distribution in pure-state quantum networks. We consider the case when non-maximally entangled two-qubit pure states are shared by neighboring nodes of the network. For a given pair of nodes, we investigate how…
Quantum walk is fundamental to designing many quantum algorithms. Here we consider the effects of quantum coherence and quantum entanglement for the quantum walk search on the complete bipartite graph. First, we numerically show the…
In this paper, we propose a circuit design for implementing quantum walks on complex networks. Quantum walks are powerful tools for various graph-based applications such as spatial search, community detection, and node classification.…
We develop a novel key routing algorithm for quantum key distribution (QKD) networks that utilizes a distribution of keys between remote, i.e., not directly connected by a QKD link, nodes through multiple non-overlapping paths. This…
Quantum correlation between nodes in a network which consist of several independent sources of entanglement and in multipartite entanglement systems are important for general understanding of the nature of nonlocality, quantum information…
A simple protocol which takes advantage of the inherent random times of detections in single photon counting modules is presented for random active basis choices when using entanglement-based protocols for Quantum Key Distribution (QKD). It…
This paper introduces the indigenous Quantum Network Simulator developed to simulate various quantum network protocols on classical machines. The paper specifically focuses on the simulation of entanglement generation between two quantum…
We study the entanglement dynamics of discrete time quantum walks acting on bounded finite sized graphs. We demonstrate that, depending on system parameters, the dynamics may be monotonic, oscillatory but highly regular, or quasi-periodic.…
A key goal of quantum communication is to determine the maximum number of bits shared between two quantum systems. An important example of this is in entanglement based quantum key distribution (QKD) schemes. A realistic treatment of this…
We show that a quantum walk process can be used to construct and secure quantum memory. More precisely, we show that a localized quantum walk with temporal disorder can be engineered to store the information of a single, unknown qubit on a…
Shared entanglement is a resource available to parties communicating over a quantum channel, much akin to public coins in classical communication protocols. Whereas shared randomness does not help in the transmission of information, or…
This paper considers a problem of quantum communication between parties that are connected through a network of quantum channels. The model in this paper assumes that there is no prior entanglement shared among any of the parties, but that…