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

Science China Information Sciences

Quantum network communication: a discrete-time quantum-walk approach

Yu‐Guang Yang, Jiajie Yang, Yi‐Hua Zhou, Wei‐Min Shi, Xiu‐Bo Chen, Jian Li, Hui-Juan Zuo

Published Jan 5, 2018• 43 citations
Publisher
DOI
10.1007/s11432-017-9190-0

Related papers

Quantum direct communication protocols using discrete-time quantum walk

S. Srikara, C. M. Chandrashekar

arXiv:2004.03273•Quantum Information Processing•Aug 24, 2020•16 citations

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

Quantum Network Communication

Ming-Xing Luo

Springer eBooks•Jan 1, 2024•2 citations

Accelerated first detection in discrete-time quantum walks using sharp restarts

Kunal Shukla, Riddhi Chatterjee, C. M. Chandrashekar

Restart is a common strategy observed in nature that accelerates first-passage processes, and has been extensively studied using classical random walks. In the quantum regime, restart in continuous-time quantum walks (CTQWs) has been shown to expedite the quantum hitting times []. Here, we study how restarting monitored discrete-time quantum walks (DTQWs) affects the quantum hitting times. We show that the restarted DTQWs outperform classical random walks in target searches, benefiting from quantum ballistic propagation, a feature shared with their continuous-time counterparts. Moreover, the explicit coin degree of freedom in DTQWs allows them to surpass even CTQWs in target detection without sacrificing any quantum advantage. Additionally, knowledge of the target's parity or position relative to the origin can be leveraged to tailor DTQWs for even faster searches. Our study paves the way for more efficient use of DTQWs in quantum-walk-based search algorithms, simulations, and modeling of quantum transport towards targeted sites in complex quantum networks.

arXiv:2411.09477•Physical Review Research•Apr 21, 2025•5 citations

Quantum Direct Communication using Quantum Walks

S. Srikara

•Jun 1, 2020•0 citations
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.
Restart is a common strategy observed in nature that accelerates first-passage processes, and has been extensively studied using classical random walks. In the quantum regime, restart in continuous-time quantum walks (CTQWs) has been shown to expedite the quantum hitting times []. Here, we study how restarting monitored discrete-time quantum walks (DTQWs) affects the quantum hitting times. We show that the restarted DTQWs outperform classical random walks in target searches, benefiting from quantum ballistic propagation, a feature shared with their continuous-time counterparts. Moreover, the explicit coin degree of freedom in DTQWs allows them to surpass even CTQWs in target detection without sacrificing any quantum advantage. Additionally, knowledge of the target's parity or position relative to the origin can be leveraged to tailor DTQWs for even faster searches. Our study paves the way for more efficient use of DTQWs in quantum-walk-based search algorithms, simulations, and modeling of quantum transport towards targeted sites in complex quantum networks.