Related papers: A Throughput Optimal Scheduling Policy for a Quant…
In quantum networks, one way to communicate is to distribute entanglements through swapping at intermediate nodes. Most existing work primarily aims to create efficient two-party end-to-end entanglement over long distances. However, some…
Generation of entangled state is of paramount importance both from quantum theoretical foundation and technology applications. Entanglement swapping provides an efficient method to generate entanglement in quantum communication protocols.…
Bidirectional quantum teleportation scheme is a two-way quantum communication process, in which two parties simultaneously receive each other information. Recently, in paper [1] (Zhou et al., IEEE Access, 7, 44269 (2019)), a six-qubit…
We formulate the problem of finding the optimal entanglement swapping scheme in a quantum repeater chain as a Markov decision process and present its solution for different repeater's sizes. Based on this, we are able to demonstrate that…
We investigate the entanglement properties of pure quantum states describing $n$ qubits. We characterize all multipartite states which can be maximally entangled to local auxiliary systems using controlled operations. A state has this…
In this paper, a novel Deep Q-Network (DQN) based scheduling method to optimize delay time and fairness among entanglement requests in quantum repeater networks is proposed. The scheduling of requests determines which pairs of end nodes…
Throughput-optimal transmission scheduling in wireless networks has been a well considered problem in the literature, and the method for achieving optimality, MaxWeight scheduling, has been known for several decades. This algorithm achieves…
A novel quantum switch for continuous variables teleportation is proposed. Two pairs of EPR beams with identical frequency and constant phase relation are composed on two beamsplitters to produce two pairs of conditional entangled beams,…
A theoretical scheme for bidirectional swapping quantum controlled teleportation is presented using the entanglement property of maximally entangled five-qubit state, i.e., Alice wants to transmit a entangled state of particle a to Bob and…
We consider entanglement swapping schemes with general (rather than maximally) entangled bipartite states of arbitary dimension shared pairwise between three or more parties in a chain. The intermediate parties perform generalised Bell…
We consider a quantum switch with a finite number of quantum memory registers that aims to serve multipartite entanglement requests among $N$ users. We propose scheduling policies that aim to optimize the average number of requests served…
Quantum state transfer is one of the basic tasks in quantum information processing. We here propose a theoretical approach to realize arbitrary entangled state transfer through a qubit chain, which is a class of extended…
We consider multi-path routing of entanglement in quantum networks, where a pre-prepared multipartite entangled 2D cluster state serves as a resource to perform different tasks on demand. We show how to achieve parallel connections between…
The generation of entanglement across different nodes in distributed quantum architectures plays a pivotal role for different applications. In particular, deterministic, robust, and fast protocols that prepare genuine multipartite entangled…
Quantum spin chains may be used to transfer quantum states between elements of a quantum information processing device. A scheme discovered recently \cite{BFR+12} was shown to have favorable transfer properties for ingle-qubit states even…
Quantum teleportation is a primitive foundational protocol for exchanging quantum information in a quantum network as well as infrastructural operational strategy in the measurement-based quantum computation. Designing an efficient scheme…
We analyze various scenarios for entangling two initially unentangled qubits. In particular, we propose an optimal universal entangler which entangles a qubit in unknown state $|\Psi>$ with a qubit in a reference (known) state $|0>$. That…
Generating entanglement deterministically at a capacity-approaching rate is critical for next-generation quantum networks. We propose weak-coherent-state-assisted protocols that can generate entanglement near-deterministically between…
Protocols for distributed quantum systems commonly require the simultaneous availability of $n$ entangled states, each with a fidelity above some fixed minimum $F_{\mathrm{app}}$ relative to the target maximally-entangled state. However,…
We study the stability of entanglement in a quantum computer implementing an efficient quantum algorithm, which simulates a quantum chaotic dynamics. For this purpose, we perform a forward-backward evolution of an initial state in which two…