Skip to content
DraconiticResearch
Search Sources API
194,161 studies31 sourcesUpdated 58 min ago
PreprintarXiv licencearXiv

Polyhedral RIS Architecture with Quantum-Assisted Facet Selection for Uniform Coverage

Abstract

Reconfigurable intelligent surfaces (RISs) direct coverage toward moving user equipment (UE), but practical deployments involve discrete phase control, uncertain facet positions, and UE mobility, which require the problem to be re-solved continually. We consider these challenges for the chamfered hexagonal polyhedral RIS, which provides nearly uniform coverage. With both incidence and departure angles, we bound in closed form the gain loss of its best facet relative to the best possible reflecting facet, include the known b-bit quantization loss, and extend the bound to joint random mounting errors of all facets. For a precoded multi-user downlink, each facet-selection subproblem of the max-min rate design is shown to be an exact quadratic unconstrained binary optimization (QUBO) problem, suited to repeated time-constrained solving. The deployment of the base station in relation to the RIS allows the polyhedral surface to bring down the percentage of dead zones in vertical planar panels from 77% to 0.3% and increase the minimum rate by 34% relative to the STAR panel. The simulated annealing algorithm finds the optimum solution in 95% of the cases. The quantum approximation algorithm fails to do so.

Related

  1. Conditional-Coverage Contributor Selection for Regional Digital Twins Under Mobility
    Tao Yu
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  2. Sequential Confidence Sets for Coverage-Constrained Conformal Model Selection
    Jing Li, Haibin Zhu
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  3. A Unified Framework for Scenario Coverage Estimation and Representative Selection in Simulation-Based Testing of Automated Vehicles
    Anasse Essalih, Abdel-Hakim Arab, Laurent Durville +4
    HALPreprintCC BY 4.0Full textStatisticsHAL
  4. Finite-sample certification of coverage regret for budgeted document selection under adaptive stratified auditing
    Nora Serdyukova
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  5. Selection-Safe Conformal Early Exit: Distribution-Free Coverage under Adaptive Depth
    Adria Binte Habib, Ibne Farabi Shihab
    arXivPreprintarXiv licenceFull textStatisticsarXiv
BibTeX
@misc{hassan2026polyhedral,
  title = {{Polyhedral RIS Architecture with Quantum-Assisted Facet Selection for Uniform Coverage}},
  author = {Noha Hassan and Halim Yanikomeroglu},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.32898},
  eprint = {2610.32898},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.32898},
}
RIS
TY  - UNPB
TI  - Polyhedral RIS Architecture with Quantum-Assisted Facet Selection for Uniform Coverage
AU  - Noha Hassan
AU  - Halim Yanikomeroglu
PY  - 2026
DA  - 2026/10/23
PB  - arXiv
DO  - 10.48550/arxiv.2610.32898
UR  - https://arxiv.org/abs/2610.32898
AB  - Reconfigurable intelligent surfaces (RISs) direct coverage toward moving user equipment (UE), but practical deployments involve discrete phase control, uncertain facet positions, and UE mobility, which require the problem to be re-solved continually. We consider these challenges for the chamfered hexagonal polyhedral RIS, which provides nearly uniform coverage. With both incidence and departure angles, we bound in closed form the gain loss of its best facet relative to the best possible reflecting facet, include the known b-bit quantization loss, and extend the bound to joint random mounting errors of all facets. For a precoded multi-user downlink, each facet-selection subproblem of the max-min rate design is shown to be an exact quadratic unconstrained binary optimization (QUBO) problem, suited to repeated time-constrained solving. The deployment of the base station in relation to the RIS allows the polyhedral surface to bring down the percentage of dead zones in vertical planar panels from 77% to 0.3% and increase the minimum rate by 34% relative to the STAR panel. The simulated annealing algorithm finds the optimum solution in 95% of the cases. The quantum approximation algorithm fails to do so.
ER  -