Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Consumer Communications and Networking Conference

Over-the-air Demonstration of Quantum-Annealing-Aided Multi-user Detection in MIMO-OFDM Systems

Kouki Yonaga, Kenichi Takizawa

Published Jan 9, 2026• 0 citations
Publisher

Abstract

This study presents an over-the-air (OTA) demonstration of quantum-annealing-aided multi-user detection (QA-aided MUD). QA-aided MUD is a quantum–digital hybrid method that combines iterative multi-user detection (MUD) and quantum annealing (QA). We apply it to multi-input multi-output (MIMO) systems with orthogonal frequency division multiplexing (OFDM) transmission and least squares (LS) channel estimation. The OTA experiments in an outdoor environment demonstrate that QA-aided MUD can successfully detect transmitted signals from eight user equipments.

DOI
10.1109/ccnc65079.2026.11366386

Related papers

Quantum-Annealing-Aided Multi-User Detection in Overloaded MIMO-OFDM Systems

Kouki Yonaga, Kenichi Takizawa

We present performance evaluation of quantum-annealing-aided multi-user detection (QA-aided MUD) in over-loaded and fully loaded multi-input multi-output systems with orthogonal frequency division multiplexing (MIMO-OFDM). QAaided MUD is a method of iterative multi-user detection (MUD) accelerated by using QA. We previously applied this method to single-input single-output (SISO) single-carrier non-orthogonal multiple access (SC-NOMA) and demonstrated that it achieves error rate and convergence performance comparable to the conventional iterative MUD based on the MAP algorithm. In this study, we have newly developed QA-aided MUD for MIMO-OFDM and conducted performance evaluation under the 3GPP UMa channel model by employing the D-Wave qquantum annealer and other digital annealing techniques. The evaluation results show that the block error rate (BLER) obtained by QA-aided MUD outperforms that of conventional low-complexity MUDs, particularly in overloaded scenarios. It is also observed that the annealing parameters significantly impact BLER in some conditions. Additionally, we present bit error rate (BER) analysis using a few instances, employing both the D-Wave quantum annealer and other digital annealing techniques. The results demonstrate that QA-aided MUD with each annealing technique avoids the error floor and can achieve error-free performance. Finally, we discuss future perspectives by evaluating the computational complexity and computation time of QA-aided MUD.

IEEE Vehicular Technology Conference•Jun 17, 2025•2 citations

Extending Quantum-Annealing-Aided Multi-User Detection to QAM Signals

Kouki Yonaga, Soma Hayabe, Kenichi Takizawa

This study presents a quantum-annealing-aided multi-user detection (QA-aided MUD) framework for quadrature amplitude modulation (QAM) signals and evaluates its performance. The proposed approach approximates log-likelihood ratios (LLRs) using quantum annealing, enabling accurate detection without exhaustive computation. Previous studies have primarily focused on quadrature phase shift keying (QPSK) modulation and have shown that QA-aided MUD can outperform conventional low-complexity detectors, particularly in overloaded multi-user multi-input multi-output (MU-MIMO) systems in uplink. In this study, we extend the QA-aided MUD framework to support QAM modulation by constructing a binary-variable formulation and incorporating a bit-level conversion scheme to handle Gray-coded constellations. For performance evaluation, block error rate (BLER) analysis is conducted using a digital annealing, while small-scale bit error rate (BER) analysis is performed using the D-Wave quantum annealer. The results demonstrate competitive, and often superior, BLER performance compared with conventional low-complexity detectors, particularly in overloaded scenarios. However, the detection performance becomes increasingly sensitive to annealing parameters as the modulation order increases. Furthermore, BER analysis indicates that the current D-Wave hardware may fail to reliably detect QAM symbols in some large problem instances. Based on these findings, future challenges for QA-aided MUD are discussed.

IEEE International Mediterranean Conference on Communications and Networking (MeditCom)•Jul 1, 2026•0 citations

Quantum Annealing-Aided Multi-User Detection: An Application to Uplink Non-Orthogonal Multiple Access

Kouki Yonaga, Kenichi Takizawa

