Quantum Machine Learning for Performance Optimization of RIS-Assisted Communications: Framework Design and Application to Energy Efficiency Maximization of Systems With RSMA
Bibliographic record
Abstract
This study proposes the utilization of quantum machine learning (QML) to maximize the energy efficiency of reconfigurable intelligent surface (RIS) assisted communication with rate-splitting multiple access (RSMA). The next-generation wireless communications are expected to yield significantly higher energy efficiency compared to that of the previous generations. In a multiuser system, energy efficiency can be defined as a benefit-to-cost ratio between the achievable sum-rate and the energy consumption, where enhancements in the former come at the expense of increases in the latter. Recently, the integration between RSMA and RISs has been advocated as a powerful mean to control this tradeoff. Indeed, RSMA can enhance the rate region while RISs can lead to reduced energy consumption thanks to the use of low-energy phase shifters. However, optimizing a RIS-aided RSMA communication system is faced with a computational burden given that the RIS enlarges the volume of the required channel information, which expands the information that needs to be processed by the optimization module, even when the optimization is based on conventional learning techniques. The proposed QML optimization framework, which orchestrates non-linear quantum unitary operations to compose the learning models, enjoys information processing gains thanks to state vector operations in multi-dimensional Hilbert space. It is composed of two trainable quantum-based learning models employed in an alternating manner: the first establishes the transmission precoding, and the second designs the RIS phase shifting. Numerical results show that the proposed QML delivers comparable performance to that of conventional optimization but with reduced complexity.
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.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".