The ability of quantum walks to evolve in a superposition of distinct quantum states has been used as a resource in quantum communication protocols. Under certain settings, the
k-cycle discrete-time quantum walks (DTQW) are known to recur to its initial state after every
tr steps. We first present a scheme to optically realize any
k-cycle DTQW using
J-plate, orbital angular momentum (OAM) sorters, optical switch, and optical delay line. This entangles the polarization and OAM degrees of freedom (DoF) of a single photon. Making use of this recurrence phenomena of
k-cycle DTQW and the entanglement generated during the evolution, we present an alternate quantum direct communication protocol. The recurrence and entanglement in the
k-cycle walk are effectively used to retrieve and secure the information, respectively, in the proposed protocol. We investigate the security of the protocol against intercept and the resend attack. We also quantify the effect of amplitude damping and depolarizing noises on recurrence and mutual information between polarization and the OAM DoF of a single photon. Finally, we indicated an optimal attack strategy by which an Eavesdropper can tamper part of the message without revealing her presence. However, when the quantum communication channel is less noisy, any attempt by the Eavesdropper to tamper the message would end up in exposing her to the receiver.
Abstract The utilization of quantum entanglement as a cryptographic resource has superseded conventional approaches to secure communication. Security and fidelity of intranetwork communication between quantum devices is the backbone of a quantum network. This work presents an protocol that generates entanglement between any two directly connected nodes of a quantum network to be used as a resource to enable quantum communication across that pair in the network. The protocol is based on a directed discrete-time quantum walk and paves the way for private inter-node quantum communication channels in the network. We also present the simulation results of this protocol on random networks generated from various models. We show that after implementation, the probability of the walker being at all nodes other than the source and target is negligible and this holds independent of the random graph generation model. This constitutes a viable method for the practical realisation of secure communication over any random network topology.
Recently, Wang et al. [Wang et al., Quantum Inf. Process. 16 (2017) 221] developed generalized teleportation schemes based on different quantum walks structures. In their paper, an interesting open question is whether there are other graphs suitable for teleportation. Here, we extend the results of quantum teleportation of an unknown qubit state by means of discrete-time quantum walks and propose two kinds of schemes for quantum teleportation by means of discrete-time quantum walks on N-lines and N-cycles, respectively. Likewise, prior quantum entanglement is unnecessary for teleportation and quantum entanglement is generated by means of quantum walks. This further opens wider applications of quantum walks in quantum communication protocols.