In this paper, we address the joint maximum-likelihood detection of power-domain non-orthogonal multiple access and transform the detection problem into a binary optimization problem. Then, we solve it by a quantum algorithm, Grover adaptive search (GAS), and further accelerate the algorithm. Assuming fault-tolerant quantum computing, GAS provides a quadratic speedup for binary optimization problems in terms of query complexity. The proposed method designs the number of Grover operators using a time-invariant distribution of the number of solutions, which can be obtained in advance. Simulation results demonstrate that the proposed method is capable of reducing the query complexity in the classical domain while achieving the optimal performance.
Grover Adaptive Search for Joint Maximum-Likelihood Detection of Power-Domain Non-Orthogonal Multiple Access
2023-06-01
1035556 byte
Conference paper
Electronic Resource
English
Maximum Likelihood Approach to Joint Array Detection-Estimation
Online Contents | 2004
|Near maximum likelihood demodulation for M-ary orthogonal signaling
Automotive engineering | 1993
|