Fixed-Complexity Quantum-Assisted Multi-User Detection for CDMA and SDMA

In a system supporting numerous users the complexity of the optimal Maximum Likelihood Multi-User Detector (ML MUD) becomes excessive. Based on the superimposed constellations of K users, the ML MUD outputs the specific multi-level K-user symbol that minimizes the Euclidean distance with respect to the faded and noise-contaminated received multilevel symbol. Explicitly, the Euclidean distance is considered as the Cost Function (CF). In a system supporting K users employing M-ary modulation, the ML MUD uses M-K CF evaluations (CFE) per time slot. In this contribution we propose an Early Stopping-aided Durr-Hoyer algorithm-based Quantum-assisted MUD (ES-DHA QMUD) based on two techniques for achieving optimal ML detection at a low complexity. Our solution is also capable of flexibly adjusting the QMUD's performance and complexity trade-off, depending on the computing power available at the base station. We conclude by proposing a general design methodology for the ES-DHA QMUD in the context of both CDMA and SDMA systems.