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

Quantum Information Processing

Bidirectional quantum teleportation in multi-hop communication network

Zhihua Zhang, Yuyang Sang

Published May 6, 2023• 36 citations
Publisher
DOI
10.1007/s11128-023-03950-1

Related papers

Bidirectional Teleportation Protocol in Quantum Wireless Multi-hop Network

Rui Cai, Xutao Yu, Zaichen Zhang

International Journal of Theoretical Physics•Feb 23, 2018•15 citations

Multi-hop quantum teleportation with GHZ-class states and Bell states in quantum networks

Fan Wu, Liang Bao Tang, Ming-Qiang Bai +1 more

Physica A Statistical Mechanics and its Applications•Jul 6, 2023•6 citations

Quantum Handshake Beacon in Communication System Using Bidirectional Quantum Teleportation

Kan Wang, Rui Cai, Xutao Yu +1 more

International Journal of Theoretical Physics•Oct 18, 2018•4 citations

Bidirectional Controlled Simultaneous Quantum Teleportation within a Quantum Network Via Nine-Qubit Entangled State

Guang-Wei Xie, Ri‐Gui Zhou, Ruiqing Xu

International Journal of Theoretical Physics•Jan 31, 2024•7 citations

BQT-MDQW: Bidirectional Quantum Teleportation Protocol Using Modified Dijkstra-Based Quantum Walks for Multi-Hop Quantum Communication

Nada Ikken, Pankaj Kumar, Abdallah Slaoui +4 more

In this paper, we introduce a new method for Bidirectional Quantum Teleportation called Bidirectional Quantum Teleportation using the Modified Dijkstra Algorithm and Quantum Walk (BQT-MDQW). This method uses different types of entangled states, such as the GHZ-Bell state, W-Bell state, and Cluster-Bell state, to improve quantum communication in multi-hop quantum wireless networks. We focus on the W-Bell state and compare the quantum Dijkstra algorithm with the classical Dijkstra method to see which one works better. We apply both versions to quantum and classical simulators, measuring their performance through fidelity, memory utilization, and throughput calculations. Our results show that the shortest path problem may be solved with significantly reduced computer complexity using the quantum Dijkstra algorithm based on quantum walks. The introduction of a quantum walk, which permits dynamic transitions between quantum channels and the effective exploration of quantum network states, is an important part of the protocol. Using the capacity of the quantum walk to adjust to changing quantum states, we also introduce a method for successfully identifying unitary matrices under varying quantum channels. The bidirectional teleportation structure of the protocol is designed to solve the multi-hop teleportation problem in quantum wireless networks. In addition, we present quantum Dijkstra's algorithm, which uses quantum gates to significantly decrease computational complexity and solve the networking problem by building on the quantum walk framework. This method shows how quantum computing may be used to solve arbitrary optimization issues such as the shortest path problem. Finally, we present a novel multi-hop quantum teleportation system encompassing both unidirectional and bidirectional communication, as introduced in the quantum Dijkstra algorithm system...

arXiv:2504.07320•IEEE Access•Jan 1, 2026•3 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
In this paper, we introduce a new method for Bidirectional Quantum Teleportation called Bidirectional Quantum Teleportation using the Modified Dijkstra Algorithm and Quantum Walk (BQT-MDQW). This method uses different types of entangled states, such as the GHZ-Bell state, W-Bell state, and Cluster-Bell state, to improve quantum communication in multi-hop quantum wireless networks. We focus on the W-Bell state and compare the quantum Dijkstra algorithm with the classical Dijkstra method to see which one works better. We apply both versions to quantum and classical simulators, measuring their performance through fidelity, memory utilization, and throughput calculations. Our results show that the shortest path problem may be solved with significantly reduced computer complexity using the quantum Dijkstra algorithm based on quantum walks. The introduction of a quantum walk, which permits dynamic transitions between quantum channels and the effective exploration of quantum network states, is an important part of the protocol. Using the capacity of the quantum walk to adjust to changing quantum states, we also introduce a method for successfully identifying unitary matrices under varying quantum channels. The bidirectional teleportation structure of the protocol is designed to solve the multi-hop teleportation problem in quantum wireless networks. In addition, we present quantum Dijkstra's algorithm, which uses quantum gates to significantly decrease computational complexity and solve the networking problem by building on the quantum walk framework. This method shows how quantum computing may be used to solve arbitrary optimization issues such as the shortest path problem. Finally, we present a novel multi-hop quantum teleportation system encompassing both unidirectional and bidirectional communication, as introduced in the quantum Dijkstra algorithm system...