Quantum Approximate Optimization Algorithm for MIMO with Quantized b-bit Beamforming
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866911218226167808 |
|---|---|
| author | Mitsiou, Nikos A Krikidis, Ioannis Karagiannidis, George K |
| author_facet | Mitsiou, Nikos A Krikidis, Ioannis Karagiannidis, George K |
| contents | Multiple-input multiple-output (MIMO) is critical for 6G communication, offering improved spectral efficiency and reliability. However, conventional fully digital designs face significant challenges due to high hardware complexity and power consumption. Low-bit MIMO architectures, such as those employing b-bit quantized phase shifters, provide a cost-effective alternative but introduce NP-hard combinatorial problems in the pre- and post-coding design. This paper explores the use of the Quantum Approximate Optimization Algorithm (QAOA) and alternating optimization to address the problem of b-bit quantized phase shifters both at the transmitter and the receiver. We demonstrate that the structure of this quantized beamforming problem aligns naturally with hybrid-classical methods like QAOA, as the phase shifts used in beamforming can be directly mapped to rotation gates in a quantum circuit. Notably, this paper is the first to show that theoretical connection. Then, the Hamiltonian derivation analysis for the b-bit case is presented, which could have applications in different fields, such as integrated sensing and communication, and emerging quantum algorithms such as quantum machine learning. In addition, a warm-start QAOA approach is studied which improves computational efficiency. Numerical results highlight the effectiveness of the proposed methods in achieving an improved quantized beamforming gain over their classical optimization benchmarks from the literature. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_15935 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quantum Approximate Optimization Algorithm for MIMO with Quantized b-bit Beamforming Mitsiou, Nikos A Krikidis, Ioannis Karagiannidis, George K Emerging Technologies Information Theory Quantum Physics Multiple-input multiple-output (MIMO) is critical for 6G communication, offering improved spectral efficiency and reliability. However, conventional fully digital designs face significant challenges due to high hardware complexity and power consumption. Low-bit MIMO architectures, such as those employing b-bit quantized phase shifters, provide a cost-effective alternative but introduce NP-hard combinatorial problems in the pre- and post-coding design. This paper explores the use of the Quantum Approximate Optimization Algorithm (QAOA) and alternating optimization to address the problem of b-bit quantized phase shifters both at the transmitter and the receiver. We demonstrate that the structure of this quantized beamforming problem aligns naturally with hybrid-classical methods like QAOA, as the phase shifts used in beamforming can be directly mapped to rotation gates in a quantum circuit. Notably, this paper is the first to show that theoretical connection. Then, the Hamiltonian derivation analysis for the b-bit case is presented, which could have applications in different fields, such as integrated sensing and communication, and emerging quantum algorithms such as quantum machine learning. In addition, a warm-start QAOA approach is studied which improves computational efficiency. Numerical results highlight the effectiveness of the proposed methods in achieving an improved quantized beamforming gain over their classical optimization benchmarks from the literature. |
| title | Quantum Approximate Optimization Algorithm for MIMO with Quantized b-bit Beamforming |
| topic | Emerging Technologies Information Theory Quantum Physics |
| url | https://arxiv.org/abs/2510.15935 |