Metraipolis › archive › dc_078a107fb67c

QAOA-Based Pilot Assignment for Cell-Free Massive MIMO Systems — arXiv:2609.23657

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.23657
License (as archived)
CC0-1.0
Archived
2026-10-09T22:46:49.923Z
SHA-256 of the archived text
14b2ef7a70b9eaad962e66f9381739a9e186481a79fd39dfaf666475f42c30cd
Stable URL of this page
https://metraipolis.com/documento/dc_078a107fb67c

How to cite

QAOA-Based Pilot Assignment for Cell-Free Massive MIMO Systems — arXiv:2609.23657 — arXiv (en), https://arxiv.org/abs/2609.23657 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_078a107fb67c (Metraipolis archive dc_078a107fb67c, sha256 14b2ef7a70b9eaad962e66f9381739a9e186481a79fd39dfaf666475f42c30cd)
BibTeX
@misc{dc078a107fb67c,
  title = {QAOA-Based Pilot Assignment for Cell-Free Massive MIMO Systems — arXiv:2609.23657},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.23657},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_078a107fb67c; sha256 14b2ef7a70b9eaad962e66f9381739a9e186481a79fd39dfaf666475f42c30cd},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.23657. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Pilot contamination is a major challenge in cell-free massive multiple-input multiple-output (MIMO) systems, where the limited number of orthogonal pilots makes pilot reuse unavoidable. Since the pilot assignment solution space grows exponentially with the number of users, finding the global optimum becomes computationally challenging on classical computers. Recent advances in quantum computing provide a promising approach for solving such large-scale combinatorial optimization problems. In this paper, we reformulate the assignment problem as a quantum-compatible optimization problem, enabling it to be directly solved by the Quantum Approximate Optimization Algorithm (QAOA). Specifically, the pilot contamination objective and assignment constraints are incorporated into the QAOA formulation. This allows the quantum search to focus on valid pilot assignments with low contamination cost. Simulation results show that the proposed method achieves performance close to exhaustive search, demonstrating the potential of quantum-assisted optimization for pilot assignment in future wireless systems.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-22 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.23657 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T22:25:52.413Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).