Quantum Deep Q-Network for Intelligent Packet Routing in 6G Heterogeneous Wireless Networks

Intelligent packet routing in sixth-generation (6G) heterogeneous wireless networks must contend with stochastic link failures, heterogeneous delay profiles, and the severe memory constraints of edge nodes. We propose a quantum deep Q-network (Q-DQN) that replaces the multi-layer perceptron in a standard DQN agent with a six-qubit variational quantum circuit (VQC) employing ring-topology entanglement and angle embedding. The total trainable parameter count follows the closed-form expression |ϕ|=12L+7n, growing at only seven parameters per additional network node. On a 10-node heterogeneous topology with stochastic link failures, Q-DQN achieves an average end-to-end delay of 54.29±1.72 ms with only 106 parameters, a 49.6× reduction relative to the MLP-based DQN baseline (5258 parameters, 52.89±2.67 ms). A three-seed scalability evaluation across n∈{6,8,10,12} nodes shows that under a limited 200-episode training budget DQN converges more consistently, while Q-DQN matches DQN performance under full 500-episode training at a fraction of the parameter cost. Ablation experiments confirm that local-topology entanglement substantially outperforms full-connection alternatives. These results indicate that VQC-based routing agents can match classical counterparts at a fraction of the parameter cost, providing a path toward ultra-lightweight intelligent routing in 6G edge deployments.

Authors

Institutions

Publication Details

Journal
Applied Sciences
Published
2026-06-16
DOI
https://doi.org/10.3390/app16126096
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Quantum Deep Q-Network for Intelligent Packet Routing in 6G Heterogeneous Wireless Networks

Taoyong Li, Jiacheng Ni, Tong Xie, Xinxin Yuan
Applied Sciences
Quantum Computing Algorithms and Architecture
article

Quantum Deep Q-Network for Intelligent Packet Routing in 6G Heterogeneous Wireless Networks

Taoyong Li, Jiacheng Ni, Tong Xie, Xinxin Yuan
article en

Abstract

Intelligent packet routing in sixth-generation (6G) heterogeneous wireless networks must contend with stochastic link failures, heterogeneous delay profiles, and the severe memory constraints of edge nodes. We propose a quantum deep Q-network (Q-DQN) that replaces the multi-layer perceptron in a standard DQN agent with a six-qubit variational quantum circuit (VQC) employing ring-topology entanglement and angle embedding. The total trainable parameter count follows the closed-form expression |ϕ|=12L+7n, growing at only seven parameters per additional network node. On a 10-node heterogeneous topology with stochastic link failures, Q-DQN achieves an average end-to-end delay of 54.29±1.72 ms with only 106 parameters, a 49.6× reduction relative to the MLP-based DQN baseline (5258 parameters, 52.89±2.67 ms). A three-seed scalability evaluation across n∈{6,8,10,12} nodes shows that under a limited 200-episode training budget DQN converges more consistently, while Q-DQN matches DQN performance under full 500-episode training at a fraction of the parameter cost. Ablation experiments confirm that local-topology entanglement substantially outperforms full-connection alternatives. These results indicate that VQC-based routing agents can match classical counterparts at a fraction of the parameter cost, providing a path toward ultra-lightweight intelligent routing in 6G edge deployments.

Applied SciencesVol. 16(12)
Air Force Engineering University (CN)
Openalex Percentile: Top 4%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.