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

arXiv:2609.23657

QAOA-Based Pilot Assignment for Cell-Free Massive MIMO Systems

Xiaoyu Ma, Fang Fang, Xianbin Wang

quant-phSubmitted Sep 20, 2026• Announced Sep 22, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

AI Summary

The paper studies pilot assignment in cell-free massive MIMO, where users must reuse a limited set of orthogonal pilots. It minimizes a pairwise contamination surrogate, $C(\boldsymbol{\phi})=\sum_{j<k}\rho_{j,k}\mathbb{I}\{\phi_j=\phi_k\}$, with interference weights $\rho_{j,k}=\sum_m\beta_{m,j}\beta_{m,k}$ derived from large-scale fading. The assignment space has size $\tau_p^K$ for $K$ users and $\tau_p$ pilots. The proposed QAOA formulation uses one-hot encoding with $K\tau_p$ qubits. A diagonal cost Hamiltonian encodes the weighted pilot-sharing objective, and an all-pairs XY mixer within each user's register preserves the exactly-one-pilot constraint. Evolution starts from a uniform superposition of feasible assignments. Classical optimization minimizes the expected cost; the lowest-cost assignment among subsequent measurements is returned. Evaluation uses Qiskit's noiseless statevector simulator with 50 access points, three pilots, and $K=4,5,6,7$ users, averaged over 30 network realizations. Parameters are optimized using COBYLA with five random starts and at most 100 iterations, followed by 2,048 samples. At depth $p=3$, the reported sampled solutions approach exhaustive-search optima and modestly outperform greedy assignment. Expected-cost optimality gaps decrease substantially from $p=1$ to $p=2$, with smaller improvements thereafter and larger residual gaps at $K=7$; numerical gap values are not supplied in the text. The stated simulation-cost limitation restricts evaluation to seven users. Scalability improvements, noisy-device evaluation, and hardware validation are left for future work.

Some signs of AI-generated textIncrementalSmall numerics onlyUnclear noveltyMissing comparison

Central claim may not hold: The simulations cover only 81–2,187 feasible assignments under noiseless evolution and do not substantiate the motivating prospect of large-scale optimization. The near-optimality result selects the best of 2,048 QAOA samples without reporting a matched random-sampling baseline, although 2,048 uniform feasible samples would already find an optimum with probability at least 99.64% at the largest tested size. The supplied paper contains neither the referenced plots nor numerical performance results, preventing quantitative verification of its reported closeness to exhaustive search.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Quantum Speedup for Pilot Assignment Problems

Taku Mikuriya, Kengo Ando, Kein Yukiyoshi +3 more

We propose a quantum-assisted solution of the pilot assignment problem. In particular, we formulate a pilot assignment problem designed to minimize the interference from co-pilot user terminals as a binary optimization problem which can be solved via a quantum exhaustive search through the Grover adaptive search (GAS) algorithm. The performance of GAS in terms of query complexity is enhanced by introducing a modified initial state and an improved initial threshold using the upper bound for the minimum value of the objective function. Simulation results demonstrate that our proposed method can provide quadratic speedup compared to an exhaustive search performed by a classical computer, concretely demonstrating that quantum computers can be employed to solve optimally and efficiently the pilot assignment problem.

IEEE Vehicular Technology Conference•Jun 17, 2025•0 citations

Quantum Optimization Algorithm for LEO Satellite Communications based on Cell-Free Massive MIMO

Hayder Al-Hraishawi, Junaid ur Rehman, Symeon Chatzinotas

Low Earth orbit (LEO) satellite constellations are in the spotlight during this pivotal time of developing high-speed communications not only for provisioning non-terrestrial connectivity but also for establishing in-space backhauling solutions. However, the technological evolution in this direction faces many challenges especially in the framework of coexisting with other communication systems due to the spectrum scarcity and the aggregated interference. Recently, the concept of cell-free massive multiple-input multiple-output (MIMO) has been applied to the LEO constellations for ameliorating both energy and spectral efficiencies as well as improving interference mitigation. In this paper, we propose a quantum-based activation strategy for LEO satellites based on user demands using the cell-free massive MIMO communication scheme. Specifically, a binary integer linear optimization problem is formulated and solved using the quantum approximate optimization algorithm (QAOA), which provides tangible quantum advantages through swiftly finding the optimal solutions. The performance of the proposed technique is evaluated via simulations and compared to an adaptive power control scheme. It has been shown that approximately 45%, in average, of the LEO satellite nodes can be switched-off during various traffic load instances. Deactivating the redundant nodes would not only enhance the system energy efficiency but also reduce the computational workload at the constellation and minimize the inter-satellite interference.

IEEE International Conference on Communications workshops•May 28, 2023•17 citations

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•11 citations

