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

International Conference on Networking and Communications (ICNWC)

Efficient Signal Detection in MIMO-NOMA Systems Using the Quantum Approximate Optimization Algorithm for 6G Wireless Communication

R.Poornima, K. P. Uvarajan, S. Jayachitra, S. Varsha, K. Poovarasi, N. Yuvanesh

Published Apr 6, 2026• 0 citations
Publisher

Abstract

In this research, the goal is to assess the performance and computational efficiency of the Quantum Approximate Optimization Algorithm for signal detection in MIMO-NOMA systems compared with classical detection methods. The deep learning detection framework supported by the Quantum Approximate Optimization Algorithm (QAOA). The Quantum Approximate Optimization Algorithm (QAOA) assistance in the deep learning-based detection system. For this group, the sample size of signal examples considered is 5,000, and the simulations are carried out based on various signal to noise ratios, antenna array, modulations, and channel estimation errors. The bit error rate, accuracy of detection, channel estimation error, complexity, and throughput of the system are evaluated. The output of the simulation showed that, for a given detection performance, the QAOA-assisted deep learning detection framework outperforms other detection methods in terms of 18% lower bit error rate, 14% higher detection accuracy, 12% lower channel estimation error, 10% lower computational complexity, and 16% higher throughput. The result of the experiment suggests that the proposed framework for signal detection using the assistance of the QAOA-based deep learning algorithm is capable of carrying out the detection of the multiple users' signal compared to other signal detection methods in terms of the mentioned criteria.

DOI
10.1109/icnwc68145.2026.11518214

Related papers

Quantum-Based Maximum Likelihood Detection in MIMO-NOMA Systems for 6G Networks

Helen Urgelles, David García‐Roger, José F. Monserrat

As wireless networks advance toward the Sixth Generation (6G), which will support highly heterogeneous scenarios and massive data traffic, conventional computing methods may struggle to meet the immense processing demands in a resource-efficient manner. This paper explores the potential of quantum computing (QC) to address these challenges, specifically by enhancing the efficiency of Maximum-Likelihood detection in Multiple-Input Multiple-Output (MIMO) Non-Orthogonal Multiple Access (NOMA) communication systems, an essential technology anticipated for 6G. The study proposes the use of the Quantum Approximate Optimization Algorithm (QAOA), a variational quantum algorithm known for providing quantum advantages in certain combinatorial optimization problems. While current quantum systems are not yet capable of managing millions of physical qubits or performing high-fidelity, long gate sequences, the results indicate that QAOA is a promising QC approach for radio signal processing tasks. This research provides valuable insights into the potential transformative impact of QC on future wireless networks. This sets the stage for discussions on practical implementation challenges, such as constrained problem sizes and sensitivity to noise, and opens pathways for future research aimed at fully harnessing the potential of QC for 6G and beyond.

Quantum Reports•Oct 22, 2024•10 citations

Maximum Likelihood Detection Based on Warm-start Quantum Optimization Algorithm

Xinlin He, Han Zeng, Xutao Yu

Quantum computing, with its powerful parallel computing capabilities, is considered one of the promising candidates for solving complex communication problems. This paper proposes a new detection scheme by combining quantum approximation optimization algorithms (QAOA) with maximum likelihood (ML) detection. The scheme addresses the computational complexity problem faced by ML detection in large-scale multiple-input multiple-output (MIMO) channels. The primary focus lies in the warm-start optimization based on the QAOA-ML detection. We use semi-definite relaxation (SDR) to calculate the temporary solution of ML for initializing quantum circuits. The feasibility of the scheme is verified through simulation. The proposed detection scheme is evaluated and compared with classical computer-based ML detection and Minimum Mean Square Error (MMSE) detection, demonstrating similar bit error rate (BER) performance. The enormous potential of quantum algorithms in computing power solving the drawbacks of traditional ML detection algorithms provides new possibilities for improving detection efficiency.

Information Communication Technologies Conference (ICTC)•May 10, 2024•2 citations

Warm-Start Quantum Approximate Optimization Algorithm for QAM MIMO Data Detection

Soumyadip Paul, Sourav Banerjee, Debanjan Bhowmik +1 more

Data detection in large-scale multiple-input multiple-output (MIMO) systems with higher-order quadrature amplitude modulation (QAM) remains a challenging problem due to the exponential complexity of the classical maximum likelihood (ML) detector. This challenge is further amplified by Gray-coded modulation, which introduces nonlinear symbol-to-bit mappings and transforms the problem into a higher-order unconstrained binary optimization (HUBO) formulation. To address this problem, this paper presents a hybrid quantum-classical detection framework that leverages a warm-start linear-ramp Quantum Approximate Optimization Algorithm (WSLR-QAOA) for solving the resulting HUBO problem. A structured warm-start based on a low-rank semidefinite relaxation, solved via a block coordinate descent (BCD) method, provides an efficient and high-quality initialization, while a linear ramp parameterization guides the QAOA optimization. Simulation results show that the proposed framework outperforms classical methods in terms of symbol error rate (SER) and converges faster than standard QAOA, while achieving performance close to the optimal ML detector. Furthermore, the WSLR-QAOA algorithm is validated on actual IBM quantum hardware, where it achieves near-ML performance at low SNR and maintains competitive accuracy at higher SNR despite moderate degradation due to hardware noise. This demonstrates the practical potential of the HUBO-based WSLR-QAOA algorithm for large-scale MIMO data detection.

