User trajectory prediction in mobile wireless networks using quantum reservoir computing
Bibliographic record
Abstract
Abstract This paper applies a quantum machine learning technique to predict mobile users' trajectories in mobile wireless networks by using an approach called quantum reservoir computing (QRC). Mobile users' trajectories prediction belongs to the task of temporal information processing, and it is a mobility management problem that is essential for self‐organising and autonomous 6G networks. Our aim is to accurately predict the future positions of mobile users in wireless networks using QRC. To do so, the authors use a real‐world time series dataset to model mobile users' trajectories. The QRC approach has two components: reservoir computing (RC) and quantum computing (QC). In RC, the training is more computational‐efficient than the training of simple recurrent neural networks since, in RC, only the weights of the output layer are trainable. The internal part of RC is what is called the reservoir. For the RC to perform well, the weights of the reservoir should be chosen carefully to create highly complex and non‐linear dynamics. The QC is used to create such dynamical reservoir that maps the input time series into higher dimensional computational space composed of dynamical states. After obtaining the high‐dimensional dynamical states, a simple linear regression is performed to train the output weights and, thus, the prediction of the mobile users' trajectories can be performed efficiently. In this study, we apply a QRC approach based on the Hamiltonian time evolution of a quantum system. The authors simulate the time evolution using IBM gate‐based quantum computers, and they show in the experimental results that the use of QRC to predict the mobile users' trajectories with only a few qubits is efficient and can outperform the classical approaches such as the long short‐term memory approach and the echo‐state networks approach.
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.000 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
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".