QUBO Formulations of the Downlink MIMO Scheduling Problem in 5G Base Stations

Olli Apilo, Jorma Kilpi

Quantum computers can potentially solve large-scale combinatorial problems very efficiently when the problems are first converted into the quadratic unconstrained binary optimization (QUBO) format. Scheduling in fifth generation (5G) base stations is a practical combinatorial problem that cannot be solved optimally in real-time using classical computing. We formulate the downlink (DL) multiple-input multiple-output (MIMO) scheduling at 5G base stations as QUBO and analyze the QUBO formulation scalability with respect to the key system parameters. The single-user MIMO (SU-MIMO) QUBO formulation looks promising because the number of QUBO variables grows linearly while the problem search space grows exponentially with increasing number of users. Based on the simulation results, the suboptimal greedy algorithm for the SU-MIMO performs well with a high number of users and low bandwidth. A hybrid approach, where either a quantum solver or a suboptimal low-complexity classical algorithm is selected based on the system parameters, seems sensible in practice. This work paves the way for future quantum and quantum-inspired implementations of scheduling in cellular systems.

arXiv:2609.18580•Sep 16, 2026•0 citations

Quantum-Enhanced Massive MIMO Beamforming for 6G IoT Networks: A QAOA-Based Optimization Framework

Iqra Batool, Mostafa M. Fouda, Muhammad Ismail +3 more

Massive MIMO beamforming for 6G networks faces a fundamental tradeoff between solution quality and computational complexity. Exhaustive search guarantees optimal antenna selection; however, this becomes prohibitively expensive for arrays exceeding 16 elements, while polynomial-time classical heuristics sacrifice 15–25% performance to achieve practical scalability. This paper introduces a quantum-enhanced optimization framework using the Quantum Approximate Optimization Algorithm (QAOA) to address this challenge for IoT-integrated 6G massive MIMO systems. Our approach combines quantum solution exploration with classical parameter optimization, integrating realistic 3GPP TR 38.901 channel models across 28–60 GHz bands and heterogeneous IoT device characteristics (mMTC, URLLC, eMBB). The framework incorporates an adaptive penalty mechanism that achieves constraint satisfaction within five iterations while maintaining polynomial complexity. Statistical validation across 50 independent channel realizations demonstrates significant advantages: 10–20% spectral efficiency improvement over classical heuristics (p<0.001, Cohen’s d=1.24), 35–42% IoT energy reduction, and 90–95% near-optimal solution quality compared to 65–85% for polynomial-time classical methods. Hardware validation on IBM quantum platforms (127–133 qubits) confirms practical feasibility for medium-scale systems with M≤16 antennas, achieving 89.3% of ideal performance with 22% measurement success rate. Current hardware limitations restrict deployment to proof-of-concept demonstrations, with full-scale 6G implementations requiring quantum error correction projected for 2030+.

IEEE Open Journal of the Communications Society•Dec 17, 2025•15 citations

Quantum Approximate Optimization Algorithm for Maximum Likelihood Detection in Massive MIMO

Yuxiang Liu, Fanxu Meng, Zetong Li +2 more

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 transmitting antennas and 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 on the maximum likelihood detection solver of binary symbols. In the 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 has 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.

