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

International Conference on Ubiquitous Computing and Communications (IUCC)

Antenna Weights Optimization Based on Filtered Variation Quantum Computing

Bao‐Zhu Guo, Jinge Guo, Yingtao Meng, Yang Zhang, Yu Qiu, Longgang Han, Ruowei Yin

Published Dec 20, 2024• 0 citations
Publisher

Abstract

Operators deploy large-scale array antennas on 5G base stations and set antenna weights to achieve beams with different angles and widths, enhancing 5G network coverage. Traditional antenna weight optimization is based on the user distribution characteristics of the network. Based on the user measurement reports, minimum drive tests, and engineering parameters, the antenna weight optimization determines the relative positions between hotspot areas with centralized user distribution and base station antennas. Then it calculates the antenna weights in the reverse direction. This method can achieve ideal results in optimizing single-cell antenna weights, but it is unsuitable for simultaneous optimization of multiple cells. Information technology is developing rapidly. 5G communication is evolving towards 6G communication, and the growth of network and business scale brings huge challenges to network optimization. Quantum computing is a new computing model that follows the laws of quantum mechanics. It has a computing speed advantage over classical computing and is expected to become a solution to communication network optimization. This paper presents an antenna weight optimization method based on the filter variational quantum matrix solver algorithm. The method utilizes the powerful solution space representation ability of qubits, and it is helpful to obtain better antenna weight optimization results or accelerate the optimization process.

DOI
10.1109/iucc65928.2024.00066

Related papers

User Scheduling and Clustering for Distributed Antenna Network Using Quantum Computing

Keishi Hanakago, Ryo Takahashi, Takahiro Ohyama +1 more

In this study, an overloaded large-scale distributed antenna network is considered, for which the number of active users is larger than that of antennas distributed in a base station coverage area (called a cell). To avoid overload, users in each cell are divided into multiple user groups, and, to reduce the computational complexity required for multi-user multiple-input and multiple-output (MU-MIMO), users in each user group are grouped into multiple user clusters so that cluster-wise distributed MU-MIMO can be performed in parallel in each user group. However, as the network size increases, conventional computational methods may not be able to solve combinatorial optimization problems, such as user scheduling and user clustering, which are required for performing cluster-wise distributed MU-MIMO in a finite amount of time. In this study, we apply quantum computing to solve the combinatorial optimization problems of user scheduling and clustering for an overloaded distributed antenna network and propose a quantum computing-based user scheduling and clustering method. The results of computer simulations indicate that as the technology of quantum computers and their related algorithms evolves in the future, the proposed method can realize large-scale dense wireless systems and realize real-time optimization with a short optimization execution cycle.

IEICE Transactions on Communications•Jul 23, 2023•1 citation

Quantum-Enhanced AI Mechanism for Dynamic Antenna Beam Optimization

B. Ramana Kumar, Nagavalli Vegesna, R. Rajitha Jasmine +3 more

This research presents a quantum augmented AI algorithm for dynamic antenna beam optimization deployment for the next generation wireless network by way of Quantum Deep Reinforcement Learning (QDRL), based on the Google's Cirq quantum computing tool. The proposed system uses Quantum Deep Q-Network (Q-DQN) combined with Quantum Approximate Optimization Algorithm (QAOA that is located into the system's architecture in order to determine the computational complexity of massive MIMO beamforming for 6G network. By leveraging the properties of quantum superposition the system is able to simultaneously think about a range of state-action pairs, which helps it to speed up and reduce the complexity of computations in the training process. The framework incorporates Kalman filtering which is used to predict the channel and patterns of quantum interference are used to converge on near optima combinations of beams. Experimental results show the performance with respect to its spectral efficiency and energy consumption to be better than classical approaches to deep reinforcement learning. The system optimizes beamforming patterns without a trade-off to adaptive wireless coverage by utilizing intelligent reflecting surfaces with faster convergence rate in dynamic and High Dimensional Wireless Environment accompanied with a serious reduction in offline training in order to achieve real-time deployment.

•Sep 1, 2026•0 citations

Quantum-Driven Optimization for Massive MIMO Wireless Communication: Toward 5G Advanced and 6G Spectral Efficiency

