Quantum Network Communication With a Novel Discrete-Time Quantum Walk

Abstract

In this paper, we propose a scheme using a new kind of quantum walk to realize quantum communication well. In our scheme, obviously, there are three advantages. First, the initial states can be transferred from the source to the target by finite steps, which will make execution easier in practice. Second, due to fewer restrictions to the network models, our scheme can be adapted to more general network models, such as the butterfly network, the inverted crown network, the grail network, and the generalized butterfly network G k. Finally, arbitrary single-qubit and two-qubit initial states can be transferred to different kinds of network models. At the same time, the fidelity and probability equal 1. Our work promotes more applications of combining quantum computation with quantum communication in the future.

Towards a distributed quantum computing ecosystem

“…Secure communications in the quantum field refer to the class of communication protocols that exploit quantum mechanics in order to get benefits unattainable using classical Internet. For instance, in the field of quantum cryptography, researchers study strategies for sharing keys among parties in total secrecy [31][32][33]. Whilst quantum byzantine agreement, a protocol used by multiple entities to distributively agree on a common decision, allows to achieve the consensus in a constant number of rounds, whereas classical protocols scale polynomially with the number of processors [34].…”

Effect of Quantum Noise on Deterministic Remote Preparation of an Arbitrary Two-Qubit State With a Relay Node

“…There are some similar works of RSP with noisy environment [39][40][41][42][43][44][45][46][47][48][49][50][51][52][53][54]. We compare our protocol with previous RSP schemes in the following aspects: the quantum channel, the number of relay nodes, whether it considers the noise effect and whether it is deterministic.…”

“…By applying entanglement swapping, quantum relay nodes make it possible for multiple users to realize long-distance quantum communication [41][42][43]. According to the development trend of quantum network, the RSP protocols among multiple participants in the network is calling for further investigations [44][45][46][47][48][49][50][51].…”

An Efficient Simulation of Quantum Secret Sharing

“…In our protocol, each player knows only his share, even the reconstructor knows only his share. In this protocol, we use some basic operations i.e., protocol-I of Shi et al [51], CN OT gate [37], secure communication [72,6,55,50,61,46,38,75,21,73,64,63,65], entangle state [71,53,54,7,45,52,59,58,57,49,47,42,48,56], Quantum Fourier Transform (QF T ) [19] and Inverse Quantum Fourier Transform (QF T −1 ) [19], to transform the particles. We use a quantum approach in classical secret sharing to combine the benefits of both classical and quantum secret sharing, preventing attacks such as Intercept-Resend (IR), Intercept, Entangle-Measure (EM), Forgery, Collision, and Collusion.…”