Quantum-Inspired Resource Optimization for 6G Networks: A Survey
Bibliographic record
Abstract
The Internet of Things (IoT) drives an exponential surge in computing and communication devices. Consequently, it triggers capacity, coverage, interference, latency, and security issues in the existing communication networks. The forthcoming sixth-generation (6G) networks will address these issues by providing comprehensive solutions. In particular, quantum communication technology can potentially address the challenges of 6G networks. However, its implementation requires substantial infrastructure upgrades. Therefore, the quantum-inspired (QI) techniques offer an intermediate resort due to their ability to utilize the classical communication infrastructure for design and implementation. Hence, we review QI techniques in this survey that address radio resource optimization challenges across various communication aspects, including channel assignment, reconfigurable intelligent surfaces, spectrum sensing, uncrewed aerial vehicle-assisted networks, and related areas. The analysis explores diverse aspects, including objectives, constraints, problem characterization, proposed solutions, and lessons learnt. Research indicates that QI techniques offer advantages such as faster convergence and reduced complexity, providing promising solutions to complex optimization problems in communication networks. Furthermore, we identify the future directions, research gaps, and ongoing challenges from the QI radio resource optimization dataset.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.003 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.004 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".