Quantum communication protocols by quantum walks with two coins

Abstract

We introduce some new perfect state transfer and teleportation schemes by quantum walks with two coins. Encoding the transferred information in coin 1 state and alternatively using two coin operators, we can perfectly recover the information on coin 1 state at target position only by at most two times of flipping operation. Based on quantum walks with two coins either on the line or on the N -circle, we can perfectly transfer any qubit state. In addition, using quantum walks with two coins either on complete graphs or regular graphs, we can first implement perfect qudit state transfer by quantum walks. Compared with existing schemes driven by one coin, more general graph structures can be used to perfectly transfer more general state. Moreover, the external control of coin operator during the transmitting process can be decreased greatly. Selecting coin 1 as the sender and coin 2 as the receiver, we also study how to realize generalized teleportation over long steps of walks by the above quantum walk models. Because quantum walks is an universal quantum computation model, our schemes may provide an universal platform for the design of quantum network and quantum computer.

Quantum Secret Sharing Scheme with Credible Authentication based on Quantum Walk

“…The walker moves from n to 1 + n if the tossed coin is 0 and steps backwards to 1 − n if the tossed coin is 1 . In the past two years, Wang et al [22] and Shang et al [23] have successfully applied quantum walk to the communication protocol of particle teleportation. In detail, the conditional shift operator can introduce entanglement between position space and coin space, this entanglement resource can be used as quantum channel for teleportation.…”

“…Quantum walk is the quantum correspondence of classic walk, first proposed by Aharonov etal in 1993 [19]. Quantum walks show meaningful applications in many ways [20,21], and applications in communication protocols are beginning to emerge [22][23][24]. In the past two years, Wang et al [22] and Shang et al [23] proposed the successful application of different models of quantum walk in teleportation.…”

Quantum Network Communication With a Novel Discrete-Time Quantum Walk

“…Moreover, it is not sure about how many steps to take to achieve PST on the corresponding network. In 2018, Shang et al [31] proposed quantum communication protocols to realize the PST with two coins on the line and graph.…”

Experimental realization of state transfer by quantum walks with two coins

“…Different from existing schemes driven by one coin, we prosed some quantum communication protocols by quantum walks with two coins. By alternatively using two coin operators, we can perfectly transfer a more general state on more general graph structures 1 .…”

“…IBM quantum circuit diagram of GHZ state transfer on 8-complete graph from x = 0 to x = 4. q[0] represents the ancillary qubit. q[1], q[2] and q[3]represent position space. q[4], q[5], q[6] and q[7], q[8], q[9] represent 1-st coin space and 2-nd coin space respectively.…”