Bidirectional multi-nodes quantum teleportation using discrete-time quantum walk Authors: N. Ikken, P. Kumar, A. Slaoui, B. Kar, R. Ahl Laamara, M. Zomorodi, A. A. Abd El-Latif Published: 2025 ABSTRACT 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. Introduction One of the most well-known methods in quantum information theory is quantum teleportation, which provides a way to move unknown quantum states between different places without actually sending the particles. Teleportation was first introduced by Bennett and associates in the early 1990s1, and since then, it has been a fundamental component of distributed quantum computation, quantum cryptography, and quantum communication2–6. Recent developments have sparked an increasing interest in Bidirectional Quantum Teleportation (BQT)7,8, where two users concurrently exchange quantum information, while the majority of early implementations and theoretical models were on Unidirectional Quantum Teleportation (UQT). In addition to improving channel efficiency, this symmetric communication style satisfies the structural requirements of scalable quantum networks9,10. But the fundamental entanglement distribution process’s scalability and stability provide an important obstacle to teleportation. Inspired by the classic idea of random walks, discrete-time quantum walks (DTQWs)11 have become effective tools for resembling quantum dynamics and allowing intricate quantum network protocols. Contrary to their classical equivalents, DTQWs take advantage of quantum interference and superposition to achieve richer dynamics and faster transmission. DTQWs are everywhere for quantum computation and helpful for building quantum search and routing algorithms, according to theoretical studies12–14. These features make them particularly well-suited for controlling the propagation of states in a teleportation protocol that necessitates coherence within various subsystems. We use DTQWs’ transport capabilities in our suggested scheme to create a reliable and effective bidirectional teleportation mechanism15. We base our approach on a new framework in which the teleportable information is represented in superpositions of non-orthogonal coherent states rather than qubit states. Often used in quantum optics, coherent states are more appropriate for continuous-variable quantum communication systems and are naturally resilient to some forms of noise16. We express the incoming quantum information in a discrete, qubit-like form by building an orthonormal basis of even and odd coherent states, also referred to as Schrödinger cat states17,18. This makes processing and fidelity analysis easier. We can use Bloch vector formalism to analytically model the teleportation process by encoding Alice’s and Bob’s states in such a basis. By using this formalism, we may represent the input and output quantum states as density matrices with directional vectors and transfer them to locations on the Bloch sphere19. In addition to offering a clear geometric representation of the protocol, this method makes it possible to precisely calculate the fidelity of teleportation, a measure of how closely the transmitted state matches the original. Four discrete-time quantum walk steps are used to carry out the actual teleportation procedure. Alice and Bob, each have a three-part system that includes two coin spaces and a position. These systems are set up so that one of the coin registers corresponds to the unknown quantum state of each user. The quantum walk’s steps are made to apply Hadamard gates and conditional shift operations, ensuring the logical development and final exchange of encoded quantum information20. The simultaneous bidirectional quantum teleportation is made possible throughout the evolution by interference effects brought about by quantum superposition. We used the SeQUeNCe quantum network simulator21 to perform a thorough evaluation of performance in order to determine the possibility of the suggested system. Realistic quantum communication networks with physical limitations, including decoherence, photon loss, channel attenuation, and memory limits, are modeled by this simulator. We examine the performance, fidelity, and quantum memory utilization of the teleportation protocol in our simulation scenario, which is a 200 node network with Waxman connections22. The results show that BQT provides competitive fidelity and network utilization in exchange for its symmetric and concurrent communication capacity, even though it fundamentally uses more resources than UQT. In addition, we find that coherent-state encoding improves resilience against noise and loss, which are particularly damaging in long-distance quantum communication23, in addition to providing a deeper framework for quantum state representation. The suggested protocol exhibits potential for practical applications of symmetrical quantum communication lines and next-generation quantum internet infrastructure when paired with DTQW-based routing and entanglement distribution24,25. Finally, we present an adaptable and analytically simple model for bidirectional quantum teleportation that combines coherent-state encoding with discrete-time quantum walks. Through the integration of ideas from discrete quantum computation and continuous-variable quantum optics26, we develop a hybrid teleportation framework that is compatible with the real-world limitations of large-scale quantum networks while ensuring high-fidelity transmission. Therefore, the suggested approach provides opportunities for further study of fault-tolerant entanglement routing strategies, adapted quantum walks, and hybrid CV-DV teleportation schemes27. Related work Bennett et al.1 were the first to introduce quantum teleportation, which laid the foundation for non-local quantum communication through the use of shared entanglement and classical channels. Unidirectional quantum teleportation (UQT), in which quantum states are transferred from a sender to a receiver in a single direction, was the main focus of early research. Since then, these protocols have been extended into higher-dimensional and multi-qubit frameworks20. A symmetric variant of UQT that allows two users to exchange quantum states at the same time is called bidirectional quantum teleportation (BQT). Numerous models have been developed in this direction, such as hybrid techniques using discrete and continuous variables8,27, and controlled bidirectional teleportation using multi-qubit entangled states7,28. Additionally, in29, the theoretical framework for general quantum networks was built. Discrete-time quantum walks (DTQWs) have become a promising tool in quantum communication and computation in recent years. The algorithmic applications of DTQWs30,31, fast state propagation, and interference-based benefits over conventional random walks32 have all been the subject of much research. Because of these characteristics, they are especially appropriate for tasks like teleportation33 that require coherent quantum state transfer. Through DTQW dynamics, teleportation has been explored in several attempts. Krishna et al.33, for example, used quantum walks on particular graph configurations to study bidirectional teleportation. However, a lot of models have ignored the useful advantages of continuous-variable systems in favor of concentrating on qubit-based encoding. Coherent-state teleportation techniques have been investigated for their noise resistance and feasibility in optical networks in the field of continuous-variable quantum communication34–36. As proven by Ikken et al.8, recent work has suggested encoding qubit-like information in non-orthogonal coherent states and analyzing them in orthonormal cat-state bases. As far as we are aware, our suggested protocol is the first to combine a complete bidirectional quantum walk-based teleportation framework over multi-node quantum networks with coherent-state encoding. Additionally, we offer performance simulations under realistic limits using SeQUeNCe21 as well as analytical fidelity derivations applying Bloch vector formalism. In addition to showing excellent fidelity, this hybrid CV-DV method provides flexibility and scalability for designing quantum networks. One-dimensional quantum walk A one-dimensional discrete-time quantum walk37 takes place in the composite Hilbert space1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \mathcal {H} \;=\; \mathcal {H}_P \,\otimes \, \mathcal {H}_C, \end{aligned}$$\end{document}where\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {H}_P = \textrm{span}\{\,|n\rangle : n\in \mathbb {Z}\}, \qquad \mathcal {H}_C = \textrm{span}\{\;|0\rangle ,\;|1\rangle \}.$$\end{document}Here, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {H}_P$$\end{document} represents the infinite one-dimensional lattice of positions labeled by integer n, and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {H}_C$$\end{document} is a two-dimensional “coin” space that governs the direction of motion. State of the walker At discrete time t, the full state of the walker is38:2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} |\Psi (t)\rangle \;=\; \sum _{n\in \mathbb {Z}} \left[ \psi _{n,0}(t)\,|n\rangle \!\otimes \!|0\rangle \;+\; \psi _{n,1}(t)\,|n\rangle \!\otimes \!|1\rangle \right] \end{aligned}$$\end{document}where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\psi _{n,c}(t)\in \mathbb {C}$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sum _{n,c}|\psi _{n,c}(t)|^2=1$$\end{document}. Single-step evolution One time-step of the walk is implemented by the unitary operator393\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} W(\ell ) \;=\; E(\ell )\,\left( I \otimes C\right) , \end{aligned}$$\end{document}where C is the coin operator acting on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {H}_C$$\end{document}:4\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} C \;=\; \begin{pmatrix} \sqrt{\rho } & \sqrt{1-\rho }\,e^{i\theta } \\ \sqrt{1-\rho }\,e^{i\phi } & -\,\sqrt{\rho }\,e^{i(\theta +\phi )} \end{pmatrix}. \end{aligned}$$\end{document}While \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$E(\ell )$$\end{document} is the conditional shift on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {H}_P\otimes \mathcal {H}_C$$\end{document},5\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} E(\ell ) & = \left( |\eta +1\rangle \left\langle \eta \left| \otimes \bigotimes _{j=1}^{n-1} I_j \otimes \right| 0\right\rangle _n\langle 0| \otimes \bigotimes _{d=n+1}^{N} I_d \right. \nonumber \\ & \quad \left. + |\eta -1\rangle \left\langle \eta \left| \otimes \bigotimes _{j=1}^{n-1} I_j \otimes \right| 1\right\rangle _n\langle 1| \otimes \bigotimes _{d=n+1}^{N} I_d \right) \nonumber \\ & \quad \times \left( I_p \otimes \bigotimes _{j=1}^{n-1} I_j \otimes C_n \otimes \bigotimes _{d=n+1}^{N} I_d \right) , \end{aligned}$$\end{document}which give6\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} E(\ell ) = S \,\otimes \, |0\rangle \langle 0| \;+\; S^\dagger \,\otimes \, |1\rangle \langle 1|. \end{aligned}$$\end{document}Here, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\ell$$\end{document} may denote a step-dependent phase or disorder parameter (often set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\ell =1$$\end{document} for homogeneous walks). Shift operators The S right-shift and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S^\dagger$$\end{document} left-shift operators on the position space are40\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} S = \sum _{\eta \in \mathbb {Z}} |\eta +1\rangle \langle \eta |, \qquad S^\dagger = \sum _{\eta \in \mathbb {Z}} |\eta -1\rangle \langle \eta |. \end{aligned}$$\end{document} Figure 1 provides a step-by-step explanation of this one-dimensional DTQW (coin toss followed by conditional shift). Thus, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$E(\ell )$$\end{document} moves the walker one site to the right if the coin is in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$|0\rangle$$\end{document}, or one site to the left if in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$|1\rangle$$\end{document}.Fig. 1Illustration of a discrete-time quantum walk on a one-dimensional lattice. At each time step, a quantum coin determines the walker’s direction: outcome \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{0}\rangle }$$\end{document} results in a rightward move from position i to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$i+1$$\end{document}, while outcome \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{1}\rangle }$$\end{document} causes a leftward move from i to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$i-1$$\end{document}. Illustration of a discrete-time quantum walk on a one-dimensional lattice. At each time step, a quantum coin determines the walker’s direction: outcome \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{0}\rangle }$$\end{document} results in a rightward move from position i to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$i+1$$\end{document}, while outcome \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{1}\rangle }$$\end{document} causes a leftward move from i to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$i-1$$\end{document}. Quantum versus classical Unlike the classical random walk, the quantum walk exploits superposition and interference:After the coin toss \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$I\otimes C$$\end{document}, the coin state typically becomes a superposition \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha |0\rangle + \beta |1\rangle$$\end{document}.The subsequent conditional shift E propagates each amplitude coherently, leading to interference between paths.This interference can produce ballistic spreading of the walker (variance \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\propto t^2$$\end{document}) rather than diffusive (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\propto t$$\end{document}) behavior. After the coin toss \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$I\otimes C$$\end{document}, the coin state typically becomes a superposition \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha |0\rangle + \beta |1\rangle$$\end{document}. After the coin toss \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$I\otimes C$$\end{document}, the coin state typically becomes a superposition \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha |0\rangle + \beta |1\rangle$$\end{document}. The subsequent conditional shift E propagates each amplitude coherently, leading to interference between paths. The subsequent conditional shift E propagates each amplitude coherently, leading to interference between paths. This interference can produce ballistic spreading of the walker (variance \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\propto t^2$$\end{document}) rather than diffusive (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\propto t$$\end{document}) behavior. This interference can produce ballistic spreading of the walker (variance \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\propto t^2$$\end{document}) rather than diffusive (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\propto t$$\end{document}) behavior. Bidirectional quantum teleportation using coherent states In our bidirectional quantum teleportation method based on quantum walks, we encode quantum information using coherent states. Since the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{-\alpha }\rangle }$$\end{document} coherent states are usually non-orthogonal, they satisfy:7\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \langle \alpha | -\alpha \rangle = e^{-2|\alpha |^2}. \end{aligned}$$\end{document}We define Alice and Bob’s quantum states as superpositions of these coherent states:8\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {|{\phi }\rangle }_A&= \mathcal {N}_1 \left( \varepsilon _+ {|{\alpha }\rangle } + \varepsilon _- {|{-\alpha }\rangle } \right) , \end{aligned}$$\end{document}9\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {|{\phi }\rangle }_B&= \mathcal {N}_2 \left( \tau _+ {|{\alpha }\rangle } + \tau _- {|{-\alpha }\rangle } \right) , \end{aligned}$$\end{document}where Alice’s state is defined by the coefficients \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon _+ = \cos \theta$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon _- = \sin \theta \, e^{i\varphi }$$\end{document}. For Bob’s state, the parameters \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau _+$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau _-$$\end{document} are general complex amplitudes. Proper normalization is possible by the constants \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {N}_1$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {N}_2$$\end{document}. The following is the encoding of the logical qubits associated with a two-dimensional Hilbert space in terms of even and odd coherent states:\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$|\alpha _+\rangle \rightarrow |0_L\rangle , \quad |\alpha _-\rangle \rightarrow |1_L\rangle .$$\end{document} Normalization Because \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{\alpha }\rangle }$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{-\alpha }\rangle }$$\end{document} are not orthogonal, the normalization constant \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {N}_1$$\end{document} may be obtained using:10\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \mathcal {N}_1 = \left[ |\varepsilon _+|^2 + |\varepsilon _-|^2 + 2 e^{-2|\alpha |^2} \, \text {Re} \left( \varepsilon _+ \varepsilon _-^* \right) \right] ^{-1/2}. \end{aligned}$$\end{document}For our choice of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon _+$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon _-$$\end{document}:11\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} |\varepsilon _+|^2&= \cos ^2 \theta _a, \end{aligned}$$\end{document}12\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} |\varepsilon _-|^2&= \sin ^2 \theta _a \end{aligned}$$\end{document}13\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \text {Re} \left( \varepsilon _+ \varepsilon _-^* \right)&= \cos \theta _a \sin \theta _a \cos \varphi _a, \end{aligned}$$\end{document}which leads to:14\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \mathcal {N}_1 = \left[ 1 + 2 e^{-2|\alpha |^2} \cos \theta _a \sin \theta _a \cos \varphi _a \right] ^{-1/2}. \end{aligned}$$\end{document}Bob’s state’s normalization \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {N}_2$$\end{document} is defined similarly by:15\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \mathcal {N}_2 = \left[ |\tau _+|^2 + |\tau _-|^2 + 2 e^{-2|\alpha |^2} \, \text {Re} \left( \tau _+ \tau _-^* \right) \right] ^{-1/2}. \end{aligned}$$\end{document}With the expressions of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$|\tau _+|$$\end{document}, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$|\tau _-|$$\end{document}, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\text {Re} \left( \tau _+ \tau _-^* \right)$$\end{document} are written as follows:16\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} |\tau _+|^2&= \cos ^2 \theta _b, \end{aligned}$$\end{document}17\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} |\tau _-|^2&= \sin ^2 \theta _b \end{aligned}$$\end{document}18\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \text {Re} \left( \tau _+ \tau _-^* \right)&= \cos \theta _b \sin \theta _b \cos \varphi _b, \end{aligned}$$\end{document}Which gives at the end:19\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \mathcal {N}_2 = \left[ 1 + 2 e^{-2|\alpha |^2} \cos \theta _b \sin \theta _b \cos \varphi _b \right] ^{-1/2}. \end{aligned}$$\end{document} Even and odd coherent states In the Hilbert space spanned by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{\alpha }\rangle }$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{-\alpha }\rangle }$$\end{document}, we define the even and odd coherent states (also called Schrödinger cat states) in order to build an orthonormal basis:20\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {|{\phi ^+}\rangle }&= \mathcal {N}^+ \left( {|{\alpha }\rangle } + {|{-\alpha }\rangle } \right) , \end{aligned}$$\end{document}21\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {|{\phi ^-}\rangle }&= \mathcal {N}^- \left( {|{\alpha }\rangle } - {|{-\alpha }\rangle } \right) , \end{aligned}$$\end{document}with normalization constants:22\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \mathcal {N}^+&= \left[ 2 \left( 1 + e^{-2|\alpha |^2} \right) \right] ^{-1/2}, \end{aligned}$$\end{document}23\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \mathcal {N}^-&= \left[ 2 \left( 1 - e^{-2|\alpha |^2} \right) \right] ^{-1/2}. \end{aligned}$$\end{document}These states satisfy:24\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \langle \phi ^+|\phi ^+\rangle = \langle \phi ^-|\phi ^-\rangle = 1, \quad \langle \phi ^+|\phi ^-\rangle = 0. \end{aligned}$$\end{document} Rewriting in the even and odd basis \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{\alpha }\rangle }$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{-\alpha }\rangle }$$\end{document} can be expressed using the even/odd basis:25\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {|{\alpha }\rangle }= \frac{1}{\mathcal {N}^+} {|{\phi ^+}\rangle } + \frac{1}{\mathcal {N}^-} {|{\phi ^-}\rangle }, \end{aligned}$$\end{document}26\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {|{-\alpha }\rangle }= \frac{1}{\mathcal {N}^+} {|{\phi ^+}\rangle } - \frac{1}{\mathcal {N}^-} {|{\phi ^-}\rangle }. \end{aligned}$$\end{document}Substituting into Alice’s state, we get:27\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \begin{aligned} {|{\phi }\rangle }_A&= \mathcal {N}_1 \left[ \varepsilon _+ \left( \frac{1}{\mathcal {N}^+} {|{\phi ^+}\rangle } + \frac{1}{\mathcal {N}^-} {|{\phi ^-}\rangle } \right) \right. \\ &\left. \quad + \varepsilon _- \left( \frac{1}{\mathcal {N}^+} {|{\phi ^+}\rangle } - \frac{1}{\mathcal {N}^-} {|{\phi ^-}\rangle } \right) \right] \\ {|{\phi }\rangle }_A &= \mathcal {N}_1 \left[ \left( \frac{\varepsilon _+ + \varepsilon _-}{\mathcal {N}^+} \right) {|{\phi ^+}\rangle } + \left( \frac{\varepsilon _+ - \varepsilon _-}{\mathcal {N}^-} \right) {|{\phi ^-}\rangle } \right] \end{aligned} \end{aligned}$$\end{document}This formula shows how Alice’s state is broken down in an orthonormal basis, which is necessary for multiple teleportation protocol procedures. Like Bob:28\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {|{\phi }\rangle }_B = \mathcal {N}_2 \left[ \left( \frac{\tau _+ + \tau _-}{\mathcal {N}^+} \right) {|{\phi ^+}\rangle } + \left( \frac{\tau _+ - \tau _-}{\mathcal {N}^-} \right) {|{\phi ^-}\rangle } \right] \end{aligned}$$\end{document}The accuracy and distinguishability of the encoded information are significantly impacted by the non-orthogonality between \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{\alpha }\rangle }$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{-\alpha }\rangle }$$\end{document}. Throughout the normalization constants, the parameter \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$p = e^{-2|\alpha |^2}$$\end{document} happens and influences how the even and odd coherent states behave. When \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$|\alpha |$$\end{document} is large, the overlap decreases and the states are almost orthogonal. Figure 2 shows a side-by-side schematic contrasting the quantum walk to the classical random walk, showing interference and faster spreading.Fig. 2Comparison between classical discrete-time random walk and quantum walk. The quantum version uses a Hadamard gate for coin flip and shift conditioned on the coin state, resulting in interference and entanglement. Comparison between classical discrete-time random walk and quantum walk. The quantum version uses a Hadamard gate for coin flip and shift conditioned on the coin state, resulting in interference and entanglement. Bidirectional coherent state teleportation using quantum walk Let’s say we wish to use coherent states on an even–odd basis to accomplish bidirectional quantum teleportation between Alice and Bob. \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{\phi }\rangle }_A = \mathcal {N}_1 \left[ \left( \frac{\varepsilon _+ + \varepsilon _-}{\mathcal {N}^+} \right) {|{\phi ^+}\rangle } + \left( \frac{\varepsilon _+ - \varepsilon _-}{\mathcal {N}^-} \right) {|{\phi ^-}\rangle } \right]$$\end{document} , which she wants to send to Bob. At the same time, Bob has another state \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{\phi }\rangle }_B = \mathcal {N}_2 \left[ \left( \frac{\tau _+ + \tau _-}{\mathcal {N}^+} \right) {|{\phi ^+}\rangle } + \left( \frac{\tau _+ - \tau _-}{\mathcal {N}^-} \right) {|{\phi ^-}\rangle } \right]$$\end{document} that he wants to send to Alice. This bidirectional teleportation can be done simultaneously using quantum walk techniques. Figure 3 shows the complete circuit implementation of our coin-controlled walk-based bidirectional coherent-state teleportation. We assume that Alice has three quantum particles, called A1, A2, and A3, in order to put this into practice. While the particles A2 and A3 represent two internal degrees of freedom, which we label coin spaces \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {C}_1$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {C}_2$$\end{document}, respectively, the initial particle, A1, encodes the position space \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {P}_{A1}$$\end{document}.Fig. 3Quantum circuit for bidirectional quantum teleportation using coin-controlled walks and parity-based entanglement. Qubits \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$P_{A_1}$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$P_{B_2}$$\end{document} represent the positions of Alice and Bob, respectively. Qubits \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C_3$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C_4$$\end{document} act as quantum coins driving discrete-time quantum walks. The input states \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$|\phi _A\rangle$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$|\phi _B\rangle$$\end{document} are the coherent-encoded logical qubits to be teleported. The final multi-controlled operations represent correction gates conditioned on the measurement outcomes of ancillary entanglement qubits. Quantum circuit for bidirectional quantum teleportation using coin-controlled walks and parity-based entanglement. Qubits \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$P_{A_1}$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$P_{B_2}$$\end{document} represent the positions of Alice and Bob, respectively. Qubits \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C_3$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C_4$$\end{document} act as quantum coins driving discrete-time quantum walks. The input states \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$|\phi _A\rangle$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$|\phi _B\rangle$$\end{document} are the coherent-encoded logical qubits to be teleported. The final multi-controlled operations represent correction gates conditioned on the measurement outcomes of ancillary entanglement qubits. Bob owns three quantum particles as well: B1, B2, and B3. The particles B2 and B3 represent the coin spaces \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {C}_3$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {C}_4$$\end{document}, respectively, while the state of B1 corresponds to the position space \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {P}_{B1}$$\end{document}. This configuration allows us to use a quantum walk protocol, in which Alice and Bob’s unknown states can be exchanged simultaneously through defined interactions between the position and coin spaces. The protocol starts with Alice’s initial coin space, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {C}_1$$\end{document}, encoded with the unknown quantum state she wishes to be transferred. Similarly, Bob’s coin space \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {C}_3$$\end{document} includes his state. Both particles A1 and B1 begin at position zero when we initialize the position spaces \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {P}_{A1}$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {P}_{B1}$$\end{document} to the state \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{0}\rangle }$$\end{document}. Also initialized to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{0}\rangle }$$\end{document} are the additional coin spaces, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {C}_2$$\end{document} for Alice and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {C}_4$$\end{document} for Bob. So, the system’s complete initial state, expressed in an actual order, is:29\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {|{\Psi }\rangle }_{A_p,B_p,C_1,C_3,C_2,C_4} = {|{00}\rangle } \otimes {|{\phi }\rangle }_{A} \otimes {|{0}\rangle } \otimes {|{\phi }\rangle }_{B} \otimes {|{0}\rangle } \end{aligned}$$\end{document}30\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {|{\Psi }\rangle }_{A_p,B_p,C_1,C_3,C_2,C_4} & = {|{00}\rangle } \otimes \mathcal {N}_1 \left[ \left( \frac{\varepsilon _+ + \varepsilon _-}{\mathcal {N}^+} \right) {|{\phi ^+}\rangle } \right. \nonumber \\ & \quad \left. +\left( \frac{\varepsilon _+ - \varepsilon _-}{\mathcal {N}^-} \right) {|{\phi ^-}\rangle } \right] \otimes {|{0}\rangle } \otimes \mathcal {N}_2 \nonumber \\ & \quad \left[ \left( \frac{\tau _+ + \tau _-}{\mathcal {N}^+} \right) {|{\phi ^+}\rangle } + \left( \frac{\tau _+ - \tau _-}{\mathcal {N}^-} \right) {|{\phi ^-}\rangle } \right] \otimes {|{0}\rangle } \end{aligned}$$\end{document}Equation 30 describes the separable pre-walk initialization. The inter-user entanglement required for bidirectional teleportation is generated unitarily by the cross-controlled walk steps W(3) and W(4), which entangle \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(A_3,B_1)$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(B_3,A_1)$$\end{document} respectively, yielding a shared bipartite resource prior to the recovery operations. The position registers for Alice and Bob are represented by the two initial \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{00}\rangle }$$\end{document} states, while Alice’s second coin (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C_{1,2}$$\end{document}) and Bob’s second coin (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C_{3,4}$$\end{document}) are represented by the last two \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{0}\rangle }$$\end{document} states. The four separate steps (which are referred to as walks) that make up the functional quantum teleportation process are as follows:31\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} W(1) = E(1) \left( I_{A1} \otimes I_{B1} \otimes I_{A2} \otimes I_{A3} \otimes I_{B2} \otimes I_{B3} \right) , \nonumber \\ W(2) = E(2) \left( I_{A1} \otimes I_{B1} \otimes I_{A2} \otimes I_{A3} \otimes I_{B2} \otimes I_{B3} \right) , \nonumber \\ W(3) = E(3) \left( I_{A1} \otimes I_{B1} \otimes I_{A2} \otimes H_{A3} \otimes I_{B2} \otimes I_{B3} \right) , \nonumber \\ W(4) = E(4) \left( I_{A1} \otimes I_{B1} \otimes I_{A2} \otimes I_{A3} \otimes I_{B2} \otimes H_{B3} \right) . \end{aligned}$$\end{document}Here, the operators \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$E_1, E_2, E_3, E_4$$\end{document} are defined as:32\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} E(1)&= \left( S \otimes I_{B1} \otimes {|{0}\rangle }{\langle {0}|}_{A2} \otimes I_{A3} \otimes I_{B2} \otimes I_{B3} \right) \nonumber \\&\quad + \left( S^\dagger \otimes I_{B1} \otimes {|{1}\rangle }{\langle {1}|}_{A2} \otimes I_{A3} \otimes I_{B2} \otimes I_{B3} \right) , \end{aligned}$$\end{document}33\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} E(2)&= \left( I_{A1} \otimes S \otimes I_{A2} \otimes I_{A3} \otimes {|{0}\rangle }{\langle {0}|}_{B2} \otimes I_{B3} \right) \nonumber \\&\quad + \left( I_{A1} \otimes S^\dagger \otimes I_{A2} \otimes I_{A3} \otimes {|{1}\rangle }{\langle {1}|}_{B2} \otimes I_{B3} \right) , \end{aligned}$$\end{document}34\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} E(3)&= \left( I_{A1} \otimes S \otimes I_{A2} \otimes {|{0}\rangle }{\langle {0}|}_{A3} \otimes I_{B2} \otimes I_{B3} \right) \nonumber \\&\quad + \left( I_{A1} \otimes S^\dagger \otimes I_{A2} \otimes {|{1}\rangle }{\langle {1}|}_{A3} \otimes I_{B2} \otimes I_{B3} \right) , \end{aligned}$$\end{document}35\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} E(4)&= \left( S \otimes I_{B1} \otimes I_{A2} \otimes I_{A3} \otimes I_{B2} \otimes {|{0}\rangle }{\langle {0}|}_{B3} \right) \nonumber \\&\quad + \left( S^\dagger \otimes I_{B1} \otimes I_{A2} \otimes I_{A3} \otimes I_{B2} \otimes {|{1}\rangle }{\langle {1}|}_{B3} \right) . \end{aligned}$$\end{document} Figure 4 illustrates the proposed bidirectional quantum teleportation (BQT) protocol based on discrete-time quantum walks (DTQWs). In this scheme, Alice and Bob each hold an unknown quantum state, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{\psi _A}\rangle }$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{\psi _B}\rangle }$$\end{document}, which they exchange simultaneously through a shared DTQW channel. The sequence of walk operators W(1)–W(4) performs the conditional shift and coin operations that generate entanglement between their local subsystems and enable bidirectional information flow. After the walk evolution, both users perform local measurements and apply correction operations based on the classical information they exchange. This process allows each participant to recover the other’s state, demonstrating the core idea of simultaneous two-way quantum teleportation using a single unified DTQW evolution.Fig. 4Bidirectional quantum teleportation (BQT) conceptual illustration Alice and Bob share a discrete-time quantum walk (DTQW) channel and exchange an unknown coherent-state qubit (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{\psi _A}\rangle }$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{\psi _B}\rangle }$$\end{document}) simultaneously. Entanglement between their local coin spaces is created by the walk evolution \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$W(1)\!\rightarrow \!W(4)$$\end{document}, allowing quantum information to move in both directions. Following local measurements, the teleported states are recovered by applying rectification operations through the communication of classical bits. Bidirectional quantum teleportation (BQT) conceptual illustration Alice and Bob share a discrete-time quantum walk (DTQW) channel and exchange an unknown coherent-state qubit (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{\psi _A}\rangle }$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{\psi _B}\rangle }$$\end{document}) simultaneously. Entanglement between their local coin spaces is created by the walk evolution \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$W(1)\!\rightarrow \!W(4)$$\end{document}, allowing quantum information to move in both directions. Following local measurements, the teleported states are recovered by applying rectification operations through the communication of classical bits. First walk \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$W(1)$$\end{document} We start by building Alice and Bob’s shared initial quantum state, which includes their respective coin and position registers. The initial positions of Alice and Bob are represented by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{00}\rangle }_{A_p B_p}$$\end{document}, and their internal coin states are represented by coherent-state superpositions defined over the coin registers \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C_1, C_3$$\end{document} (Alice) and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C_4, B_3$$\end{document} (Bob). The even/odd coherent state basis is used to expand each coin state as follows:36\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {|{\Psi }\rangle }_{A_p B_p C_1 C_3 C_2 C_4} & = {|{00}\rangle }_{A_p B_p} \otimes \mathcal {N}_1 \left[ \left( \frac{\varepsilon _+ + \varepsilon _-}{\mathcal {N}^+} \right) {|{\phi ^+}\rangle } \right. \nonumber \\ & \quad \left. + \left( \frac{\varepsilon _+ - \varepsilon _-}{\mathcal {N}^-} \right) {|{\phi ^-}\rangle } \right] _{C_1,C_3} \otimes {|{0}\rangle }_{C_2} \nonumber \\ & \quad \otimes \mathcal {N}_2 \left[ \left( \frac{\tau _+ + \tau _-}{\mathcal {N}^+} \right) {|{\phi ^+}\rangle } + \left( \frac{\tau _+ - \tau _-}{\mathcal {N}^-} \right) {|{\phi ^-}\rangle } \right] _{C_4,B3} \otimes {|{0}\rangle }_{B2} \end{aligned}$$\end{document}We define the following coefficients, which stand for the amplitudes connected to Alice’s and Bob’s coherent basis decomposition, in order to reduce the expressions and get ready to apply the walk operator:\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \begin{array}{ c c } \eta _0 = \mathcal {N}_1 \left( \frac{\varepsilon _+ + \varepsilon _-}{\mathcal {N}^+} \right) & \eta _1 = \mathcal {N}_1 \left( \frac{\varepsilon _+ - \varepsilon _-}{\mathcal {N}^-} \right) \\ \beta _0 = \mathcal {N}_2 \left( \frac{\tau _+ + \tau _-}{\mathcal {N}^+} \right) & \beta _1 = \mathcal {N}_2 \left( \frac{\tau _+ - \tau _-}{\mathcal {N}^-} \right) \\ \end{array} \end{aligned}$$\end{document}These base states are then used to expand the whole system’s state:\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {|{\psi _0}\rangle }&= \eta _0 \beta _0\,{|{000000}\rangle } + \eta _0 \beta _1\,{|{000010}\rangle } \\ &\quad + \eta _1 \beta _0\,{|{001000}\rangle } + \eta _1 \beta _1\,{|{001010}\rangle } \end{aligned}$$\end{document}Next, we use the first quantum walk operator \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$W(1)$$\end{document}, which, depending on the state of the coin qubit \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A_2$$\end{document}, applies a controlled shift on Alice’s position register \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A_1$$\end{document}. The definition of the walk operator \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$E(1)$$\end{document} is as follows:\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$E(1) = (S \otimes \mathbb {I}) (\mathbb {I} \otimes {|{0}\rangle }{\langle {0}|}) + (S^\dagger \otimes \mathbb {I}) (\mathbb {I} \otimes {|{1}\rangle }{\langle {1}|})$$\end{document}If the coin qubit \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A_2$$\end{document} is in state \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{0}\rangle }$$\end{document}, the walker advances right via \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S$$\end{document}; if not, it walks left via \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S^\dagger$$\end{document}. Term 1: \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\eta _0 \beta _0\,{|{000000}\rangle }$$\end{document} Here, the coin qubit \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A_2 = {|{0}\rangle }$$\end{document}, so we apply the shift operator \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S$$\end{document}:\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(S \otimes \mathbb {I}) (\mathbb {I} \otimes {|{0}\rangle }{\langle {0}|}) {|{0}\rangle }_{A1} \otimes {|{0}\rangle }_{A2} = S{|{0}\rangle }_{A1} \otimes {|{0}\rangle }_{A2} = {|{1}\rangle }_{A1} {|{0}\rangle }_{A2}$$\end{document}All other qubits remain unchanged:\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$W(1)\,{|{000000}\rangle } = {|{100000}\rangle }$$\end{document}Term 2: \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\eta _0 \beta _1\,{|{000010}\rangle }$$\end{document} Again \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A_2 = {|{0}\rangle }$$\end{document}, so the same operation applies:\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$W(1)\,{|{000010}\rangle } = {|{100010}\rangle }$$\end{document}Term 3: \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\eta _1 \beta _0\,{|{001000}\rangle }$$\end{document} Now, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A_2 = {|{1}\rangle }$$\end{document}, so we use the reverse shift operator \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S^\dagger$$\end{document}:\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} (S^\dagger \otimes \mathbb {I})(\mathbb {I} \otimes {|{1}\rangle }{\langle {1}|}) {|{0}\rangle }_{A1} \otimes {|{1}\rangle }_{A2}&= S^\dagger {|{0}\rangle }_{A1} \otimes {|{1}\rangle }_{A2} \\&= {|{-1}\rangle }_{A1} \otimes {|{1}\rangle }_{A2} \end{aligned}$$\end{document}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$W(1)\,{|{001000}\rangle } = {|{-101000}\rangle }$$\end{document}Term 4: \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\eta _1 \beta _1\,{|{001010}\rangle }$$\end{document} As above, the coin is \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{1}\rangle }$$\end{document}, so:\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$W(1)\,{|{001010}\rangle } = {|{-101010}\rangle }$$\end{document}After applying \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$W(1)$$\end{document} to all contributing terms, the evolved quantum state is:37\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {|{\psi _1}\rangle }&= W(1)\,{|{\psi _0}\rangle } \nonumber \\&= \eta _0 \beta _0\,{|{100000}\rangle } + \eta _0 \beta _1\,{|{100010}\rangle } \nonumber \\&\quad + \eta _1 \beta _0\,{|{-101000}\rangle } + \eta _1 \beta _1\,{|{-101010}\rangle } \end{aligned}$$\end{document}The conditional movement of Alice’s walker, in which the shift direction is dependent upon her coin state, is reflected in this new state. The foundation for coherent quantum information propagation over the network is created by this constant entanglement between position and coin degrees of freedom, which is necessary for the behavior of quantum walks. Second walk \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$W(2)$$\end{document} After the first step, our state is:38\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \begin{aligned} {|{\psi _1}\rangle }&= \eta _0 \beta _0 {|{100000}\rangle } + \eta _0 \beta _1 {|{100010}\rangle } \\&\quad + \eta _1 \beta _0 {|{-101000}\rangle } + \eta _1 \beta _1 {|{-101010}\rangle }. \end{aligned} \end{aligned}$$\end{document}Only Bob’s position \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B_1$$\end{document} (second qubit), which is determined by his coin \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B_2$$\end{document} (fifth qubit), is modified by the next quantum walk step \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$W(2)$$\end{document}. That is:If Bob’s coin \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B_2 = {|{0}\rangle }$$\end{document}, his position \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B_1$$\end{document} is shifted one step to the right: \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S{|{x}\rangle } = {|{x+1}\rangle }$$\end{document}.If Bob’s coin \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B_2 = {|{1}\rangle }$$\end{document}, his position \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B_1$$\end{document} is shifted one step to the left: \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S^\dagger {|{x}\rangle } = {|{x-1}\rangle }$$\end{document}.We now apply \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$W(2)$$\end{document} to each term in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{\psi _1}\rangle }$$\end{document} :\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} W(2){|{\psi _1}\rangle }&= \eta _0 \beta _0\,S{|{1\,0\,0\,0\,0\,0}\rangle } + \eta _0 \beta _1\,S^\dagger {|{1\,0\,0\,0\,1\,0}\rangle } \\&\quad + \eta _1 \beta _0\,S{|{-1\,0\,1\,0\,0\,0}\rangle } + \eta _1 \beta _1\,S^\dagger {|{-1\,0\,1\,0\,1\,0}\rangle } \\&= \eta _0 \beta _0\,{|{1\,1\,0\,0\,0\,0}\rangle } + \eta _0 \beta _1\,{|{1\,{-1}\,0\,0\,1\,0}\rangle } \\&\quad + \eta _1 \beta _0\,{|{-1\,1\,1\,0\,0\,0}\rangle } + \eta _1 \beta _1\,{|{-1\,{-1}\,1\,0\,1\,0}\rangle } \end{aligned}$$\end{document}Putting everything together, we obtain the updated state:39\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \begin{aligned} {|{\psi _2}\rangle }&= \eta _0 \beta _0\, {|{1\,1\,0\,0\,0\,0}\rangle } + \eta _0 \beta _1\, {|{1\,{-1}\,0\,0\,1\,0}\rangle } \\&\quad + \eta _1 \beta _0\, {|{-1\,1\,1\,0\,0\,0}\rangle } + \eta _1 \beta _1\, {|{-1\,{-1}\,1\,0\,1\,0}\rangle }. \end{aligned} \end{aligned}$$\end{document}This completes the second step of the bidirectional quantum teleportation protocol using discrete-time quantum walks. If Bob’s coin \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B_2 = {|{0}\rangle }$$\end{document}, his position \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B_1$$\end{document} is shifted one step to the right: \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S{|{x}\rangle } = {|{x+1}\rangle }$$\end{document}. If Bob’s coin \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B_2 = {|{0}\rangle }$$\end{document}, his position \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B_1$$\end{document} is shifted one step to the right: \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S{|{x}\rangle } = {|{x+1}\rangle }$$\end{document}. If Bob’s coin \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B_2 = {|{1}\rangle }$$\end{document}, his position \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B_1$$\end{document} is shifted one step to the left: \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S^\dagger {|{x}\rangle } = {|{x-1}\rangle }$$\end{document}. If Bob’s coin \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B_2 = {|{1}\rangle }$$\end{document}, his position \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B_1$$\end{document} is shifted one step to the left: \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S^\dagger {|{x}\rangle } = {|{x-1}\rangle }$$\end{document}. Third walk W(3) The shift operator S is applied to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B_1$$\end{document} if the coin \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A_3$$\end{document} is in the state \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$|0\rangle$$\end{document} (shift right), and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S^\dagger$$\end{document} is applied if \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A_3$$\end{document} is in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$|1\rangle$$\end{document} (shift left). The third walk operator consists of two stages:Hadamard operation on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A_3$$\end{document}: \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$H_{A_3}$$\end{document}Conditional shift E(3) on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B_1$$\end{document} controlled by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A_3$$\end{document}This operator W(3) uses the coin state of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A_3$$\end{document} to regulate the motion of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B_1$$\end{document}, compared to the previous walk operators W(1) and W(2), which depended on the states of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A_2$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B_2$$\end{document}, respectively.40\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} W(3) = E(3)\left( I^{\otimes 3}\otimes H\otimes I^{\otimes 2}\right) \end{aligned}$$\end{document}where:41\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} E(3) = \left( I\otimes S\otimes I\otimes \vert {0} \rangle \langle {0} \vert {0}\otimes I^{\otimes 2}\right) + \left( I\otimes S^\dagger \otimes I\otimes \vert {1} \rangle \langle {1} \vert {1}\otimes I^{\otimes 2}\right) \end{aligned}$$\end{document}Initial state:42\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {|{\psi _2}\rangle } = \sum _{i,j\in \{0,1\}} \eta _i \beta _j {|{\psi _2^{ij}}\rangle } \end{aligned}$$\end{document}Hadamard stage43\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {|{\psi' _2}\rangle } = \frac{1}{\sqrt{2}}\sum _{i,j} \eta _i \beta _j \left({|{\psi _2^{ij}}\rangle }_{A_3=0} + {|{\psi _2^{ij}}\rangle }_{A_3=1}\right) \end{aligned}$$\end{document}Conditional Shift\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} E(3){|{\psi' _2}\rangle }= \frac{1}{\sqrt{2}}\sum _{i,j} \eta _i \beta _j \left[ \begin{aligned}S{\big|{\psi _2^{ij}}\big\rangle }_{A_3=0} \\+ S^\dagger {\big|{\psi _2^{ij}}\big\rangle }_{A_3=1} \end{aligned} \right] \\= \frac{1}{\sqrt{2}}\left[ \begin{aligned}\eta _0\beta _0 ({|{120000}\rangle } + {|{100100}\rangle }) \\\eta _0\beta _1 ({|{100010}\rangle } + {|{1{-}20110}\rangle }) \\\eta _1\beta _0 ({|{{-}121000}\rangle } + {|{{-}101100}\rangle }) \\\eta _1\beta _1 ({|{{-}101010}\rangle } + {|{{-}1{-}21110}\rangle }) \end{aligned} \right] \end{aligned}$$\end{document} Hadamard operation on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A_3$$\end{document}: \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$H_{A_3}$$\end{document} Hadamard operation on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A_3$$\end{document}: \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$H_{A_3}$$\end{document} Conditional shift E(3) on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B_1$$\end{document} controlled by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A_3$$\end{document} Conditional shift E(3) on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B_1$$\end{document} controlled by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A_3$$\end{document} Hadamard stage43\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {|{\psi' _2}\rangle } = \frac{1}{\sqrt{2}}\sum _{i,j} \eta _i \beta _j \left({|{\psi _2^{ij}}\rangle }_{A_3=0} + {|{\psi _2^{ij}}\rangle }_{A_3=1}\right) \end{aligned}$$\end{document} Hadamard stage43\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {|{\psi' _2}\rangle } = \frac{1}{\sqrt{2}}\sum _{i,j} \eta _i \beta _j \left({|{\psi _2^{ij}}\rangle }_{A_3=0} + {|{\psi _2^{ij}}\rangle }_{A_3=1}\right) \end{aligned}$$\end{document} Conditional Shift\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} E(3){|{\psi' _2}\rangle }= \frac{1}{\sqrt{2}}\sum _{i,j} \eta _i \beta _j \left[ \begin{aligned}S{\big|{\psi _2^{ij}}\big\rangle }_{A_3=0} \\+ S^\dagger {\big|{\psi _2^{ij}}\big\rangle }_{A_3=1} \end{aligned} \right] \\= \frac{1}{\sqrt{2}}\left[ \begin{aligned}\eta _0\beta _0 ({|{120000}\rangle } + {|{100100}\rangle }) \\\eta _0\beta _1 ({|{100010}\rangle } + {|{1{-}20110}\rangle }) \\\eta _1\beta _0 ({|{{-}121000}\rangle } + {|{{-}101100}\rangle }) \\\eta _1\beta _1 ({|{{-}101010}\rangle } + {|{{-}1{-}21110}\rangle }) \end{aligned} \right] \end{aligned}$$\end{document} Conditional Shift\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} E(3){|{\psi' _2}\rangle }= \frac{1}{\sqrt{2}}\sum _{i,j} \eta _i \beta _j \left[ \begin{aligned}S{\big|{\psi _2^{ij}}\big\rangle }_{A_3=0} \\+ S^\dagger {\big|{\psi _2^{ij}}\big\rangle }_{A_3=1} \end{aligned} \right] \\= \frac{1}{\sqrt{2}}\left[ \begin{aligned}\eta _0\beta _0 ({|{120000}\rangle } + {|{100100}\rangle }) \\\eta _0\beta _1 ({|{100010}\rangle } + {|{1{-}20110}\rangle }) \\\eta _1\beta _0 ({|{{-}121000}\rangle } + {|{{-}101100}\rangle }) \\\eta _1\beta _1 ({|{{-}101010}\rangle } + {|{{-}1{-}21110}\rangle }) \end{aligned} \right] \end{aligned}$$\end{document} Fourth walk W(4) Same as W(3), The W(4) and E(4) acts on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A_1$$\end{document}’s position conditioned on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B_3$$\end{document}: The fourth walk consists of: Hadamard operation on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B_3$$\end{document}: \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$H_{B_3}$$\end{document}Conditional shift E(4) on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A_1$$\end{document} controlled by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B_3$$\end{document}Since \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B_3 = |0\rangle$$\end{document} in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$|\psi _3\rangle$$\end{document}, applying \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$E_4$$\end{document} alone would only shift \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A_1$$\end{document} rightward, but \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$|\psi _4\rangle$$\end{document} shows \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B_3$$\end{document} in superposition. Thus, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$W_4$$\end{document} includes a Hadamard on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B_3$$\end{document} before the shift, consistent with quantum walk steps:44\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} W(4) = E(4)(I^{\otimes 5}\otimes H) \end{aligned}$$\end{document}where:45\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} E(4) = \big ( S \otimes I^{\otimes 4} \otimes {|{0}\rangle }\!{\langle {0}|} \big ) + \big ( S^{\dagger } \otimes I^{\otimes 4} \otimes {|{1}\rangle }\!{\langle {1}|} \big ) \end{aligned}$$\end{document}Finally, after applying W(4), we obtain the final state:Hadamard stage46\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {|{\psi' _3}\rangle } = \frac{1}{\sqrt{2}}\sum _{i,j} \eta _i \beta _j \left( {|{\psi _3^{ij}}\rangle }_{B_3=0} + {|{\psi _3^{ij}}\rangle }_{B_3=1}\right) \end{aligned}$$\end{document}Conditional shift\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} |\psi _4\rangle = {\frac{1}{2}} \big (&\eta _0 \beta _0\, {|{2\,2\,0\,0\,0\,0}\rangle } + \eta _0 \beta _0\, {|{0\,2\,0\,0\,0\,1}\rangle }\notag \\&+ \eta _0 \beta _0\, {|{2\,0\,0\,1\,0\,0}\rangle } + \eta _0 \beta _0\, {|{0\,0\,0\,1\,0\,1}\rangle }\notag \\&+ \eta _0 \beta _1\, {|{2\,0\,0\,0\,1\,0}\rangle } + \eta _0 \beta _1\, {|{0\,0\,0\,0\,1\,1}\rangle } \notag\\&+ \eta _0 \beta _1\, {|{2\,{-2}\,0\,1\,1\,0}\rangle } + \eta _0 \beta _1\, {|{0\,{-2}\,0\,1\,1\,1}\rangle } \notag\\&+ \eta _1 \beta _0\, {|{0\,2\,1\,0\,0\,0}\rangle } + \eta _1 \beta _0\, {|{-2\,2\,1\,0\,0\,1}\rangle } \notag\\&+ \eta _1 \beta _0\, {|{0\,0\,1\,1\,0\,0}\rangle } + \eta _1 \beta _0\, {|{-2\,0\,1\,1\,0\,1}\rangle } \notag\\&+ \eta _1 \beta _1\, {|{0\,0\,1\,0\,1\,0}\rangle } + \eta _1 \beta _1\, {|{-2\,0\,1\,0\,1\,1}\rangle }\notag \notag\\&+ \eta _1 \beta _1\, {|{0\,{-2}\,1\,1\,1\,0}\rangle } + \eta _1 \beta _1\, {|{-2\,{-2}\,1\,1\,1\,1}\rangle } \big ) \end{aligned}$$\end{document} Hadamard operation on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B_3$$\end{document}: \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$H_{B_3}$$\end{document} Hadamard operation on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B_3$$\end{document}: \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$H_{B_3}$$\end{document} Conditional shift E(4) on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A_1$$\end{document} controlled by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B_3$$\end{document} Conditional shift E(4) on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A_1$$\end{document} controlled by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B_3$$\end{document} Hadamard stage46\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {|{\psi' _3}\rangle } = \frac{1}{\sqrt{2}}\sum _{i,j} \eta _i \beta _j \left( {|{\psi _3^{ij}}\rangle }_{B_3=0} + {|{\psi _3^{ij}}\rangle }_{B_3=1}\right) \end{aligned}$$\end{document} Hadamard stage46\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {|{\psi' _3}\rangle } = \frac{1}{\sqrt{2}}\sum _{i,j} \eta _i \beta _j \left( {|{\psi _3^{ij}}\rangle }_{B_3=0} + {|{\psi _3^{ij}}\rangle }_{B_3=1}\right) \end{aligned}$$\end{document} Conditional shift\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} |\psi _4\rangle = {\frac{1}{2}} \big (&\eta _0 \beta _0\, {|{2\,2\,0\,0\,0\,0}\rangle } + \eta _0 \beta _0\, {|{0\,2\,0\,0\,0\,1}\rangle }\notag \\&+ \eta _0 \beta _0\, {|{2\,0\,0\,1\,0\,0}\rangle } + \eta _0 \beta _0\, {|{0\,0\,0\,1\,0\,1}\rangle }\notag \\&+ \eta _0 \beta _1\, {|{2\,0\,0\,0\,1\,0}\rangle } + \eta _0 \beta _1\, {|{0\,0\,0\,0\,1\,1}\rangle } \notag\\&+ \eta _0 \beta _1\, {|{2\,{-2}\,0\,1\,1\,0}\rangle } + \eta _0 \beta _1\, {|{0\,{-2}\,0\,1\,1\,1}\rangle } \notag\\&+ \eta _1 \beta _0\, {|{0\,2\,1\,0\,0\,0}\rangle } + \eta _1 \beta _0\, {|{-2\,2\,1\,0\,0\,1}\rangle } \notag\\&+ \eta _1 \beta _0\, {|{0\,0\,1\,1\,0\,0}\rangle } + \eta _1 \beta _0\, {|{-2\,0\,1\,1\,0\,1}\rangle } \notag\\&+ \eta _1 \beta _1\, {|{0\,0\,1\,0\,1\,0}\rangle } + \eta _1 \beta _1\, {|{-2\,0\,1\,0\,1\,1}\rangle }\notag \notag\\&+ \eta _1 \beta _1\, {|{0\,{-2}\,1\,1\,1\,0}\rangle } + \eta _1 \beta _1\, {|{-2\,{-2}\,1\,1\,1\,1}\rangle } \big ) \end{aligned}$$\end{document} Conditional shift\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} |\psi _4\rangle = {\frac{1}{2}} \big (&\eta _0 \beta _0\, {|{2\,2\,0\,0\,0\,0}\rangle } + \eta _0 \beta _0\, {|{0\,2\,0\,0\,0\,1}\rangle }\notag \\&+ \eta _0 \beta _0\, {|{2\,0\,0\,1\,0\,0}\rangle } + \eta _0 \beta _0\, {|{0\,0\,0\,1\,0\,1}\rangle }\notag \\&+ \eta _0 \beta _1\, {|{2\,0\,0\,0\,1\,0}\rangle } + \eta _0 \beta _1\, {|{0\,0\,0\,0\,1\,1}\rangle } \notag\\&+ \eta _0 \beta _1\, {|{2\,{-2}\,0\,1\,1\,0}\rangle } + \eta _0 \beta _1\, {|{0\,{-2}\,0\,1\,1\,1}\rangle } \notag\\&+ \eta _1 \beta _0\, {|{0\,2\,1\,0\,0\,0}\rangle } + \eta _1 \beta _0\, {|{-2\,2\,1\,0\,0\,1}\rangle } \notag\\&+ \eta _1 \beta _0\, {|{0\,0\,1\,1\,0\,0}\rangle } + \eta _1 \beta _0\, {|{-2\,0\,1\,1\,0\,1}\rangle } \notag\\&+ \eta _1 \beta _1\, {|{0\,0\,1\,0\,1\,0}\rangle } + \eta _1 \beta _1\, {|{-2\,0\,1\,0\,1\,1}\rangle }\notag \notag\\&+ \eta _1 \beta _1\, {|{0\,{-2}\,1\,1\,1\,0}\rangle } + \eta _1 \beta _1\, {|{-2\,{-2}\,1\,1\,1\,1}\rangle } \big ) \end{aligned}$$\end{document} Recovery unitaries and explicit controlled-Pauli form Let the measurement outcomes be \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$b_0, b_1, b_2, b_3 \in \{0,1\}$$\end{document}. Then immediately after measurement, the two teleported output states are:47\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} |\psi _B\rangle&= Z^{\,b_0} X^{\,b_2} {|{\phi _1}\rangle }, \end{aligned}$$\end{document}48\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} |\psi _A\rangle&= Z^{\,b_1} X^{\,b_3} {|{\phi _2}\rangle }. \end{aligned}$$\end{document}To recover the original states, we apply the inverse Pauli operations:49\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} U_{B_3}&= X^{\,b_2} Z^{\,b_0},&U_{A_3}&= X^{\,b_3} Z^{\,b_1}. \end{aligned}$$\end{document}Since Pauli operators square to the identity, each recovery exactly cancels the measurement-induced Pauli:50\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} U_{B_3} |\psi _B\rangle&= X^{b_2} Z^{b_0} \big (Z^{b_0} X^{b_2} {|{\phi _1}\rangle } \big ) \end{aligned}$$\end{document}51\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned}&= (X^{b_2} X^{b_2})(Z^{b_0} Z^{b_0}) {|{\phi _1}\rangle } \end{aligned}$$\end{document}52\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned}&= {|{\phi _1}\rangle }, \end{aligned}$$\end{document}53\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} U_{A_3} |\psi _A\rangle&= X^{b_3} Z^{b_1} \big (Z^{b_1} X^{b_3} {|{\phi _2}\rangle } \big ) \end{aligned}$$\end{document}54\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned}&= {|{\phi _2}\rangle }. \end{aligned}$$\end{document}In Qiskit, the recovery operations can be implemented using classically controlled Pauli gates:55\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} U_{B}:&\quad \underbrace{Z(q_5)\big |_{c_0=1}}_{Z^{b_0}} \;\; \underbrace{X(q_5)\big |_{c_2=1}}_{X^{b_2}}, \end{aligned}$$\end{document}56\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} U_{A}:&\quad \underbrace{Z(q_4)\big |_{c_1=1}}_{Z^{b_1}} \;\; \underbrace{X(q_4)\big |_{c_3=1}}_{X^{b_3}}. \end{aligned}$$\end{document}Each controlled-Pauli gate undoes the measurement-induced error:\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} |\psi _B\rangle&= Z^{b_0} X^{b_2} {|{\phi _1}\rangle }, \\ U_B |\psi _B\rangle&= \left( X^{b_2} Z^{b_0}\right) \left( Z^{b_0} X^{b_2}\right) {|{\phi _1}\rangle } = {|{\phi _1}\rangle },\\ |\psi _A\rangle&= Z^{b_1} X^{b_3} {|{\phi _2}\rangle }, \\ U_A |\psi _A\rangle&= \left( X^{b_3} Z^{b_1}\right) \left( Z^{b_1} X^{b_3}\right) {|{\phi _2}\rangle } = {|{\phi _2}\rangle }. \end{aligned}$$\end{document}Comparison with existing BQT schemes: Previous bidirectional teleportation (BQT) protocols mainly rely on multi-qubit entangled resources such as Bell, GHZ, or cluster states. For instance, Sisodia et al. proposed an optimized BQT protocol based on Bell-type and cluster-type channels for simultaneous information exchange between two users41. In large-scale networks, Zhang et al. introduced a deterministic multi-hop BQT model using combined GHZ and Bell resources to improve routing performance42. Pandey et al.43 developed a controlled bidirectional teleportation protocol employing phase-opposite coherent states as information carriers, while Yuan et al.44 demonstrated bidirectional operation teleportation using two four-qubit cluster states. Compared with these approaches, the present BQT–DTQW protocol integrates coherent-state encoding within a discrete-time quantum walk framework, allowing simultaneous two-way teleportation through a single coherent-state resource and unified walk evolution. This design reduces classical-communication overhead and enhances scalability and robustness against photon-loss noise, as confirmed by the analytical fidelity and SeQUeNCe-based simulations. Generalization of bidirectional quantum walk teleportation protocol to multiple nodes The previously described bidirectional quantum teleportation protocol can be generalized efficiently to a multi-node quantum network consisting of up to 200 nodes. This generalization extends the discrete-time quantum walk (DTQW) operators to a linear or graph-based quantum network, allowing bidirectional quantum teleportation across long-distance entangled channels45. Role of DTQWs in the multi-node extension Before extending the analysis to multiple nodes, it is important to recall that in our protocol the discrete-time quantum walk (DTQW) evolution is not used as a random process but as a controlled and deterministic mechanism that generates entanglement between remote parties. In the two-node case (Alice and Bob), this entanglement arises from the cross controlled walk operators W(3) and W(4), which couple the position and coin spaces of both users. In the multi-node network considered here, the same DTQW principle governs the propagation of quantum correlations through intermediate nodes, allowing the simultaneous bidirectional teleportation to extend naturally to larger topologies. Network topology We define the quantum network as a linear chain of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$N$$\end{document} nodes. Each node \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$i$$\end{document}, where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$i = 1, \dots , N$$\end{document}, consists of:a position Hilbert space \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {H}_{P_i}$$\end{document},and a coin Hilbert space \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {H}_{C_i}$$\end{document},where each coin space \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {H}_{C_i}$$\end{document} is spanned by the orthonormal basis \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{{|{0}\rangle }, {|{1}\rangle }\}$$\end{document}. The total Hilbert space of the system is:57\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \mathcal {H}_{\text {total}} = \bigotimes _{i=1}^{N} \left( \mathcal {H}_{P_i} \otimes \mathcal {H}_{C_i} \right) \end{aligned}$$\end{document}Therefore, in the schematic representation (the ”multi-node figure” referred to by the reviewer), the network should be understood as:\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\text {Alice} \longleftrightarrow \underbrace{\text {Node}_2 \longleftrightarrow \cdots \longleftrightarrow \text {Node}_{N-1}}_{\text {intermediate (mediator) nodes}} \longleftrightarrow \text {Bob},$$\end{document}where the bidirectional quantum walk dynamically distributes and transfers the entangled states along these paths. This clarifies that the two edge nodes are indeed Alice and Bob, and the remaining nodes act as the mediating quantum relays in the network. The two edge nodes (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$i=1$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$i=N$$\end{document}) correspond respectively to Alice and Bob, who act as the communicating users exchanging quantum states. The remaining intermediate nodes (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2 \le i \le N{-}1$$\end{document}) function as mediator (relay) nodes that perform entanglement swapping, temporary quantum storage, and discrete-time quantum walk propagation of the coherent-state–encoded qubits. This configuration realizes bidirectional multi-hop teleportation within a single composite quantum walk evolution. In this way, the two edge nodes (Alice and Bob) exchange their quantum states, while the intermediate nodes act as dynamic quantum relays, ensuring multi-hop, high-fidelity teleportation across the network. a position Hilbert space \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {H}_{P_i}$$\end{document}, a position Hilbert space \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {H}_{P_i}$$\end{document}, and a coin Hilbert space \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {H}_{C_i}$$\end{document}, and a coin Hilbert space \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {H}_{C_i}$$\end{document}, Generalized quantum walk operators We define a generalized conditional shift operator \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$E_{i,i+1}$$\end{document} acting between adjacent nodes \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$i$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$i+1$$\end{document}, controlled by the coin state of node \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$i$$\end{document}:58\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} E_{i,i+1} = \left( S_i \otimes \mathbb {I}_{P_{i+1}}\right) \otimes {|{0}\rangle }{\langle {0}|}_{C_i} + \left( S_i^\dagger \otimes \mathbb {I}_{P_{i+1}}\right) \otimes {|{1}\rangle }{\langle {1}|}_{C_i} \end{aligned}$$\end{document}where the forward and backward shift operators \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_i, S_i^\dagger$$\end{document} act on the position space \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {H}_{P_i}$$\end{document}:59\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} S_i = \sum _{\eta \in \mathbb {Z}} {|{\eta +1}\rangle }{\langle {\eta }|}, \quad S_i^\dagger = \sum _{\eta \in \mathbb {Z}} {|{\eta -1}\rangle }{\langle {\eta }|} \end{aligned}$$\end{document}Each walk step includes a coin operation followed by a conditional shift. The local coin operator \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C_i$$\end{document} may be the Hadamard gate:60\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} C_i = H = \frac{1}{\sqrt{2}} \begin{bmatrix} 1 & \quad 1 \\ 1 & \quad -1 \end{bmatrix} \end{aligned}$$\end{document}The walk operator at step \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$i$$\end{document} is defined as:61\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} W_i&= \mathbb {I}_{1} \otimes \cdots \otimes \mathbb {I}_{i-1} \otimes \left( E_{i,i+1} \cdot (\mathbb {I}_{P_i} \otimes C_i)\right) \nonumber \\&\quad \otimes \mathbb {I}_{i+2} \otimes \cdots \otimes \mathbb {I}_{N} \end{aligned}$$\end{document} Protocol implementation across multiple nodes To implement bidirectional teleportation over the network, we perform the following steps: Initialization Place Alice’s unknown state \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{\phi _1}\rangle }$$\end{document} at node 1 and Bob’s unknown state \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{\phi _2}\rangle }$$\end{document} at node \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$N$$\end{document}, encoded in the respective coin spaces \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C_1$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C_N$$\end{document}.Quantum Walk Evolution: Apply a sequence of generalized quantum walk operators \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{W_i\}_{i=1}^{N-1}$$\end{document} iteratively to propagate both Alice’s and Bob’s states toward each other through the network.Measurement After a sufficient number of steps (e.g., \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lfloor N/2 \rfloor$$\end{document}), perform projective measurements on the coin and/or position degrees of freedom at intermediary nodes in the computational basis. The measurement outcomes \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{b_k\}$$\end{document} are shared with Alice and Bob via classical channels.Recovery operations Upon receiving the measurement outcomes, Alice and Bob apply local recovery unitaries: 62\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} U_B = X^{b_k} Z^{b_\ell }, \qquad U_A = X^{b_m} Z^{b_n} \end{aligned}$$\end{document} which precisely invert the teleportation-induced Pauli errors and recover \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{\phi _1}\rangle }$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{\phi _2}\rangle }$$\end{document}. Initialization Place Alice’s unknown state \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{\phi _1}\rangle }$$\end{document} at node 1 and Bob’s unknown state \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{\phi _2}\rangle }$$\end{document} at node \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$N$$\end{document}, encoded in the respective coin spaces \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C_1$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C_N$$\end{document}. Initialization Place Alice’s unknown state \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{\phi _1}\rangle }$$\end{document} at node 1 and Bob’s unknown state \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{\phi _2}\rangle }$$\end{document} at node \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$N$$\end{document}, encoded in the respective coin spaces \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C_1$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C_N$$\end{document}. Quantum Walk Evolution: Apply a sequence of generalized quantum walk operators \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{W_i\}_{i=1}^{N-1}$$\end{document} iteratively to propagate both Alice’s and Bob’s states toward each other through the network. Quantum Walk Evolution: Apply a sequence of generalized quantum walk operators \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{W_i\}_{i=1}^{N-1}$$\end{document} iteratively to propagate both Alice’s and Bob’s states toward each other through the network. Measurement After a sufficient number of steps (e.g., \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lfloor N/2 \rfloor$$\end{document}), perform projective measurements on the coin and/or position degrees of freedom at intermediary nodes in the computational basis. The measurement outcomes \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{b_k\}$$\end{document} are shared with Alice and Bob via classical channels. Measurement After a sufficient number of steps (e.g., \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lfloor N/2 \rfloor$$\end{document}), perform projective measurements on the coin and/or position degrees of freedom at intermediary nodes in the computational basis. The measurement outcomes \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{b_k\}$$\end{document} are shared with Alice and Bob via classical channels. Recovery operations Upon receiving the measurement outcomes, Alice and Bob apply local recovery unitaries: 62\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} U_B = X^{b_k} Z^{b_\ell }, \qquad U_A = X^{b_m} Z^{b_n} \end{aligned}$$\end{document} which precisely invert the teleportation-induced Pauli errors and recover \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{\phi _1}\rangle }$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{\phi _2}\rangle }$$\end{document}. Recovery operations Upon receiving the measurement outcomes, Alice and Bob apply local recovery unitaries: 62\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} U_B = X^{b_k} Z^{b_\ell }, \qquad U_A = X^{b_m} Z^{b_n} \end{aligned}$$\end{document} which precisely invert the teleportation-induced Pauli errors and recover \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{\phi _1}\rangle }$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{\phi _2}\rangle }$$\end{document}. Simulation and optimization Simulations using quantum circuit frameworks (such as Qiskit) and quantum network simulators46 (such as SeQUeNCe) validate the fidelity and performance of the generalized protocol. Quantum optimization techniques, including quantum ant colony optimization47 and quantum walks, can further enhance the protocol efficiency by optimizing node traversal paths, minimizing decoherence effects, and maximizing teleportation fidelity. This generalized framework establishes the foundation for scalable quantum communication networks capable of handling complex, multi-node quantum information distribution tasks. Fidelity of the bidirectional quantum teleportation To quantify the accuracy of quantum state transfer, we compute the fidelity of bidirectional quantum teleportation involving coherent states. We represent the input and output states using Bloch vectors and derive analytical formulas for the teleportation fidelities in both directions: from Alice to Bob and from Bob to Alice. For a pure input state \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{\phi _{\text {in}}}\rangle }$$\end{document} and output density matrix \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\rho _{\text {out}}$$\end{document}, the fidelity simplifies to:63\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} F = \langle \phi _{\text {in}} | \rho _{\text {out}} | \phi _{\text {in}} \rangle . \end{aligned}$$\end{document}More generally, for two arbitrary density matrices \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\rho _{\text {in}}$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\rho _{\text {out}}$$\end{document}, the Uhlmann fidelity is:64\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} F = \left[ \text {Tr} \left( \sqrt{ \sqrt{\rho _{\text {in}}} \, \rho _{\text {out}} \, \sqrt{\rho _{\text {in}}} } \right) \right] ^2. \end{aligned}$$\end{document}We measure the fidelity between the intended input state and the received output state at each end of the network to determine the accuracy of our BQT protocol. The Uhlmann expression provides the fidelity \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$F_{A \rightarrow B}$$\end{document} for quantum states \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\rho _{\text {Alice}}$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\rho ^{(A)}_{\text {out}}$$\end{document}, which represent Alice’s initial input and Bob’s received state, respectively:65\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} F_{A \rightarrow B} = \left[ \text {Tr} \left( \sqrt{ \sqrt{\rho _{\text {Alice}}} \, \rho ^{(A)}_{\text {out}} \, \sqrt{\rho _{\text {Alice}}} } \right) \right] ^2. \end{aligned}$$\end{document}Similarly, the fidelity of reverse teleportation from Bob to Alice is described as follows:66\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} F_{B \rightarrow A} = \left[ \text {Tr} \left( \sqrt{ \sqrt{\rho _{\text {Bob}}} \, \rho ^{(B)}_{\text {out}} \, \sqrt{\rho _{\text {Bob}}} } \right) \right] ^2. \end{aligned}$$\end{document}The even/odd coherent state basis in our model represents the input states. The input state of Alice is represented as:67\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {|{\phi _A}\rangle } = \mathcal {N}_1 \left[ \left( \frac{\varepsilon _+ + \varepsilon _-}{\mathcal {N}^+} \right) {|{\phi ^+}\rangle } + \left( \frac{\varepsilon _+ - \varepsilon _-}{\mathcal {N}^-} \right) {|{\phi ^-}\rangle } \right] , \end{aligned}$$\end{document}With the compact representation of the coefficients as:68\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} c_+^A := \mathcal {N}_1 \cdot \frac{\varepsilon _+ + \varepsilon _-}{\mathcal {N}^+}, \qquad c_-^A := \mathcal {N}_1 \cdot \frac{\varepsilon _+ - \varepsilon _-}{\mathcal {N}^-}. \end{aligned}$$\end{document}Therefore, the input density matrix is obtained:69\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \rho _{\text {Alice}} = \begin{pmatrix} |c_+^A|^2 & c_+^A (c_-^A)^* \\ c_-^A (c_+^A)^* & |c_-^A|^2 \end{pmatrix}. \end{aligned}$$\end{document}Similarly, Bob’s input state is parametrized using \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau _+ = \cos \theta _b$$\end{document}, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau _- = \sin \theta _b e^{i\varphi }$$\end{document}, and coefficients70\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} c_+^B := \mathcal {N}_2 \cdot \frac{\tau _+ + \tau _-}{\mathcal {N}^+}, \qquad c_-^B := \mathcal {N}_2 \cdot \frac{\tau _+ - \tau _-}{\mathcal {N}^-}. \end{aligned}$$\end{document}Following teleportation, the Bloch vector representations of the output states \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\rho _{\text {out}}^{(A)}$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\rho _{\text {out}}^{(B)}$$\end{document} are described. In other words, every state looks like this:71\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \rho _{\text {out}}^{(A)}&= \frac{1}{2} \left( \mathbb {I} + \vec {r} \cdot \vec {\sigma } \right) , \end{aligned}$$\end{document}72\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \rho _{\text {out}}^{(B)}&= \frac{1}{2} \left( \mathbb {I} + \vec {k} \cdot \vec {\sigma } \right) , \end{aligned}$$\end{document}where the Bloch vectors of the teleported states are \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\vec {r}$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\vec {k}$$\end{document}. Based on Alice’s input parameters \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(\theta _a, \varphi )$$\end{document}, the components of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\vec {r}$$\end{document} are determined as follows:73\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} r_x&= \frac{\mathcal {N}_1^2}{\mathcal {N}^+ \mathcal {N}^-} \left[ \cos ^2\theta _a - \sin ^2\theta _a \cos (2\varphi ) \right] , \end{aligned}$$\end{document}74\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} r_y&= \frac{\mathcal {N}_1^2}{\mathcal {N}^+ \mathcal {N}^-} \left[ -\sin ^2\theta _a \sin (2\varphi ) + \cos \theta _a \sin \theta _a \sin \varphi \right] , \end{aligned}$$\end{document}75\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} r_z&= \mathcal {N}_1^2 \left[ \frac{1 + 2 \cos \theta _a \sin \theta _a \cos \varphi }{(\mathcal {N}^+)^2} - \frac{1 - 2 \cos \theta _a \sin \theta _a \cos \varphi }{(\mathcal {N}^-)^2} \right] . \end{aligned}$$\end{document}Similarly we calculate the output Bloch components for Bob’s state:76\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} k_x&= \frac{\mathcal {N}_2^2}{\mathcal {N}^+ \mathcal {N}^-} \left[ \cos ^2\theta _b - \sin ^2\theta _b \cos (2\varphi ) \right] , \end{aligned}$$\end{document}77\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} k_y&= \frac{\mathcal {N}_2^2}{\mathcal {N}^+ \mathcal {N}^-} \left[ -\sin ^2\theta _b \sin (2\varphi ) + \cos \theta _b \sin \theta _b \sin \varphi \right] , \end{aligned}$$\end{document}78\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} k_z&= \mathcal {N}_2^2 \left[ \frac{1 + 2 \cos \theta _b \sin \theta _b \cos \varphi }{(\mathcal {N}^+)^2} - \frac{1 - 2 \cos \theta _b \sin \theta _b \cos \varphi }{(\mathcal {N}^-)^2} \right] \end{aligned}$$\end{document}Finally, the explicit matrix form is used by the output density matrices:79\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \rho _{\text {out}}^{(A)} = \frac{1}{2} \begin{pmatrix} 1 + r_z & r_x - i r_y \\ r_x + i r_y & 1 - r_z \end{pmatrix}, \qquad \end{aligned}$$\end{document}80\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \rho _{\text {out}}^{(B)} = \frac{1}{2} \begin{pmatrix} 1 + k_z & k_x - i k_y \\ k_x + i k_y & 1 - k_z \end{pmatrix}. \end{aligned}$$\end{document}We calculate the fidelity between the transmitted output state and the original input state for both communication routes to measure the performance of our non-orthogonal coherent state-based bidirectional quantum teleportation system. One important parameter for assessing how well the quantum information is maintained during transmission is the fidelity. In particular, we compare the corresponding output density matrices \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\rho _{\text {out}}^{(A)}$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\rho _{\text {out}}^{(B)}$$\end{document} with the ideal input states \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\rho _{\text {Alice}}$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\rho _{\text {Bob}}$$\end{document}, expressed in the orthonormal basis of both odd and even Schrödinger cat states, to assess the fidelity from Alice to Bob (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$F_{A \rightarrow B}$$\end{document}) and from Bob to Alice (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$F_{B \rightarrow A}$$\end{document}). While the present section focuses on coherent-state-encoded bidirectional teleportation, it is instructive to contrast its robustness with traditional qubit-based schemes under equivalent noise models. The resilience of coherent states arises from their over-completeness and Gaussian structure, which mitigate amplitude-damping and photon-loss effects. Our analytical fidelity expressions already capture this robustness through the overlap factor \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$e^{-2|\alpha |^{2}}$$\end{document} and the normalization constants \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(N_{+},N_{-})$$\end{document}. For identical transmissivity \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\eta$$\end{document} and decoherence rate \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma$$\end{document}, numerical evaluations indicate that the coherent-state-encoded BQT maintains a higher average fidelity when \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha \gtrsim 1$$\end{document}, corresponding to the regime of reduced non-orthogonality. Preliminary comparative simulations performed within the SeQUeNCe framework confirm a fidelity improvement of approximately \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Delta F \approx 0.05{-}0.1$$\end{document} in moderate-loss channels (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\eta > 0.7$$\end{document}). These findings motivate a more comprehensive comparison between coherent- and qubit-based encodings, which will be reported in future extensions of this work. Performance analysis Simulation setting We used SeQUeNCe21, a discrete-event quantum network simulator, to model and evaluate the performance of UQT and BQT. We randomly deploy 200 nodes within a rectangular area of 200 km \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\times$$\end{document} 400 km and randomly assign 8 source–destination pairs (SD) of users in the network. To construct the network topology, we employ the Waxman model48, where an edge between nodes u and v is created with probability \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\delta e^{-l(u,v)/\varepsilon L}$$\end{document}, where, l(u, v) is the euclidean distance between nodes u and v, L is the maximum distance between any two nodes, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\delta = 0.90$$\end{document} controls the base edge probability, and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon = 0.01$$\end{document} determines the sensitivity to distance. Each node is equipped with a 20 unit of quantum memory that features a coherence time of 0.3 s, an efficiency of 0.80, a raw memory fidelity of 0.95, and a memory excitation frequency of 2 \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\times$$\end{document} \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$10^3$$\end{document}. The nodes are interconnected via optical fiber links with an attenuation coefficient of 0.2 dB/km, and the classical communication channel introduces a delay of 100 ms. The entanglement generation rate between connected nodes is modeled probabilistically, influenced by quantum channel attenuation, which is set to 0.0002, and a channel frequency of 100 GHz. The quantum link capacity varied from 5 to 20. To accurately model photon detection, we include realistic detector parameters, efficiency of 0.80, detector count rate is configured as 5 \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\times$$\end{document} \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$10^7$$\end{document} counts per second, and time resolution of 100 picoseconds to ensure precise entanglement confirmation and synchronization. The link-level entanglement generation rate is set at 10 attempts per second per link, and all nodes are time-synchronized. Entanglement swapping is performed at intermediate nodes along paths with hop counts ranging from 2 to 10. The fidelity degradation introduced by each swapping operation is modeled using a degradation factor of 0.99. All experiments are carried out on a workstation with a Ryzen 7 3700X 3.6GHz CPU, 32GB RAM, and OS Windows 10 64 bits. Performance metrics: We evaluate the performance of the UQT and BQT approaches using three key metrics: throughput, end-to-end fidelity, and quantum memory utilization. All results are presented in a normalized manner to ensure fair and consistent benchmarking. Throughput (qubits/slots) is the expected number of successfully established end-to-end entangled connections, reflecting the protocol’s routing efficiency. End-to-end fidelity measures the quality of the entangled states across the entire path. For resource evaluation, quantum memory utilization is defined as the ratio of consumed entangled pairs to the total available entangled pairs in the network. A lower utilization ratio indicates a more efficient use of memory resources, particularly relevant in UQT. Results analysis Network performance analysis Figure 5a shows that UQT achieves higher throughput than BQT in a quantum network, mainly because it uses fewer resources and is easier to manage. In UQT, entangled qubits are needed only in one direction, which means fewer entangled pairs are consumed and less quantum memory is used. This allows the network to support more teleportation operations at the same time. In contrast, BQT requires entanglement in both directions between two nodes. This doubles the resource requirement and increases the need for synchronized communication, making the process more complex and slower. It also puts more pressure on quantum memory at both ends, which can lead to delays or failed operations if memory is limited.Fig. 5Performance evaluation based on network nodes. Each point shows the average over several random Waxman networks. Solid lines are used only to guide the eye and do not imply linear scaling. Performance evaluation based on network nodes. Each point shows the average over several random Waxman networks. Solid lines are used only to guide the eye and do not imply linear scaling. In Fig. 5b, in small quantum network sizes, UQT usually has higher fidelity than BQT. This is because UQT only sends qubits in one direction, using fewer entangled pairs and involving fewer steps. As a result, there are fewer chances for errors such as noise, memory decay, or gate imperfections. The simpler process helps preserve the quality (fidelity) of the teleported qubits. However, as the size of the network increases, both UQT and BQT need to go through more intermediate nodes and perform more entanglement swaps. Each additional step introduces more noise and errors that reduce the fidelity. In large networks, the overall fidelity depends more on the number of hops and the quality of the links than on the direction of teleportation. Because of this, the performance difference between UQT and BQT becomes smaller, and both methods end up with similar fidelity. In Fig. 5c, UQT uses less quantum memory compared to BQT because the communication happens in only one direction. In UQT, only one qubit needs to be teleported from a sender to a receiver. This means that the sender has the qubit to be teleported, and the network only needs to generate and store a single entangled pair for that direction. As a result, fewer quantum memories are used throughout the network. On the other hand, in BQT, both nodes are trying to teleport qubits to each other at the same time. This means that both ends must store their own qubits, and the network needs two separate entangled pairs, one for each direction. Intermediate nodes also need extra memory to support both directions at once. Because of this, more quantum memories are occupied during the process, and qubits may need to be stored longer while waiting for the other side, increasing memory usage. Network channel capacity analysis Figure 6a shows that channel capacity increases as both UQT and BQT show increasing throughput. This is because, in UQT, only one entangled pair is needed per teleportation. When channel capacity increases, more pairs can be generated faster, allowing more qubits to be teleported in a shorter time. This boosts throughput efficiently. In BQT, two entangled pairs are needed (one for each direction). Although throughput also increases with better channel capacity, the gain is slightly slower compared to UQT because BQT consumes twice as many resources. Still, better channel conditions enable more simultaneous bidirectional teleportation operations.Fig. 6Performance evaluation based on channel capacity. Performance evaluation based on channel capacity. Figure 6b shows that when the channel capacity is high, the network can create and distribute more high-quality entangled pairs, which helps improve fidelity. In UQT, qubits are sent in only one direction. It requires just one entangled pair for each teleportation. It fully benefits from the improved channel quality. It also finishes faster and uses less memory, reducing the chances of errors caused by waiting too long or holding qubits in memory. On the other hand, BQT sends qubits in both directions simultaneously, so it needs twice as many entangled pairs. Even if the channel capacity increases, BQT puts more load on the network. It also requires more coordination and memory at both ends, increasing the errors. As a result, its fidelity doesn’t improve as much as UQT. Figure 6c illustrates how increasing channel capacity affects memory usage differently in UQT and BQT. In a quantum network, quantum memory stores qubits and entangled states during the teleportation process. In the case of UQT, each teleportation requires only one entangled pair and typically involves shorter waiting times. As a result, memory usage remains low, and quantum memories are released more quickly for future operations. In contrast, BQT requires two entangled pairs—one for each direction—and both ends must be ready simultaneously. This synchronization requirement often causes delays, leading to longer memory occupancy and, consequently, higher memory utilization. Network user analysis Figure 7a shows that when the number of users in the network is low, both unidirectional and bidirectional quantum teleportation achieve similar throughput. However, as the number of users increases, UQT outperforms BQT. This is because UQT transmits only one qubit at a time, making better use of available quantum memory at the nodes and experiencing lower network congestion. In contrast, BQT involves the simultaneous teleportation of two qubits in opposite directions, which requires more resources and synchronization between nodes. This added complexity leads to delays and reduces the throughput of the network.Fig. 7Performance evaluation based on SD pairs. Performance evaluation based on SD pairs. In Fig. 7b, when the number of users in the quantum network increases, both UQT and BQT show lower fidelity. This is because more users create more demand on the network. As a result, the system has to share limited quantum resources like entangled pairs and memory among many users. With more users, qubits may have to wait longer in quantum memory before teleportation can proceed. This waiting time causes the teleportation fidelity to drop. Also, there is more congestion and more steps involved in sending qubits across multiple nodes. Each extra step adds an error because of more frequent entanglement swapping. These small errors add up and reduce the accuracy, or fidelity, of the teleported qubits. In Fig. 7c, as the number of users in a quantum network increases, quantum memory utilization also rises. This is because each user needs to transmit qubits, and both the qubits and their associated entangled pairs must be temporarily stored in quantum memory at various nodes along the path. In the case of UQT, memory usage remains relatively low because only one qubit is teleported at a time, requiring fewer entangled resources and shorter storage durations. In contrast, BQT requires multiple qubits to be teleported simultaneously in both directions, which significantly increases the demand for quantum memory. The need for synchronization between nodes also causes additional delays, forcing qubits to remain in memory longer. This results in higher memory utilization, especially as the network becomes more congested. Network path length analysis Figure 8a shows that as the path length increases, the throughput of both UQT and BQT also increases. This is because qubits experience exponential decay over longer paths, which leads to a higher chance of failure in quantum teleportation. To maintain the desired fidelity and ensure successful teleportation between users, the network needs to generate and transmit more qubits along longer paths. As a result, the number of teleportation attempts increases, which contributes to the rise in overall throughput for both UQT and BQT.Fig. 8Performance evaluation based on path lengths. Performance evaluation based on path lengths. Figure 8b shows that fidelity goes down in UQT and BQT when the path length gets longer. This happens because longer paths mean qubits have to pass through more nodes. Each node involves extra steps like swapping entanglement, and every step adds a small chance for errors. Also, qubits spend more time traveling and waiting in memory, which causes them to lose their quality due to noise and delays. Figure 8c shows that both teleportation techniques (UQT and BQT) exhibit lower quantum memory utilization when the path length is short. This is due to fewer entanglement swapping operations and reduced hardware errors in the network. However, as the path length increases, the number of intermediate nodes also rises, leading to longer waiting times for memory entanglement and increased losses. Consequently, both teleportation techniques show higher memory utilization for longer paths. Analytical fidelity versus simulated performance The accuracy of bidirectional quantum teleportation using non-orthogonal coherent states may be tested analytically using the fidelity formulas defined in “Fidelity of the bidirectional quantum teleportation” section. Both Alice to Bob (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$F_{A \rightarrow B}$$\end{document}) and Bob to Alice (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$F_{B \rightarrow A}$$\end{document}) closed-form formulas for the fidelity were derived by modeling the input and output states in an orthonormal basis made up of even and odd Schrödinger cat states. The Uhlmann fidelity formula is used to calculate these equations, and the output states are represented in the Bloch sphere representation as qubit density matrices. The performance evaluation done in “Results analysis” section is based on this theoretical fidelity study. We used the SeQUeNCe discrete event quantum network simulator to simulate a realistic, large-scale quantum communication network, taking into account actual limitations like entanglement swapping degradation, efficiency detection, channel attenuation, and quantum memory coherence time. Figures 5, 6, 7 and 8 show fidelity metrics that are directly derived from the previously created analytical model. In particular, the performance of the bidirectional teleportation protocol with physical layer flaws and network-level dynamics is determined using the Bloch vector-based fidelity calculations defined in “Fidelity of the bidirectional quantum teleportation” section. The way the simulated fidelity changes across various network configurations is a reflection of the effect of teleportation parameters, such as the amplitude \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha$$\end{document} of the coherent states, phase parameters \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\theta$$\end{document}, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\phi$$\end{document}, and the normalization factors. Therefore, the performance study improves the theoretical teleportation model’s applicability to practical quantum network settings in addition to verifying it under ideal conditions. The strong practical value of our bidirectional coherent-state teleportation protocol based on discrete-time quantum walks is reinforced by the good correspondence between the simulation results and the analytical fidelity derivation. Although the results show that the fidelity of unidirectional quantum teleportation (UQT) is generally higher than that of bidirectional quantum teleportation (BQT) under the same network conditions, BQT can become advantageous in specific high-performance regimes. When the quantum channel has high transmissivity and fast entanglement-generation rates, the simultaneous two-way exchange in BQT can reduce total communication time and improve effective throughput. This indicates that, despite its higher resource cost, there exists a parameter region where the symmetric structure of BQT provides better overall performance than sequential UQT. This threshold regime will be further analyzed in future work to identify the exact conditions under which BQT surpasses UQT in fidelity and transmission efficiency. Experimental feasibility and implementation outlook Although this study is theoretical and supported by large-scale simulations, the proposed Bidirectional Quantum Teleportation (BQT) protocol based on Discrete-time quantum walks (DTQWs) can be implemented using current photonic or cavity-based quantum technologies. The main experimental challenges include generating stable coherent and cat states, realizing precise coin and shift operations for the DTQW evolution, and keeping both communication directions synchronized with minimal phase and loss imbalance. Scaling the protocol to many nodes would also require long-lived quantum memories and efficient entanglement swapping. As we discussed in the previous paragraph, recent progress in integrated photonics suggests that these requirements are within reach, making our hybrid BQT–DTQW model a promising candidate for future experimental demonstrations in quantum networks. Conclusion In this paper, we propose a new methodology for bidirectional quantum teleportation based on coherent-state encoding and discrete-time quantum walks. The protocol takes advantage of the encoding power of non-orthogonal coherent states and the interference qualities of quantum walks to allow simultaneous quantum state exchange between two individuals. We used Bloch vector formalism to develop precise formulas for the teleportation fidelity in both directions by reformulating the input states in the even and odd Schrödinger cat basis. We ran simulations with the SeQUeNCe quantum network simulator to determine the practical value of our methodology. These simulations evaluated performance in terms of fidelity, throughput, and memory utilization across several network structures and simulated genuine quantum network situations. The simulation findings show the durability and scalability of the suggested protocol and are consistent with our theoretical predictions. The present work offers the foundation for the implementation of symmetrical and successful quantum teleportation in future quantum networks. Integration with hybrid continuous-discrete quantum structures, adaptive walk parameter control, and noise robustness could all be the subjects of future studies. The suggested BQT protocol, which is based on DTQWs, can be implemented using existing photonic quantum technologies, given the fact that this study is theoretical and supported by detailed simulations. Generating stable coherence and cat states, performing accurate coin and shift operations for the DTQW evolution, and maintaining both communication directions synchronized with the least amount of phase and loss imbalance are the main experimental problems. Effective entanglement swapping and long-lived quantum memory would also be necessary for expanding the protocol to several nodes. These conditions may be met, according to recent developments in integrated photonics, which makes our BQT–DTQW model an excellent option for upcoming quantum network experimental demonstrations.