arXiv:2510.13350•IEEE Wireless Communications and Networking Conference•Apr 21, 2024•9 citations
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.
The paper studies pilot assignment in cell-free massive MIMO, where users must reuse a limited set of orthogonal pilots. It minimizes a pairwise contamination surrogate, C(ϕ)=∑j<kρj,kI{ϕj=ϕk}C(\boldsymbol{\phi})=\sum_{j<k}\rho_{j,k}\mathbb{I}\{\phi_j=\phi_k\}C(ϕ)=∑j<k​ρj,k​I{ϕj​=ϕk​}, with interference weights ρj,k=∑mβm,jβm,k\rho_{j,k}=\sum_m\beta_{m,j}\beta_{m,k}ρj,k​=∑m​βm,j​βm,k​ derived from large-scale fading. The assignment space has size τpK\tau_p^KτpK​ for KKK users and τp\tau_pτp​ pilots.
The proposed QAOA formulation uses one-hot encoding with KτpK\tau_pKτp​ qubits. A diagonal cost Hamiltonian encodes the weighted pilot-sharing objective, and an all-pairs XY mixer within each user's register preserves the exactly-one-pilot constraint. Evolution starts from a uniform superposition of feasible assignments. Classical optimization minimizes the expected cost; the lowest-cost assignment among subsequent measurements is returned.
Evaluation uses Qiskit's noiseless statevector simulator with 50 access points, three pilots, and K=4,5,6,7K=4,5,6,7K=4,5,6,7 users, averaged over 30 network realizations. Parameters are optimized using COBYLA with five random starts and at most 100 iterations, followed by 2,048 samples. At depth p=3p=3p=3, the reported sampled solutions approach exhaustive-search optima and modestly outperform greedy assignment. Expected-cost optimality gaps decrease substantially from p=1p=1p=1 to p=2p=2p=2, with smaller improvements thereafter and larger residual gaps at K=7K=7K=7; numerical gap values are not supplied in the text.
The stated simulation-cost limitation restricts evaluation to seven users. Scalability improvements, noisy-device evaluation, and hardware validation are left for future work.
We propose a quantum-assisted solution of the pilot assignment problem. In particular, we formulate a pilot assignment problem designed to minimize the interference from co-pilot user terminals as a binary optimization problem which can be solved via a quantum exhaustive search through the Grover adaptive search (GAS) algorithm. The performance of GAS in terms of query complexity is enhanced by introducing a modified initial state and an improved initial threshold using the upper bound for the minimum value of the objective function. Simulation results demonstrate that our proposed method can provide quadratic speedup compared to an exhaustive search performed by a classical computer, concretely demonstrating that quantum computers can be employed to solve optimally and efficiently the pilot assignment problem.
Low Earth orbit (LEO) satellite constellations are in the spotlight during this pivotal time of developing high-speed communications not only for provisioning non-terrestrial connectivity but also for establishing in-space backhauling solutions. However, the technological evolution in this direction faces many challenges especially in the framework of coexisting with other communication systems due to the spectrum scarcity and the aggregated interference. Recently, the concept of cell-free massive multiple-input multiple-output (MIMO) has been applied to the LEO constellations for ameliorating both energy and spectral efficiencies as well as improving interference mitigation. In this paper, we propose a quantum-based activation strategy for LEO satellites based on user demands using the cell-free massive MIMO communication scheme. Specifically, a binary integer linear optimization problem is formulated and solved using the quantum approximate optimization algorithm (QAOA), which provides tangible quantum advantages through swiftly finding the optimal solutions. The performance of the proposed technique is evaluated via simulations and compared to an adaptive power control scheme. It has been shown that approximately 45%, in average, of the LEO satellite nodes can be switched-off during various traffic load instances. Deactivating the redundant nodes would not only enhance the system energy efficiency but also reduce the computational workload at the constellation and minimize the inter-satellite interference.
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 computers can potentially solve large-scale combinatorial problems very efficiently when the problems are first converted into the quadratic unconstrained binary optimization (QUBO) format. Scheduling in fifth generation (5G) base stations is a practical combinatorial problem that cannot be solved optimally in real-time using classical computing. We formulate the downlink (DL) multiple-input multiple-output (MIMO) scheduling at 5G base stations as QUBO and analyze the QUBO formulation scalability with respect to the key system parameters. The single-user MIMO (SU-MIMO) QUBO formulation looks promising because the number of QUBO variables grows linearly while the problem search space grows exponentially with increasing number of users. Based on the simulation results, the suboptimal greedy algorithm for the SU-MIMO performs well with a high number of users and low bandwidth. A hybrid approach, where either a quantum solver or a suboptimal low-complexity classical algorithm is selected based on the system parameters, seems sensible in practice. This work paves the way for future quantum and quantum-inspired implementations of scheduling in cellular systems.
Massive MIMO beamforming for 6G networks faces a fundamental tradeoff between solution quality and computational complexity. Exhaustive search guarantees optimal antenna selection; however, this becomes prohibitively expensive for arrays exceeding 16 elements, while polynomial-time classical heuristics sacrifice 15–25% performance to achieve practical scalability. This paper introduces a quantum-enhanced optimization framework using the Quantum Approximate Optimization Algorithm (QAOA) to address this challenge for IoT-integrated 6G massive MIMO systems. Our approach combines quantum solution exploration with classical parameter optimization, integrating realistic 3GPP TR 38.901 channel models across 28–60 GHz bands and heterogeneous IoT device characteristics (mMTC, URLLC, eMBB). The framework incorporates an adaptive penalty mechanism that achieves constraint satisfaction within five iterations while maintaining polynomial complexity. Statistical validation across 50 independent channel realizations demonstrates significant advantages: 10–20% spectral efficiency improvement over classical heuristics (p<0.001, Cohen’s d=1.24), 35–42% IoT energy reduction, and 90–95% near-optimal solution quality compared to 65–85% for polynomial-time classical methods. Hardware validation on IBM quantum platforms (127–133 qubits) confirms practical feasibility for medium-scale systems with M≤16 antennas, achieving 89.3% of ideal performance with 22% measurement success rate. Current hardware limitations restrict deployment to proof-of-concept demonstrations, with full-scale 6G implementations requiring quantum error correction projected for 2030+.
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 transmitting antennas and 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 on the maximum likelihood detection solver of binary symbols. In the 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 has 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.