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

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

Duc Manh Nguyen, Sunghwan Kim

Published Aug 5, 2019• 9 citations
Publisher

Abstract

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.

DOI
10.1142/s0217984919502701

Related papers

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

Yu‐Guang Yang, Shengnan Cao, Weifeng Cao +3 more

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.

Modern Physics Letters B•Feb 28, 2019•9 citations

A Note on Itô's Formula for Discrete-Time Quantum Walk

Norio Konno

We present an Itô's formula for the one-dimensional discrete-time quantum walk and give some examples including a Tanaka's formula by using the formula.Moreover we discuss integrals for the quantum walk.

Journal of Computational and Theoretical Nanoscience•Jun 20, 2013•1 citation

A note on Ito's formula for discrete-time quantum walk

Norio Konno

We present an Ito's formula for the one-dimensional discrete-time quantum walk and give some examples including a Tanaka's formula by using the formula. Moreover we discuss integrals for the quantum walk.

arXiv:1112.4335•Dec 19, 2011•2 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

A Discrete Transmission Line Model for Discrete-time Quantum Walks

Yusuke Fukushima, Tatsuaki Wada

Based on the similarity between telegraph equation for transmission lines and Klein–Gordon equation, we have related a distributed element model in electrical engineering to a discrete-time quantum walk through Dirac equation. As a result, we have constructed a discrete transmission line model for a discrete-time quantum walk, and it enables us understanding the characteristics of quantum walks as those of the transmission line.

Interdisciplinary Information Sciences•Jan 1, 2017•2 citations

Discrete-time quantum walk approach to state transfer

Paweł Kurzyński, Antoni Wójcik

We show that a quantum-state transfer, previously studied as a continuous-time process in networks of interacting spins, can be achieved within the model of discrete-time quantum walks with a position-dependent coin. We argue that, due to additional degrees of freedom, discrete-time quantum walks allow one to observe effects which cannot be observed in the corresponding continuous-time case. First, we study a discrete-time version of the engineered coupling protocol due to Christandl et al. [Phys. Rev. Lett. 92, 187902 (2004)] and then we discuss the general idea of conversion between continuous-time quantum walks and discrete-time quantum walks.

arXiv:1103.4185•Physical Review A•Jun 13, 2011•76 citations
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.
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.
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 show that a quantum-state transfer, previously studied as a continuous-time process in networks of interacting spins, can be achieved within the model of discrete-time quantum walks with a position-dependent coin. We argue that, due to additional degrees of freedom, discrete-time quantum walks allow one to observe effects which cannot be observed in the corresponding continuous-time case. First, we study a discrete-time version of the engineered coupling protocol due to Christandl et al. [Phys. Rev. Lett. 92, 187902 (2004)] and then we discuss the general idea of conversion between continuous-time quantum walks and discrete-time quantum walks.