arXiv:2604.18479•Apr 20, 2026•0 citations

Hybrid Quantum-Classical Approaches to Optimize Signal Processing in Massive MIMO Arrays

Shaik Anjimoon, Baswaraju Swathi, Rajeev Sobti +3 more

This paper introduces a pioneering method in the realm of signal processing for Massive Multiple-Input Multiple-Output (MIMO) systems, leveraging the synergistic potential of hybrid quantum-classical computing paradigms. The escalating demand for high data rate communications necessitates the advancement of MIMO technologies. However, the computational complexity associated with signal processing in such systems, especially in scenarios involving large array sizes, presents a significant challenge. This study proposes an innovative framework that integrates quantum computing algorithms with traditional classical methods to address this challenge. The quantum algorithms are specifically designed to expedite matrix operations and optimization tasks that are central to MIMO signal processing, such as channel estimation and precoding. A comparative analysis with purely classical approaches demonstrates a substantial improvement in computational efficiency and latency reduction, while maintaining, and in certain aspects enhancing, the accuracy of signal detection and system throughput. Furthermore, this hybrid approach offers scalability and adaptability to varying channel conditions and system configurations, a crucial feature for next-generation wireless communication systems. The theoretical foundation is complemented by simulation results, showcasing the feasibility and effectiveness of this approach in practical scenarios. This research not only paves the way for advanced signal processing techniques in Massive MIMO systems but also opens new horizons in the application of quantum computing in telecommunications.

International Conference on Communication, Computer Sciences and Engineering (IC3SE)•May 9, 2024•4 citations

Quantum Approximate Optimization Algorithm Based Maximum Likelihood Detection

Jingjing Cui, Yifeng Xiong, Soon Xin Ng +1 more

Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices, where the quantum approximation optimization algorithm (QAOA) constitutes a promising candidate for demonstrating tangible quantum advantages based on NISQ devices. In this paper, we consider the maximum likelihood (ML) detection problem of binary symbols transmitted over a multiple-input and multiple-output (MIMO) channel, where finding the optimal solution is exponentially hard using classical computers. Here, we apply the QAOA for the ML detection by encoding the problem of interest into a level-$p$QAOA circuit having$2p$variational parameters, which can be optimized by classical optimizers. This level-$p$QAOA circuit is constructed by applying the prepared Hamiltonian to our problem and the initial Hamiltonian alternately in$p$consecutive rounds. More explicitly, we first encode the optimal solution of the ML detection problem into the ground state of a problem Hamiltonian. Using the quantum adiabatic evolution technique, we provide both analytical and numerical results for characterizing the evolution of the eigenvalues of the quantum system used for ML detection. Then, for level-1 QAOA circuits, we derive the analytical expressions of the expectation values of the QAOA and discuss the complexity of the QAOA based ML detector. Explicitly, we evaluate the computational complexity of the classical optimizer used and the storage requirement of simulating the QAOA. Finally, we evaluate the bit error rate (BER) of the QAOA based ML detector and compare it both to the classical ML detector and to the classical minimum mean squared error (MMSE) detector, demonstrating that the QAOA based ML detector is capable of approaching the performance of the classical ML detector.

arXiv:2107.05020•IEEE Transactions on Communications•Jun 22, 2022•41 citations

Beyond Binary Encoding: Qudit-Based QAOA Framework for ML Detection in $M$-QAM MIMO Systems

Chiran Siriwardena, Chanula Luckshan, Samiru Gayan +2 more

