Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Modern Physics Letters B

Generalized teleportation by means of discrete-time quantum walks on N-lines and N-cycles

Yu‐Guang Yang, Shengnan Cao, Weifeng Cao, Dan Li, Yi‐Hua Zhou, Wei‐Min Shi

Published Feb 28, 2019• 9 citations
Publisher

Abstract

Recently, Wang et al. [Wang et al., Quantum Inf. Process. 16 (2017) 221] developed generalized teleportation schemes based on different quantum walks structures. In their paper, an interesting open question is whether there are other graphs suitable for teleportation. Here, we extend the results of quantum teleportation of an unknown qubit state by means of discrete-time quantum walks and propose two kinds of schemes for quantum teleportation by means of discrete-time quantum walks on N-lines and N-cycles, respectively. Likewise, prior quantum entanglement is unnecessary for teleportation and quantum entanglement is generated by means of quantum walks. This further opens wider applications of quantum walks in quantum communication protocols.

DOI
10.1142/s0217984919500702

Related papers

The fog on: Generalized teleportation by means of discrete-time quantum walks on N-lines and N-cycles

Duc Manh Nguyen, Sunghwan Kim

The recent paper entitled “Generalized teleportation by means of discrete-time quantum walks on [Formula: see text]-lines and [Formula: see text]-cycles” by Yang et al. [Mod. Phys. Lett. B 33(6) (2019) 1950069] proposed the quantum teleportation by means of discrete-time quantum walks on [Formula: see text]-lines and [Formula: see text]-cycles. However, further investigation shows that the quantum walk over the one-dimensional infinite line can be based over the [Formula: see text]-cycles and cannot be based on [Formula: see text]-lines. The proofs of our claims on quantum walks based on finite lines are also provided in detail.

Modern Physics Letters B•Aug 5, 2019•9 citations

Quantum communication scheme to teleport arbitrary quantum state via discrete time quantum walks

Rachana Soni, Neelam Choudhary, Neha Singh

In this article, we propose a quantum communication protocol via 2-step discrete time quantum walks with two coins on a graph of 10 vertices containing both cycles and paths. Quantum walks are known for their ability to integrate quantum mechanics dynamics like superposition and entanglement during the procedure. We calculate the total final quantum state of the system as well as the recovery operators to rescue the initial quantum state back at the receiver's location. Our work provides a fundamental block for a quantum teleportation scheme on a specific series of cycle and path graphs.

arXiv:2501.11785•Jan 20, 2025•0 citations

Generalized quantum teleportation of shared quantum secret with quantum walks

Hengji Li, Jian Li, Xiu‐Bo Chen

Very recently, Lee et al. proposed the first secure quantum teleporation protocol, where quantum information shared by an arbitrary number of senders can be transferred to another arbitrary number of receivers. Here, by introducing quantum walks, a novel secure (n,m) quantum teleportation of shared quantum secret between n senders and $m$ receivers is presented. Firstly, two kinds of (n,2) teleportation schemes are proposed by n-walker quantum walks on the line, the first walker of which is driven by three coins, respectively, based on two kinds of coin operators: the homogeneous coins and the position-dependent coins. Secondly, by increasing the amount of the coins of the first walker to m+1, the previous (n,2) scheme can be generalized to (n,m) teleportation scheme. Then, we give the proof of the information security of our proposed scheme, in which neither any single nor subparties of senders and receivers can fully access the secret quantum information. Moreover, the projective measurements are needed, instead of the joint Bell measurements that are necessary in Lee et al.'s protocol. Our work can also be extended further to QWs on the cycle. This work provides an additional relevant instance of the richness of quantum walks for quantum information processing tasks and thus opens the wider application purpose of quantum walks.

arXiv:2012.03029•Dec 5, 2020•0 citations

Bidirectional multi-nodes quantum teleportation using discrete-time quantum walk

Nada Ikken, Pankaj Kumar, Abdallah Slaoui +4 more

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.

Scientific Reports•Dec 29, 2025•1 citation

Perfect state transfer and efficient quantum routing: A discrete-time quantum-walk approach

Xiang Zhan, Hao Qin, Zhihao Bian +2 more

