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

arXiv:2103.11536 · Quantum Information Processing

General condition of quantum teleportation by one-dimensional quantum walks

Tomoki Yamagami, Etsuo Segawa, Norio Konno

Published Jul 1, 2021• 13 citations
arXivHTMLPDF
DOI
10.1007/s11128-021-03155-4

Related papers

Generalized teleportation by quantum walks

Yu Wang, Yun Shang, Peng Xue

Quantum Information Processing•Jul 26, 2017•66 citations

Bidirectional quantum teleportation using quantum walks

A. S. Abay Krishna, K. K. Naseeda, N. C. Randeep

arXiv:2410.20339•Quantum Information Processing•Oct 24, 2025•4 citations

Generalized quantum teleportation of shared quantum secret: a coined quantum-walk approach

Heng-Ji Li, Jian Li, Xiu‐Bo Chen

arXiv:2012.03029•Quantum Information Processing•Nov 19, 2022•11 citations

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

A Quantum Group Signature Based on Quantum Walk in d Dimensions

Yunxiao Qian, Haoyang Yu

In this paper, a group signature scheme based on quantum walk for quantum messages is proposed. Our scheme uses long step quantum walk-based teleportation and modified quantum one-time pad to authenticate the quantum messages respectively. In our scheme, the signer in a group signs the quantum messages by quantum walk-based teleportation and modified quantum one-time pad. The verifier can verify the signature via quantum walk-based teleportation while the group manager verifies the signature and identifies the signer via modified quantum one-time pad. The security analysis shows that the scheme can reach the properties of group signature. Compared to the teleportation via EPR pairs or Bell-like states, quantum walks are more flexible and use less measurement resources. Quantum teleportation via long-step quantum walk is more secure than that via one-step quantum walk in previous related works. The scheme can apply to arbitrary finite dimensional quantum systems and can also be possible to realize in practice.

International Conference on High Performance Compilation, Computing and Communications (HP3C)•Jun 23, 2022•1 citation

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
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 paper, a group signature scheme based on quantum walk for quantum messages is proposed. Our scheme uses long step quantum walk-based teleportation and modified quantum one-time pad to authenticate the quantum messages respectively. In our scheme, the signer in a group signs the quantum messages by quantum walk-based teleportation and modified quantum one-time pad. The verifier can verify the signature via quantum walk-based teleportation while the group manager verifies the signature and identifies the signer via modified quantum one-time pad. The security analysis shows that the scheme can reach the properties of group signature. Compared to the teleportation via EPR pairs or Bell-like states, quantum walks are more flexible and use less measurement resources. Quantum teleportation via long-step quantum walk is more secure than that via one-step quantum walk in previous related works. The scheme can apply to arbitrary finite dimensional quantum systems and can also be possible to realize in practice.
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.