Scheduling Quantum Annealing for Active User Detection in a NOMA Network

Active user detection in a non-orthogonal multiple access (NOMA) network is a major challenge for 5G/6G applications. However, classical algorithms that can perform this task suffer either from complexity or reduced performances. This work aims at proposing a quantum annealing approach to overcome this trade-off. Firstly, we show that the maximum a posteriori decoder of the activity pattern of the network can be seen as the ground state of an Ising Hamiltonian. For N users in a network with perfect channels, we propose a universal control function to schedule the annealing process. Our approach avoids to continuously compute the optimal control function but still ensures high success probability while demanding a lower annealing time than a linear control function. This advantage holds even in the presence of imperfections in the network.

Authors

Institutions

Publication Details

Published
2024-09-15
DOI
https://doi.org/10.1109/qce60285.2024.00057
Citations
3
Primary Topic
Advanced Wireless Communication Technologies
Type
article
Field-Weighted Citation Impact
0.63
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Scheduling Quantum Annealing for Active User Detection in a NOMA Network

Claire Goursaud, Romain Piron
3 citations
Advanced Wireless Communication Technologies
0.63
article

Scheduling Quantum Annealing for Active User Detection in a NOMA Network

Claire Goursaud, Romain Piron
article en
3 citations

Abstract

Active user detection in a non-orthogonal multiple access (NOMA) network is a major challenge for 5G/6G applications. However, classical algorithms that can perform this task suffer either from complexity or reduced performances. This work aims at proposing a quantum annealing approach to overcome this trade-off. Firstly, we show that the maximum a posteriori decoder of the activity pattern of the network can be seen as the ground state of an Ising Hamiltonian. For N users in a network with perfect channels, we propose a universal control function to schedule the annealing process. Our approach avoids to continuously compute the optimal control function but still ensures high success probability while demanding a lower annealing time than a linear control function. This advantage holds even in the presence of imperfections in the network.

Université Claude Bernard Lyon 1 (FR), Institut national de recherche en sciences et technologies du numérique (FR), Institut National des Sciences Appliquées de Lyon (FR)
Affordable and clean energy
Openalex Percentile: Top 30%
Advanced Wireless Communication Technologies
0.63
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.

Scheduling Quantum Annealing for Active User Detection in a NOMA Network — Claire Goursaud, Romain Piron · (2024) | TGRS Research Map | TGRS