Generalized quantum teleportation of shared quantum secret with quantum walks

Abstract

Very recently, Lee et al. proposed the first secure quantum teleporation protocol, where quantum information shared by an arbitrary number of senders can be transferred to another arbitrary number of receivers. Here, by introducing quantum walks, a novel secure (n,m) quantum teleportation of shared quantum secret between n senders and $m$ receivers is presented. Firstly, two kinds of (n,2) teleportation schemes are proposed by n-walker quantum walks on the line, the first walker of which is driven by three coins, respectively, based on two kinds of coin operators: the homogeneous coins and the position-dependent coins. Secondly, by increasing the amount of the coins of the first walker to m+1, the previous (n,2) scheme can be generalized to (n,m) teleportation scheme. Then, we give the proof of the information security of our proposed scheme, in which neither any single nor subparties of senders and receivers can fully access the secret quantum information. Moreover, the projective measurements are needed, instead of the joint Bell measurements that are necessary in Lee et al.'s protocol. Our work can also be extended further to QWs on the cycle. This work provides an additional relevant instance of the richness of quantum walks for quantum information processing tasks and thus opens the wider application purpose of quantum walks.

12 pages

References in corpus (8)

• Universal computation by multi-particle quantum walk
• Quantum information splitting using multi-partite cluster states
• Quantum Walk on a Line with Two Entangled Particles
• Prior entanglement between senders enables perfect quantum network coding with modification
• Quantum random walk of two photons in separable and entangled state
• Parrondo's game using a discrete-time quantum walk
• Implementation of generalized measurements on a qudit via quantum walks
• Invariance in quantum walks with time-dependent coin operators