We show that a perfect state transfer of an arbitrary unknown two-qubit state can be achieved via a discrete-time quantum walk with various settings of coin flips and extend this method to the distribution of an arbitrary unknown multiqubit entangled state between every pair of sites in the multidimensional network. Furthermore, we study the routing of quantum information on this network in a quantum-walk architecture, which can be used as quantum information processors to communicate between separated qubits.

arXiv:1405.6422•Physical Review A•Jul 21, 2014•74 citations

Quantum Network Communication With a Novel Discrete-Time Quantum Walk

Xiu‐Bo Chen, Yalan Wang, Gang Xu +1 more

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

IEEE Access•Jan 1, 2019•39 citations
Recently, Wang et al. [Wang et al., Quantum Inf. Process. 16 (2017) 221] developed generalized teleportation schemes based on different quantum walks structures. In their paper, an interesting open question is whether there are other graphs suitable for teleportation. Here, we extend the results of quantum teleportation of an unknown qubit state by means of discrete-time quantum walks and propose two kinds of schemes for quantum teleportation by means of discrete-time quantum walks on N-lines and N-cycles, respectively. Likewise, prior quantum entanglement is unnecessary for teleportation and quantum entanglement is generated by means of quantum walks. This further opens wider applications of quantum walks in quantum communication protocols.
The recent paper entitled “Generalized teleportation by means of discrete-time quantum walks on [Formula: see text]-lines and [Formula: see text]-cycles” by Yang et al. [Mod. Phys. Lett. B 33(6) (2019) 1950069] proposed the quantum teleportation by means of discrete-time quantum walks on [Formula: see text]-lines and [Formula: see text]-cycles. However, further investigation shows that the quantum walk over the one-dimensional infinite line can be based over the [Formula: see text]-cycles and cannot be based on [Formula: see text]-lines. The proofs of our claims on quantum walks based on finite lines are also provided in detail.
In this article, we propose a quantum communication protocol via 2-step discrete time quantum walks with two coins on a graph of 10 vertices containing both cycles and paths. Quantum walks are known for their ability to integrate quantum mechanics dynamics like superposition and entanglement during the procedure. We calculate the total final quantum state of the system as well as the recovery operators to rescue the initial quantum state back at the receiver's location. Our work provides a fundamental block for a quantum teleportation scheme on a specific series of cycle and path graphs.
Very recently, Lee et al. proposed the first secure quantum teleporation protocol, where quantum information shared by an arbitrary number of senders can be transferred to another arbitrary number of receivers. Here, by introducing quantum walks, a novel secure (n,m) quantum teleportation of shared quantum secret between n senders and mmm receivers is presented. Firstly, two kinds of (n,2) teleportation schemes are proposed by n-walker quantum walks on the line, the first walker of which is driven by three coins, respectively, based on two kinds of coin operators: the homogeneous coins and the position-dependent coins. Secondly, by increasing the amount of the coins of the first walker to m+1, the previous (n,2) scheme can be generalized to (n,m) teleportation scheme. Then, we give the proof of the information security of our proposed scheme, in which neither any single nor subparties of senders and receivers can fully access the secret quantum information. Moreover, the projective measurements are needed, instead of the joint Bell measurements that are necessary in Lee et al.'s protocol. Our work can also be extended further to QWs on the cycle. This work provides an additional relevant instance of the richness of quantum walks for quantum information processing tasks and thus opens the wider application purpose of quantum walks.
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.
We show that a perfect state transfer of an arbitrary unknown two-qubit state can be achieved via a discrete-time quantum walk with various settings of coin flips and extend this method to the distribution of an arbitrary unknown multiqubit entangled state between every pair of sites in the multidimensional network. Furthermore, we study the routing of quantum information on this network in a quantum-walk architecture, which can be used as quantum information processors to communicate between separated qubits.
In this paper, we propose a scheme using a new kind of quantum walk to realize quantum communication well. In our scheme, obviously, there are three advantages. First, the initial states can be transferred from the source to the target by finite steps, which will make execution easier in practice. Second, due to fewer restrictions to the network models, our scheme can be adapted to more general network models, such as the butterfly network, the inverted crown network, the grail network, and the generalized butterfly network Gk. Finally, arbitrary single-qubit and two-qubit initial states can be transferred to different kinds of network models. At the same time, the fidelity and probability equal 1. Our work promotes more applications of combining quantum computation with quantum communication in the future.