Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2510.15935v1

Help | Advanced Search

Computer Science > Emerging Technologies

arXiv:2510.15935v1 (cs)
[Submitted on 7 Oct 2025 ]

Title: Quantum Approximate Optimization Algorithm for MIMO with Quantized b-bit Beamforming

Title: 用于具有量化b位波束成形的MIMO的量子近似优化算法

Authors:Nikos A Mitsiou, Ioannis Krikidis, George K Karagiannidis
Abstract: 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.
Abstract: 多输入多输出(MIMO)对于6G通信至关重要,它提供了改进的频谱效率和可靠性。 然而,传统的全数字设计由于高硬件复杂度和功耗而面临重大挑战。 低比特MIMO架构,例如使用b比特量化相移器的架构,提供了一种成本效益高的替代方案,但在预编码和后编码设计中引入了NP难的组合问题。 本文探讨了量子近似优化算法(QAOA)和交替优化在发射端和接收端解决b比特量化相移器问题的应用。 我们证明了这种量化波束成形问题的结构自然地与混合经典方法如QAOA相契合,因为在波束成形中使用的相移可以直接映射到量子电路中的旋转门。 值得注意的是,本文是首次展示这一理论联系。 随后,给出了b比特情况的哈密顿量推导分析,这可能在不同领域如集成感知与通信以及新兴的量子算法如量子机器学习中具有应用。 此外,研究了一种热启动QAOA方法,以提高计算效率。 数值结果突显了所提出方法在实现比文献中经典优化基准更好的量化波束成形增益方面的有效性。
Subjects: Emerging Technologies (cs.ET) ; Information Theory (cs.IT); Quantum Physics (quant-ph)
Cite as: arXiv:2510.15935 [cs.ET]
  (or arXiv:2510.15935v1 [cs.ET] for this version)
  https://doi.org/10.48550/arXiv.2510.15935
arXiv-issued DOI via DataCite
Related DOI: https://doi.org/10.1109/JSTSP.2025.3615537
DOI(s) linking to related resources

Submission history

From: Nikos Mitsiou A. [view email]
[v1] Tue, 7 Oct 2025 17:53:02 UTC (219 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
cs.ET
< prev   |   next >
new | recent | 2025-10
Change to browse by:
cs
cs.IT
math
math.IT
quant-ph

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号