Maximum likelihood (ML) detection in massive multiple-input multiple-output (MIMO) systems is an NP-hard combinatorial problem whose complexity grows exponentially with the number of transmit antennas and the modulation order. The Quantum Approximate Optimization Algorithm (QAOA) has recently emerged as a promising near-term quantum heuristic for such problems; however, existing qubit-based formulations require $\log_2 M$ qubits per $M$-QAM symbol, inflating both circuit width and depth. In this paper, we propose a qudit-based QAOA framework that encodes each $M$-QAM symbol directly into a pair of $d$-dimensional quantum states, where $d=\sqrt{M}$. We derive a Hermitian cost Hamiltonian via a real-imaginary decomposition of the constellation, and introduce a generalized cyclic-shift mixer that ensures ergodic exploration of the search space without binary encoding. The proposed formulation reduces the number of quantum carriers from $\mathcal{O}(N_t \log_2 M)$ to $\mathcal{O}(N_t)$ and the Hamiltonian interaction complexity from $\mathcal{O}((N_t \log_2 M)^2)$ to $\mathcal{O}(N_t^2)$, while preserving the geometric structure of the constellation. Bit-error-rate (BER) simulations for $2\times 2$ MIMO systems employing 4-QAM and 16-QAM over Rayleigh fading channels, with circuit depth $p=3$, demonstrate that the proposed detector closely approximates the performance of the optimal classical maximum-likelihood (ML) detector, while consistently outperforming the conventional minimum mean square error (MMSE) detector.