Loganathan Balaji, A. Dhanalakshm

Massive multiple-input multiple-output (MIMO) systems are a key enabling technology for 5G-Advanced and emerging 6G networks, yet their performance is fundamentally constrained by high-dimensional, non-convex optimization problems arising from beamforming, power allocation, and user scheduling under imperfect channel state information (CSI).This paper proposes a hybrid quantum-classical optimization framework that formulates discrete and continuous massive MIMO resource allocation problems using Quadratic Unconstrained Binary Optimization (QUBO) and variational quantum algorithms.Discrete beam selection is addressed using quantum annealing, while continuous power control and hybrid beamforming are refined using variational quantum circuits within a classical feedback loop.Simulation results demonstrate improvements in aggregate spectral efficiency, runtime scalability, and robustness under imperfect CSI compared to conventional ZF and WMMSE baselines.The benefits of using the proposed solution include scalable runtime performance with respect to larger numbers of antennas; thus, it highlights the potential of optimizing quantum-assisted technologies for the future of wireless networks based on realistic assumptions regarding near-term NISQ-era performance.

Journal of Engineering Science and Technology Review•Apr 1, 2026•0 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

Hybrid Quantum-Classical Coverage Optimization for User-Centric 6G Movable Antenna Systems

Naman Jain, Sudip Biswas, Charalampos C. Tsimenidis +2 more

This paper proposes QECOGS (Quantum-Enabled Coverage Optimization via Gradient and Swarm), a hybrid quantum-classical framework for user-centric dynamic antenna configuration in next-generation wireless networks. QECOGS jointly optimizes continuous antenna parameters, including azimuth and tilt, using quantum gradients computed via parameterized quantum circuits (PQCs) and the parameter-shift rule, while performing binary base station activation through particle swarm optimization. The proposed design achieves a computational complexity of $\mathcal{O}(2a\log (1/\varepsilon ))$, independent of the number of base stations and spatial sampling points, in contrast to classical binary discrete gradient optimization (BDGO), which scales as $\mathcal{O}\left( {\left( {1/{\varepsilon ^2}} \right)BD{a^2}} \right)$. This quantum-hybrid strategy enables logarithmic precision scaling, accelerated convergence, and improved robustness against local minima in high-dimensional discrete search spaces. Simulation results demonstrate 40-50% fewer iterations in hotspot scenarios, consistent performance under fragmented user distributions, and higher final coverage compared to classical methods. These results establish QECOGS as a scalable and efficient solution for self-organizing wireless networks, with extensions toward multi-cell coordination and hardware-efficient PQC implementations for near-term quantum platforms.