A new method to realize computation of the log-likelihood ratio (LLR) in multi-user detection (MUD) by quantum annealing (QA) is proposed herein. One metaheuristic algorithm for solving combinatorial optimization problems is QA. Recently, QA has been applied in various fields to hasten computations. This study specifically examines the application of QA in up-link non-orthogonal multiple access (UL-NOMA) that employs iterative MUD. Our proposed method, QA-aided MUD, uses QA to calculate LLR in iterative MUD. We tested QA-aided MUD with a D-Wave quantum annealer. The error rate analysis demonstrates that QA-aided MUD has comparable performance to that of conventional MUD method. Furthermore, when the annealing time was set to 20 µs, we demonstrated than that the total computation time is 1/10 of the computation time necessary when using a digital computer. We also evaluated the convergence behavior of QA-aided MUD through evolution of mutual information. The results indicate that QA-assisted MUD has almost identical convergence performance to that of the conventional MUD method for LLR calculations.

International Conference on Communications•May 28, 2023•9 citations

Quantum-assisted multi-user wireless systems

Panagiotis Botsinis

The high complexity of numerous optimal classical communication schemes, such as the Maximum Likelihood (ML) and Maximum A posteriori Probability (MAP) Multi-User Detector (MUD) designed for coherent detection or the ML and MAP Multiple-Symbol Differential Detectors (MSDD) conceived for non-coherent receivers often prevents their practical implementation. In this thesis we commence with a review and tutorial on Quantum Search Algorithms (QSA) and propose a number of hard-output and iterative Quantum-assisted MUDs (QMUD) and MSDDs (QMSDD). We employ a QSA, termed as the Durr-Hyer Algorithm (DHA) that finds the minimum of a function in order to perform near-optimal detection with quadratic reduction in the computational complexity, when compared to that of the ML MUD / MSDD. Two further techniques conceived for reducing the complexity of the DHA-based Quantum-assisted MUD (QMUD) are also proposed. These novel QMUDs / QMSDDs are employed in the uplink of various multiple access systems, such as Direct Sequence Code Division Multiple Access systems, Space Division Multiple Access systems as well as in Direct-Sequence Spreading and Slow Subcarrier Hopping SDMA systems amalgamated with Orthogonal Frequency Division Multiplexing and Interleave Division Multiple Access systems. Furthermore, we follow a quantum approach to achieve the same performance as the optimal Soft Input Soft-Output (SISO) classical detectors by replacing them with a quantum algorithm, which estimates the weighted sum of all the evaluations of a function. We propose a SISO QMUD / QMSDD scheme, which is the quantum-domain equivalent of the MAP MUD / MSDD. Both our EXtrinsic Information Transfer (EXIT) charts and Bit Error Ratio (BER) curves show that the computational complexity of the proposed QMUD / QMSDD is significantly lower than that of the MAP MUD / MSDD, whilst their performance remains equivalent. Moreover, we propose two additional families of iterative DHA-based QMUD / QMSDDs for performing near-optimal MAP detection exhibiting an even lower tunable complexity than the QWSA QMUD. Several variations of the proposed QMUD / QMSDDs have been developed and they are shown to perform better than the state-of-the-art low-complexity MUDs / MSDDs at a given complexity. Their iterative decoding performance is investigated with the aid of non-Gaussian EXIT charts.

•Mar 1, 2015•0 citations

Low-complexity iterative quantum multi-user detection in SDMA systems

Panagiotis Botsinis, Soon Xin Ng, Lajos Hanzo

The potentially excessive complexity of the Maximum Likelihood Multi-User Detector (ML MUD) in large-scale Spatial Division Multiple Access (SDMA) systems dictates the employment of low-complexity sub-optimal MUDs in the context of conventional systems. However, this limitation was circumvented by the recently proposed Dürr-Høyer Algorithm (DHA)-aided Quantum Weighted Sum Algorithm (QWSA)-based Quantum Multi-User Detector (QMUD) employed for performing optimal ML iterative detection in SDMA systems. Focusing our attention on the QWSA, we analyse the QMUD and the evolution of the quantum system with the aid of a simple SDMA uplink scenario. We characterize the performance of the DHA-QWSA QMUD advocated, which is capable of matching the performance of the ML MUD both in terms of its EXIT charts and BER curves.

International Conference on Communications•Jun 1, 2014•11 citations

Towards Quantum Annealing for Multi-user NOMA-based Networks

Eldar Gabdulsattarov, Khaled Maaiuf Rabie, Xingwang Li +1 more

