In this article, we propose a quantum communication protocol via 2-step discrete time quantum walks with two coins on a graph of 10 vertices containing both cycles and paths. Quantum walks are known for their ability to integrate quantum mechanics dynamics like superposition and entanglement during the procedure. We calculate the total final quantum state of the system as well as the recovery operators to rescue the initial quantum state back at the receiver's location. Our work provides a fundamental block for a quantum teleportation scheme on a specific series of cycle and path graphs.
In this article, we propose a quantum communication protocol via 2-step discrete time quantum walks with two coins on a graph of 10 vertices containing both cycles and paths. Quantum walks are known for their ability to integrate quantum mechanics dynamics like superposition and entanglement during the procedure. We calculate the total final quantum state of the system as well as the recovery operators to rescue the initial quantum state back at the receiver's location. Our work provides a fundamental block for a quantum teleportation scheme on a specific series of cycle and path graphs.
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.
We introduce some new perfect state transfer and generalized long-distance teleportation schemes by quantum walks with two coins. By encoding the transferred information in the coin-1 state and alternately using two coin operators, we can perfectly recover the information in the coin-1 state at the target position by at most two flipping operations. On the basis of quantum walks with two coins on either a line or an N -circle, we can perfectly transfer any qubit state. In addition, using quantum walks with two coins on regular graphs, we can first implement a 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 a more general state. We also study how to realize generalized teleportation over long-distance walks by the above quantum walk models.
Abstract Perfect state transfer has attracted a great deal of attention recently due to its crucial role in quantum communication and scalable quantum computation. In this paper, we propose the perfect state transfer algorithms with a pair of sender-receiver and two pairs of sender-receiver on the complete bipartite graph respectively. The algorithm with a pair of sender-receiver is implemented through discrete-time quantum walk, flexibly setting the coin operators based on the positions of the sender and receiver. The algorithm with two pairs of sender-receiver ensures that the two quantum states are distributed on both sides of the complete bipartite graph during the process, thereby achieving perfect state transfer. In addition, the quantum circuits corresponding to the algorithms are provided. The algorithms can transfer an arbitrary quantum state and can simultaneously transfer two arbitrary quantum states from the senders to the receivers in any case. Moreover, the algorithms are not only applicable to complete bipartite graphs but also to more graph structures with complete bipartite subgraphs, which will provide potential applications for quantum information processing.
We suggest a new technique for bidirectional quantum teleportation (BQT) that combines coherent-state encoding with discrete-time quantum walks to allow two users to communicate quantum information simultaneously. Our method enables Alice and Bob to simultaneously teleport quantum states to one another within a single protocol, as compared to unidirectional teleportation, which only transmits quantum states in one direction. To allow for a qubit-like representation and fidelity analysis using Bloch vector formalism, the quantum information is encoded using non-orthogonal coherent states that are converted into an orthonormal basis of even and odd Schrödinger cat states. Four different quantum walk steps, each acting on a three-part quantum system made up of position and coin spaces, drive the teleportation process. We use density matrix overlaps in the even-odd basis to derive closed-form formulas for teleportation fidelity in both directions analytically. Using the SeQUeNCe discrete-event simulator, we simulate large-scale quantum network settings with realistic limitations, including photon loss, memory decoherence, entanglement swapping degradation, and various channel capacities in order to evaluate the potential of our approach. We evaluate quantum memory utilization, throughput, and end-to-end fidelity in various network topologies and scenarios. Our findings demonstrate that BQT allows symmetric communication with strong fidelity, particularly in high-capacity and large-scale network situations, but requires a greater resource overhead than unidirectional protocols. The hybrid framework developed in this study offers a scalable and analytically simple solution for next-generation quantum communication systems by combining discrete-time quantum evolution with continuous-variable state encoding.
Perfect state transfer between two marked vertices of a graph by means of a discrete-time quantum walk is analyzed. We consider the quantum walk search algorithm with two marked vertices, sender and receiver. It is shown by explicit calculation that, for the coined quantum walks on a star graph and a complete graph with self-loops, perfect state transfer between the sender and receiver vertex is achieved for an arbitrary number of vertices N in O(N) steps of the walk. Finally, we show that Szegedy's walk with queries on a complete graph allows for state transfer with unit fidelity in the limit of large N.
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.