International Conference on Communications•May 24, 2026•0 citations
Operators deploy large-scale array antennas on 5G base stations and set antenna weights to achieve beams with different angles and widths, enhancing 5G network coverage. Traditional antenna weight optimization is based on the user distribution characteristics of the network. Based on the user measurement reports, minimum drive tests, and engineering parameters, the antenna weight optimization determines the relative positions between hotspot areas with centralized user distribution and base station antennas. Then it calculates the antenna weights in the reverse direction. This method can achieve ideal results in optimizing single-cell antenna weights, but it is unsuitable for simultaneous optimization of multiple cells. Information technology is developing rapidly. 5G communication is evolving towards 6G communication, and the growth of network and business scale brings huge challenges to network optimization. Quantum computing is a new computing model that follows the laws of quantum mechanics. It has a computing speed advantage over classical computing and is expected to become a solution to communication network optimization. This paper presents an antenna weight optimization method based on the filter variational quantum matrix solver algorithm. The method utilizes the powerful solution space representation ability of qubits, and it is helpful to obtain better antenna weight optimization results or accelerate the optimization process.
In this study, an overloaded large-scale distributed antenna network is considered, for which the number of active users is larger than that of antennas distributed in a base station coverage area (called a cell). To avoid overload, users in each cell are divided into multiple user groups, and, to reduce the computational complexity required for multi-user multiple-input and multiple-output (MU-MIMO), users in each user group are grouped into multiple user clusters so that cluster-wise distributed MU-MIMO can be performed in parallel in each user group. However, as the network size increases, conventional computational methods may not be able to solve combinatorial optimization problems, such as user scheduling and user clustering, which are required for performing cluster-wise distributed MU-MIMO in a finite amount of time. In this study, we apply quantum computing to solve the combinatorial optimization problems of user scheduling and clustering for an overloaded distributed antenna network and propose a quantum computing-based user scheduling and clustering method. The results of computer simulations indicate that as the technology of quantum computers and their related algorithms evolves in the future, the proposed method can realize large-scale dense wireless systems and realize real-time optimization with a short optimization execution cycle.
This research presents a quantum augmented AI algorithm for dynamic antenna beam optimization deployment for the next generation wireless network by way of Quantum Deep Reinforcement Learning (QDRL), based on the Google's Cirq quantum computing tool. The proposed system uses Quantum Deep Q-Network (Q-DQN) combined with Quantum Approximate Optimization Algorithm (QAOA that is located into the system's architecture in order to determine the computational complexity of massive MIMO beamforming for 6G network. By leveraging the properties of quantum superposition the system is able to simultaneously think about a range of state-action pairs, which helps it to speed up and reduce the complexity of computations in the training process. The framework incorporates Kalman filtering which is used to predict the channel and patterns of quantum interference are used to converge on near optima combinations of beams. Experimental results show the performance with respect to its spectral efficiency and energy consumption to be better than classical approaches to deep reinforcement learning. The system optimizes beamforming patterns without a trade-off to adaptive wireless coverage by utilizing intelligent reflecting surfaces with faster convergence rate in dynamic and High Dimensional Wireless Environment accompanied with a serious reduction in offline training in order to achieve real-time deployment.
Massive multiple-input multiple-output (MIMO) systems are a key enabling technology for 5G-Advanced and emerging 6G networks, yet their performance is fundamentally constrained by high-dimensional, non-convex optimization problems arising from beamforming, power allocation, and user scheduling under imperfect channel state information (CSI).This paper proposes a hybrid quantum-classical optimization framework that formulates discrete and continuous massive MIMO resource allocation problems using Quadratic Unconstrained Binary Optimization (QUBO) and variational quantum algorithms.Discrete beam selection is addressed using quantum annealing, while continuous power control and hybrid beamforming are refined using variational quantum circuits within a classical feedback loop.Simulation results demonstrate improvements in aggregate spectral efficiency, runtime scalability, and robustness under imperfect CSI compared to conventional ZF and WMMSE baselines.The benefits of using the proposed solution include scalable runtime performance with respect to larger numbers of antennas; thus, it highlights the potential of optimizing quantum-assisted technologies for the future of wireless networks based on realistic assumptions regarding near-term NISQ-era performance.
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+.
This paper proposes QECOGS (Quantum-Enabled Coverage Optimization via Gradient and Swarm), a hybrid quantum-classical framework for user-centric dynamic antenna configuration in next-generation wireless networks. QECOGS jointly optimizes continuous antenna parameters, including azimuth and tilt, using quantum gradients computed via parameterized quantum circuits (PQCs) and the parameter-shift rule, while performing binary base station activation through particle swarm optimization. The proposed design achieves a computational complexity of O(2alog⁡(1/ε))\mathcal{O}(2a\log (1/\varepsilon ))O(2alog(1/ε)), independent of the number of base stations and spatial sampling points, in contrast to classical binary discrete gradient optimization (BDGO), which scales as O((1/ε2)BDa2)\mathcal{O}\left( {\left( {1/{\varepsilon ^2}} \right)BD{a^2}} \right)O((1/ε2)BDa2). This quantum-hybrid strategy enables logarithmic precision scaling, accelerated convergence, and improved robustness against local minima in high-dimensional discrete search spaces. Simulation results demonstrate 40-50% fewer iterations in hotspot scenarios, consistent performance under fragmented user distributions, and higher final coverage compared to classical methods. These results establish QECOGS as a scalable and efficient solution for self-organizing wireless networks, with extensions toward multi-cell coordination and hardware-efficient PQC implementations for near-term quantum platforms.