Quantum Annealing (QA) uses quantum fluctuations to search for a global minimum of an optimization-type problem faster than classical computer. To meet the demand for future internet traffic and mitigate the spectrum scarcity, this work presents the QA-aided maximum likelihood (ML) decoder for multi-user non-orthogonal multiple access (NOMA) networks as an alternative to the successive interference cancellation (SIC) method. The practical system parameters such as channel randomness and possible transmit power levels are taken into account for all individual signals of all involved users. The brute force (BF) and SIC signal detection methods are taken as benchmarks in the analysis. The QA-assisted ML decoder results in the same BER performance as the BF method outperforming the SIC technique, but the execution of QA takes more time than BF and SIC. The parallelization technique can be a potential aid to fasten the execution process. This will pave the way to fully realize the potential of QA decoders in NOMA systems.

arXiv:2301.03872•IEEE Vehicular Technology Conference•Sep 1, 2022•4 citations
This study presents an over-the-air (OTA) demonstration of quantum-annealing-aided multi-user detection (QA-aided MUD). QA-aided MUD is a quantum–digital hybrid method that combines iterative multi-user detection (MUD) and quantum annealing (QA). We apply it to multi-input multi-output (MIMO) systems with orthogonal frequency division multiplexing (OFDM) transmission and least squares (LS) channel estimation. The OTA experiments in an outdoor environment demonstrate that QA-aided MUD can successfully detect transmitted signals from eight user equipments.
We present performance evaluation of quantum-annealing-aided multi-user detection (QA-aided MUD) in over-loaded and fully loaded multi-input multi-output systems with orthogonal frequency division multiplexing (MIMO-OFDM). QAaided MUD is a method of iterative multi-user detection (MUD) accelerated by using QA. We previously applied this method to single-input single-output (SISO) single-carrier non-orthogonal multiple access (SC-NOMA) and demonstrated that it achieves error rate and convergence performance comparable to the conventional iterative MUD based on the MAP algorithm. In this study, we have newly developed QA-aided MUD for MIMO-OFDM and conducted performance evaluation under the 3GPP UMa channel model by employing the D-Wave qquantum annealer and other digital annealing techniques. The evaluation results show that the block error rate (BLER) obtained by QA-aided MUD outperforms that of conventional low-complexity MUDs, particularly in overloaded scenarios. It is also observed that the annealing parameters significantly impact BLER in some conditions. Additionally, we present bit error rate (BER) analysis using a few instances, employing both the D-Wave quantum annealer and other digital annealing techniques. The results demonstrate that QA-aided MUD with each annealing technique avoids the error floor and can achieve error-free performance. Finally, we discuss future perspectives by evaluating the computational complexity and computation time of QA-aided MUD.
This study presents a quantum-annealing-aided multi-user detection (QA-aided MUD) framework for quadrature amplitude modulation (QAM) signals and evaluates its performance. The proposed approach approximates log-likelihood ratios (LLRs) using quantum annealing, enabling accurate detection without exhaustive computation. Previous studies have primarily focused on quadrature phase shift keying (QPSK) modulation and have shown that QA-aided MUD can outperform conventional low-complexity detectors, particularly in overloaded multi-user multi-input multi-output (MU-MIMO) systems in uplink. In this study, we extend the QA-aided MUD framework to support QAM modulation by constructing a binary-variable formulation and incorporating a bit-level conversion scheme to handle Gray-coded constellations. For performance evaluation, block error rate (BLER) analysis is conducted using a digital annealing, while small-scale bit error rate (BER) analysis is performed using the D-Wave quantum annealer. The results demonstrate competitive, and often superior, BLER performance compared with conventional low-complexity detectors, particularly in overloaded scenarios. However, the detection performance becomes increasingly sensitive to annealing parameters as the modulation order increases. Furthermore, BER analysis indicates that the current D-Wave hardware may fail to reliably detect QAM symbols in some large problem instances. Based on these findings, future challenges for QA-aided MUD are discussed.
A new method to realize computation of the log-likelihood ratio (LLR) in multi-user detection (MUD) by quantum annealing (QA) is proposed herein. One metaheuristic algorithm for solving combinatorial optimization problems is QA. Recently, QA has been applied in various fields to hasten computations. This study specifically examines the application of QA in up-link non-orthogonal multiple access (UL-NOMA) that employs iterative MUD. Our proposed method, QA-aided MUD, uses QA to calculate LLR in iterative MUD. We tested QA-aided MUD with a D-Wave quantum annealer. The error rate analysis demonstrates that QA-aided MUD has comparable performance to that of conventional MUD method. Furthermore, when the annealing time was set to 20 µs, we demonstrated than that the total computation time is 1/10 of the computation time necessary when using a digital computer. We also evaluated the convergence behavior of QA-aided MUD through evolution of mutual information. The results indicate that QA-assisted MUD has almost identical convergence performance to that of the conventional MUD method for LLR calculations.
The high complexity of numerous optimal classical communication schemes, such as the Maximum Likelihood (ML) and Maximum A posteriori Probability (MAP) Multi-User Detector (MUD) designed for coherent detection or the ML and MAP Multiple-Symbol Differential Detectors (MSDD) conceived for non-coherent receivers often prevents their practical implementation. In this thesis we commence with a review and tutorial on Quantum Search Algorithms (QSA) and propose a number of hard-output and iterative Quantum-assisted MUDs (QMUD) and MSDDs (QMSDD). We employ a QSA, termed as the Durr-Hyer Algorithm (DHA) that finds the minimum of a function in order to perform near-optimal detection with quadratic reduction in the computational complexity, when compared to that of the ML MUD / MSDD. Two further techniques conceived for reducing the complexity of the DHA-based Quantum-assisted MUD (QMUD) are also proposed. These novel QMUDs / QMSDDs are employed in the uplink of various multiple access systems, such as Direct Sequence Code Division Multiple Access systems, Space Division Multiple Access systems as well as in Direct-Sequence Spreading and Slow Subcarrier Hopping SDMA systems amalgamated with Orthogonal Frequency Division Multiplexing and Interleave Division Multiple Access systems. Furthermore, we follow a quantum approach to achieve the same performance as the optimal Soft Input Soft-Output (SISO) classical detectors by replacing them with a quantum algorithm, which estimates the weighted sum of all the evaluations of a function. We propose a SISO QMUD / QMSDD scheme, which is the quantum-domain equivalent of the MAP MUD / MSDD. Both our EXtrinsic Information Transfer (EXIT) charts and Bit Error Ratio (BER) curves show that the computational complexity of the proposed QMUD / QMSDD is significantly lower than that of the MAP MUD / MSDD, whilst their performance remains equivalent. Moreover, we propose two additional families of iterative DHA-based QMUD / QMSDDs for performing near-optimal MAP detection exhibiting an even lower tunable complexity than the QWSA QMUD. Several variations of the proposed QMUD / QMSDDs have been developed and they are shown to perform better than the state-of-the-art low-complexity MUDs / MSDDs at a given complexity. Their iterative decoding performance is investigated with the aid of non-Gaussian EXIT charts.
The potentially excessive complexity of the Maximum Likelihood Multi-User Detector (ML MUD) in large-scale Spatial Division Multiple Access (SDMA) systems dictates the employment of low-complexity sub-optimal MUDs in the context of conventional systems. However, this limitation was circumvented by the recently proposed Dürr-Høyer Algorithm (DHA)-aided Quantum Weighted Sum Algorithm (QWSA)-based Quantum Multi-User Detector (QMUD) employed for performing optimal ML iterative detection in SDMA systems. Focusing our attention on the QWSA, we analyse the QMUD and the evolution of the quantum system with the aid of a simple SDMA uplink scenario. We characterize the performance of the DHA-QWSA QMUD advocated, which is capable of matching the performance of the ML MUD both in terms of its EXIT charts and BER curves.
Quantum Annealing (QA) uses quantum fluctuations to search for a global minimum of an optimization-type problem faster than classical computer. To meet the demand for future internet traffic and mitigate the spectrum scarcity, this work presents the QA-aided maximum likelihood (ML) decoder for multi-user non-orthogonal multiple access (NOMA) networks as an alternative to the successive interference cancellation (SIC) method. The practical system parameters such as channel randomness and possible transmit power levels are taken into account for all individual signals of all involved users. The brute force (BF) and SIC signal detection methods are taken as benchmarks in the analysis. The QA-assisted ML decoder results in the same BER performance as the BF method outperforming the SIC technique, but the execution of QA takes more time than BF and SIC. The parallelization technique can be a potential aid to fasten the execution process. This will pave the way to fully realize the potential of QA decoders in NOMA systems.