arXiv:2610.30925•Oct 22, 2026•0 citations
In this research, the goal is to assess the performance and computational efficiency of the Quantum Approximate Optimization Algorithm for signal detection in MIMO-NOMA systems compared with classical detection methods. The deep learning detection framework supported by the Quantum Approximate Optimization Algorithm (QAOA). The Quantum Approximate Optimization Algorithm (QAOA) assistance in the deep learning-based detection system. For this group, the sample size of signal examples considered is 5,000, and the simulations are carried out based on various signal to noise ratios, antenna array, modulations, and channel estimation errors. The bit error rate, accuracy of detection, channel estimation error, complexity, and throughput of the system are evaluated. The output of the simulation showed that, for a given detection performance, the QAOA-assisted deep learning detection framework outperforms other detection methods in terms of 18% lower bit error rate, 14% higher detection accuracy, 12% lower channel estimation error, 10% lower computational complexity, and 16% higher throughput. The result of the experiment suggests that the proposed framework for signal detection using the assistance of the QAOA-based deep learning algorithm is capable of carrying out the detection of the multiple users' signal compared to other signal detection methods in terms of the mentioned criteria.
As wireless networks advance toward the Sixth Generation (6G), which will support highly heterogeneous scenarios and massive data traffic, conventional computing methods may struggle to meet the immense processing demands in a resource-efficient manner. This paper explores the potential of quantum computing (QC) to address these challenges, specifically by enhancing the efficiency of Maximum-Likelihood detection in Multiple-Input Multiple-Output (MIMO) Non-Orthogonal Multiple Access (NOMA) communication systems, an essential technology anticipated for 6G. The study proposes the use of the Quantum Approximate Optimization Algorithm (QAOA), a variational quantum algorithm known for providing quantum advantages in certain combinatorial optimization problems. While current quantum systems are not yet capable of managing millions of physical qubits or performing high-fidelity, long gate sequences, the results indicate that QAOA is a promising QC approach for radio signal processing tasks. This research provides valuable insights into the potential transformative impact of QC on future wireless networks. This sets the stage for discussions on practical implementation challenges, such as constrained problem sizes and sensitivity to noise, and opens pathways for future research aimed at fully harnessing the potential of QC for 6G and beyond.
Quantum computing, with its powerful parallel computing capabilities, is considered one of the promising candidates for solving complex communication problems. This paper proposes a new detection scheme by combining quantum approximation optimization algorithms (QAOA) with maximum likelihood (ML) detection. The scheme addresses the computational complexity problem faced by ML detection in large-scale multiple-input multiple-output (MIMO) channels. The primary focus lies in the warm-start optimization based on the QAOA-ML detection. We use semi-definite relaxation (SDR) to calculate the temporary solution of ML for initializing quantum circuits. The feasibility of the scheme is verified through simulation. The proposed detection scheme is evaluated and compared with classical computer-based ML detection and Minimum Mean Square Error (MMSE) detection, demonstrating similar bit error rate (BER) performance. The enormous potential of quantum algorithms in computing power solving the drawbacks of traditional ML detection algorithms provides new possibilities for improving detection efficiency.
Data detection in large-scale multiple-input multiple-output (MIMO) systems with higher-order quadrature amplitude modulation (QAM) remains a challenging problem due to the exponential complexity of the classical maximum likelihood (ML) detector. This challenge is further amplified by Gray-coded modulation, which introduces nonlinear symbol-to-bit mappings and transforms the problem into a higher-order unconstrained binary optimization (HUBO) formulation. To address this problem, this paper presents a hybrid quantum-classical detection framework that leverages a warm-start linear-ramp Quantum Approximate Optimization Algorithm (WSLR-QAOA) for solving the resulting HUBO problem. A structured warm-start based on a low-rank semidefinite relaxation, solved via a block coordinate descent (BCD) method, provides an efficient and high-quality initialization, while a linear ramp parameterization guides the QAOA optimization. Simulation results show that the proposed framework outperforms classical methods in terms of symbol error rate (SER) and converges faster than standard QAOA, while achieving performance close to the optimal ML detector. Furthermore, the WSLR-QAOA algorithm is validated on actual IBM quantum hardware, where it achieves near-ML performance at low SNR and maintains competitive accuracy at higher SNR despite moderate degradation due to hardware noise. This demonstrates the practical potential of the HUBO-based WSLR-QAOA algorithm for large-scale MIMO data detection.
This paper introduces a pioneering method in the realm of signal processing for Massive Multiple-Input Multiple-Output (MIMO) systems, leveraging the synergistic potential of hybrid quantum-classical computing paradigms. The escalating demand for high data rate communications necessitates the advancement of MIMO technologies. However, the computational complexity associated with signal processing in such systems, especially in scenarios involving large array sizes, presents a significant challenge. This study proposes an innovative framework that integrates quantum computing algorithms with traditional classical methods to address this challenge. The quantum algorithms are specifically designed to expedite matrix operations and optimization tasks that are central to MIMO signal processing, such as channel estimation and precoding. A comparative analysis with purely classical approaches demonstrates a substantial improvement in computational efficiency and latency reduction, while maintaining, and in certain aspects enhancing, the accuracy of signal detection and system throughput. Furthermore, this hybrid approach offers scalability and adaptability to varying channel conditions and system configurations, a crucial feature for next-generation wireless communication systems. The theoretical foundation is complemented by simulation results, showcasing the feasibility and effectiveness of this approach in practical scenarios. This research not only paves the way for advanced signal processing techniques in Massive MIMO systems but also opens new horizons in the application of quantum computing in telecommunications.
Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices, where the quantum approximation optimization algorithm (QAOA) constitutes a promising candidate for demonstrating tangible quantum advantages based on NISQ devices. In this paper, we consider the maximum likelihood (ML) detection problem of binary symbols transmitted over a multiple-input and multiple-output (MIMO) channel, where finding the optimal solution is exponentially hard using classical computers. Here, we apply the QAOA for the ML detection by encoding the problem of interest into a level-pppQAOA circuit having2p2p2pvariational parameters, which can be optimized by classical optimizers. This level-pppQAOA circuit is constructed by applying the prepared Hamiltonian to our problem and the initial Hamiltonian alternately inpppconsecutive rounds. More explicitly, we first encode the optimal solution of the ML detection problem into the ground state of a problem Hamiltonian. Using the quantum adiabatic evolution technique, we provide both analytical and numerical results for characterizing the evolution of the eigenvalues of the quantum system used for ML detection. Then, for level-1 QAOA circuits, we derive the analytical expressions of the expectation values of the QAOA and discuss the complexity of the QAOA based ML detector. Explicitly, we evaluate the computational complexity of the classical optimizer used and the storage requirement of simulating the QAOA. Finally, we evaluate the bit error rate (BER) of the QAOA based ML detector and compare it both to the classical ML detector and to the classical minimum mean squared error (MMSE) detector, demonstrating that the QAOA based ML detector is capable of approaching the performance of the classical ML detector.
Beyond Binary Encoding: Qudit-Based QAOA Framework for ML Detection in MMM-QAM MIMO Systems
Maximum likelihood (ML) detection in massive multiple-input multiple-output (MIMO) systems is an NP-hard combinatorial problem whose complexity grows exponentially with the number of transmit antennas and the modulation order. The Quantum Approximate Optimization Algorithm (QAOA) has recently emerged as a promising near-term quantum heuristic for such problems; however, existing qubit-based formulations require log⁡2M\log_2 Mlog2​M qubits per MMM-QAM symbol, inflating both circuit width and depth. In this paper, we propose a qudit-based QAOA framework that encodes each MMM-QAM symbol directly into a pair of ddd-dimensional quantum states, where d=Md=\sqrt{M}d=M​. We derive a Hermitian cost Hamiltonian via a real-imaginary decomposition of the constellation, and introduce a generalized cyclic-shift mixer that ensures ergodic exploration of the search space without binary encoding. The proposed formulation reduces the number of quantum carriers from O(Ntlog⁡2M)\mathcal{O}(N_t \log_2 M)O(Nt​log2​M) to O(Nt)\mathcal{O}(N_t)O(Nt​) and the Hamiltonian interaction complexity from O((Ntlog⁡2M)2)\mathcal{O}((N_t \log_2 M)^2)O((Nt​log2​M)2) to O(Nt2)\mathcal{O}(N_t^2)O(Nt2​), while preserving the geometric structure of the constellation. Bit-error-rate (BER) simulations for 2×22\times 22×2 MIMO systems employing 4-QAM and 16-QAM over Rayleigh fading channels, with circuit depth p=3p=3p=3, demonstrate that the proposed detector closely approximates the performance of the optimal classical maximum-likelihood (ML) detector, while consistently outperforming the conventional minimum mean square error (MMSE) detector.