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• 35 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•7 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

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

This paper presents BQT-MDQW, a hybrid quantum-classical framework for routing in multihop quantum communication networks. The framework combines fidelity-aware edge costs, quantum-walkassisted exploration, and resource-adaptive bidirectional quantum teleportation (BQT). Three composite entangled resources—W-Bell, GHZ-Bell, and Cluster-Bell—are formulated as candidate channels and compared under a common simulation model. The protocol estimates link-level channel-quality parameters and selects resource states and conditional Pauli recovery operations according to the estimated channel conditions. Routing is performed by a modified Dijkstra layer that minimizes a fidelity-derived edge cost, while a coined quantum walk supplies candidate high-fidelity regions of the network graph; the final route is reconstructed and verified classically. Circuit-level simulations are carried out on the Qiskit Aer simulator, and network-level evaluations are reported for graphs of 50-200 nodes under depolarizing noise and independent link-failure models.Within this simulated regime,W-Bell-based routing preserves comparatively higher end-to-end fidelity than GHZ-Bell- and Cluster-Bell-based routing, and the bidirectional scheme is presented as a trade-off against unidirectional teleportation rather than as a uniform performance gain. TheO(log2N) scaling reported here is an assumption-dependent estimate for the idealized quantum-walk search subroutine only, excluding state preparation, link-fidelity estimation, output extraction, classical path reconstruction, and hop-by-hop teleportation; it is not a complexity bound for the full routing protocol, and unconditional quantum speedup over classical shortest-path routing is not established. The contribution is a proof-of-concept hybrid framework that integrates fidelity-aware routing, quantum-walkassisted exploration, and bidirectional teleportation for multi-hop quantum networks.

IEEE Access•Jan 1, 2026•0 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•3 citations

Network Coding Quantum Communications via Multi-step Quantum Teleportation

Ying Guo, Moon Ho Lee

한국통신학회 학술대회논문집•Jun 1, 2010•0 citations
This paper presents BQT-MDQW, a hybrid quantum-classical framework for routing in multihop quantum communication networks. The framework combines fidelity-aware edge costs, quantum-walkassisted exploration, and resource-adaptive bidirectional quantum teleportation (BQT). Three composite entangled resources—W-Bell, GHZ-Bell, and Cluster-Bell—are formulated as candidate channels and compared under a common simulation model. The protocol estimates link-level channel-quality parameters and selects resource states and conditional Pauli recovery operations according to the estimated channel conditions. Routing is performed by a modified Dijkstra layer that minimizes a fidelity-derived edge cost, while a coined quantum walk supplies candidate high-fidelity regions of the network graph; the final route is reconstructed and verified classically. Circuit-level simulations are carried out on the Qiskit Aer simulator, and network-level evaluations are reported for graphs of 50-200 nodes under depolarizing noise and independent link-failure models.Within this simulated regime,W-Bell-based routing preserves comparatively higher end-to-end fidelity than GHZ-Bell- and Cluster-Bell-based routing, and the bidirectional scheme is presented as a trade-off against unidirectional teleportation rather than as a uniform performance gain. TheO(log2N) scaling reported here is an assumption-dependent estimate for the idealized quantum-walk search subroutine only, excluding state preparation, link-fidelity estimation, output extraction, classical path reconstruction, and hop-by-hop teleportation; it is not a complexity bound for the full routing protocol, and unconditional quantum speedup over classical shortest-path routing is not established. The contribution is a proof-of-concept hybrid framework that integrates fidelity-aware routing, quantum-walkassisted exploration, and bidirectional teleportation for multi-hop quantum networks.