Quantum Approximate Optimization Algorithm for Maximum Likelihood Detection in Massive MIMO
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866912648693547008 |
|---|---|
| author | Liu, Yuxiang Meng, Fanxu Li, Zetong Yu, Xutao Zhang, Zaichen |
| author_facet | Liu, Yuxiang Meng, Fanxu Li, Zetong Yu, Xutao Zhang, Zaichen |
| contents | In the massive multiple-input and multiple-output (Massive MIMO) systems, the maximum likelihood (ML) detection problem is NP-hard and becoming classically intricate with the number of the transmitting antennas and the symbols increasing. The quantum approximate optimization algorithm (QAOA), a leading candidate algorithm running in the noisy intermediate-scale quantum (NISQ) devices, can show quantum advantage for approximately solving combinatorial optimization problems. In this paper, we propose the QAOA based the maximum likelihood detection solver of binary symbols. In proposed scheme, we first conduct a universal and compact analytical expression for the expectation value of the 1-level QAOA. Second, a bayesian optimization based parameters initialization is presented, which can speedup the convergence of the QAOA to a lower local minimum and improve the probability of measuring the exact solution. Compared to the state-of-the-art QAOA based ML detection algorithm, our scheme have the more universal and compact expectation value expression of the 1-level QAOA, and requires few quantum resources and has the higher probability to obtain the exact solution. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_13350 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quantum Approximate Optimization Algorithm for Maximum Likelihood Detection in Massive MIMO Liu, Yuxiang Meng, Fanxu Li, Zetong Yu, Xutao Zhang, Zaichen Quantum Physics In the massive multiple-input and multiple-output (Massive MIMO) systems, the maximum likelihood (ML) detection problem is NP-hard and becoming classically intricate with the number of the transmitting antennas and the symbols increasing. The quantum approximate optimization algorithm (QAOA), a leading candidate algorithm running in the noisy intermediate-scale quantum (NISQ) devices, can show quantum advantage for approximately solving combinatorial optimization problems. In this paper, we propose the QAOA based the maximum likelihood detection solver of binary symbols. In proposed scheme, we first conduct a universal and compact analytical expression for the expectation value of the 1-level QAOA. Second, a bayesian optimization based parameters initialization is presented, which can speedup the convergence of the QAOA to a lower local minimum and improve the probability of measuring the exact solution. Compared to the state-of-the-art QAOA based ML detection algorithm, our scheme have the more universal and compact expectation value expression of the 1-level QAOA, and requires few quantum resources and has the higher probability to obtain the exact solution. |
| title | Quantum Approximate Optimization Algorithm for Maximum Likelihood Detection in Massive MIMO |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2510.13350 |