Deterministic remote state preparation with weight graph states in quantum networks

Abstract

The weight graph states (WGS) usually serve as the imperfect generation of the graph states due to the limitation in experiments. In this paper, we study the deterministic remote state preparation (RSP) protocol by leveraging multiple WGS. First, we introduce the quantum circuit of the entanglement concentration based on the theory of majorization, calculating the entanglement coefficients by applying the Schmidt decomposition onto the bipartite WGS. Then, we establish the positive operator-valued measurement (POVM) that helps to extract available entanglement for the RSP protocol. In three-particle 1D WGS, we demonstrate that the bipartite entanglement between the sender and the receiver depends on the measurement basis selected by the repeater node. Here we find a set of orthogonal bases that retains the entanglement unchanged, which guarantees the robustness of the RSP scheme. In the end, we discuss the performance of our protocol and extend the channel to the multi-particle 1D WGS, illustrating the relationship between the entanglements and the different weights of edges. Our scheme provides a viable method to reuse the imperfect graph states, hoping to contribute to the future study of graph states in quantum networks.