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 Communications

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

Naman Jain, Sudip Biswas, Charalampos C. Tsimenidis, Shahid Mumtaz, Tharmalingam Ratnarajah

Published May 24, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.1109/icc59461.2026.11587637

Related papers

Quantum-Assisted Optimization of Movable Antenna Configurations for Cellular Coverage Enhancement

Naman Jain, Soumya Sankar Mitra, Aryan Kaushik +3 more

This paper proposes a quantum-enabled gradient-based coverage optimization (QEGCO) framework for dynamic antenna configuration in future wireless networks. The optimization task of adjusting antenna azimuth and tilt to maximize soft coverage is formulated using a differentiable surrogate objective, enabling the application of gradient-based methods. A parameterized quantum circuit (PQC) encodes the control variables, and the parameter-shift rule is employed to compute exact gradients efficiently, independent of spatial sampling resolution. Entanglement is introduced via CNOT gates to enhance circuit expressivity and model interactions between antennas. Simulation results demonstrate that QEGCO achieves faster convergence, higher final coverage ratios, and superior computational scalability compared to classical stochastic gradient descent (SGD) and finite gradient descent (FGD) baselines. Complexity analysis highlights that QEGCO reduces computational complexity from ${\mathcal{O}}(2\cdot a\cdot T)$ in classical methods to ${\mathcal{O}}(2\cdot a\cdot\log (T))$, where a is the number of antennas, and T is the total time required for computation of gradients and coverage metrics. These findings illustrate the potential of quantum-assisted optimization techniques for scalable and efficient wireless network self-organization. Future directions include extending QEGCO to cooperative multi-cell networks and implementing hardware-efficient quantum circuits for near-term quantum devices.

Globecom•Dec 8, 2025•2 citations

Antenna Array Beamforming Based on a Hybrid Quantum Optimization Framework

Shuai Zeng

This paper proposes a hybrid quantum optimization framework for large-scale antenna-array beamforming with jointly optimized discrete phases and continuous amplitudes. The method combines quantum-inspired search with classical gradient refinement to handle mixed discrete-continuous variables efficiently. For phase optimization, a Gray-code and odd-combination encoding scheme is introduced to improve robustness and avoid the complexity explosion of higher-order Ising models. For amplitude optimization, a geometric spin-combination encoding and a two-stage strategy are developed, using quantum-inspired optimization for coarse search and gradient optimization for fine refinement. To enhance solution diversity and quality, a rainbow quantum-inspired algorithm integrates multiple optimizers for parallel exploration, followed by hierarchical-clustering-based candidate refinement. In addition, a double outer-product method and an augmented version are proposed to construct the coupling matrix and bias vector efficiently, improving numerical precision and implementation efficiency. Under the scoring rules of the 7th National Quantum Computing Hackathon, simulations on a 32-element antenna array show that the proposed method achieves a score of 461.58 under constraints on near-main-lobe sidelobes, wide-angle sidelobes, beamwidth, and optimization time, nearly doubling the baseline score. The proposed framework provides an effective reference for beamforming optimization in future wireless communication systems.

quant-pharXiv:2603.20072•Mar 23, 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

Antenna Weights Optimization Based on Filtered Variation Quantum Computing

Bao‐Zhu Guo, Jinge Guo, Yingtao Meng +4 more

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.

International Conference on Ubiquitous Computing and Communications (IUCC)•Dec 20, 2024•0 citations

Joint Optimal Beamforming and Discrete Phase Shift Design in STAR-RIS with Quantum Optimization : (Invited Paper)

Vu Phong Pham, Dang Van Huynh, Berk Canberk +2 more

In this paper, we investigate the potential of a near-optimal hybrid quantum-classical optimization approach to jointly optimizing beamforming and discrete phase shifts of the simultaneous transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) assisted wireless network. We first formulate a discrete optimization problem to maximize the total power transmitted to the ground users by optimizing the beamforming at the base station (BS) and STAR-RIS phase shift cells under minimal power allocation for each user and the power budget at the BS. Then, we propose a quantum approximate optimization algorithm with alternating optimization (QAOA-AO) method that iteratively addresses beamform-ing components and discrete phase shifts to search for the near-optimal solutions for the problem. Numerical results validate the effectiveness and robustness of the proposed QAOA-AO compared to the classical benchmarks, and further highlight its potential for practical applicability for solving medium-to-large-scale optimization problems.

2012 International Conference on Computing, Networking and Communications (ICNC)•Feb 16, 2026•0 citations

A Hybrid Quantum-Classical Framework for Power Optimization in CF-mMIMO O-RAN

Srikanta Dash, Keshav Kumar Singh, Fan-Shuo Tseng +2 more

The increasing densification of user equipment (UE) and the adoption of open radio access network (O-RAN) architectures in 6G demand energy-efficient and scalable resource allocation frameworks. Cell-free massive MIMO (CF-mMIMO) systems, while promising improved spectral efficiency (SE), introduce significant computational complexity in jointly optimizing radio units (O-RUs), fronthaul, and general-purpose processors (GPPs). In this work, we propose a hybrid quantum-classical optimization framework based on the quantum approximate optimization algorithm (QAOA) integrated with a constrained optimization by linear approximation (COBYLA)-based classical feedback loop. The optimization problem, comprising O-RU activation, UE association, GPP scheduling, and power control is formulated as a constrained mixed-integer program and mapped into a Hamiltonian suitable for quantum execution. Our framework supports multiple orchestration strategies, including end-to-end, local coordination, and radio-only. Simulation results demonstrate that the proposed method achieves up to 20% energy savings and up to 50% faster convergence compared to classical MILP baselines, even in large-scale CF-mMIMO networks. The algorithm is designed to be NISQ-compatible, making it a viable candidate for real-world near-term deployment.

Globecom•Dec 8, 2025•2 citations
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.
This paper proposes a quantum-enabled gradient-based coverage optimization (QEGCO) framework for dynamic antenna configuration in future wireless networks. The optimization task of adjusting antenna azimuth and tilt to maximize soft coverage is formulated using a differentiable surrogate objective, enabling the application of gradient-based methods. A parameterized quantum circuit (PQC) encodes the control variables, and the parameter-shift rule is employed to compute exact gradients efficiently, independent of spatial sampling resolution. Entanglement is introduced via CNOT gates to enhance circuit expressivity and model interactions between antennas. Simulation results demonstrate that QEGCO achieves faster convergence, higher final coverage ratios, and superior computational scalability compared to classical stochastic gradient descent (SGD) and finite gradient descent (FGD) baselines. Complexity analysis highlights that QEGCO reduces computational complexity from O(2⋅a⋅T){\mathcal{O}}(2\cdot a\cdot T)O(2⋅a⋅T) in classical methods to O(2⋅a⋅log⁡(T)){\mathcal{O}}(2\cdot a\cdot\log (T))O(2⋅a⋅log(T)), where a is the number of antennas, and T is the total time required for computation of gradients and coverage metrics. These findings illustrate the potential of quantum-assisted optimization techniques for scalable and efficient wireless network self-organization. Future directions include extending QEGCO to cooperative multi-cell networks and implementing hardware-efficient quantum circuits for near-term quantum devices.
This paper proposes a hybrid quantum optimization framework for large-scale antenna-array beamforming with jointly optimized discrete phases and continuous amplitudes. The method combines quantum-inspired search with classical gradient refinement to handle mixed discrete-continuous variables efficiently. For phase optimization, a Gray-code and odd-combination encoding scheme is introduced to improve robustness and avoid the complexity explosion of higher-order Ising models. For amplitude optimization, a geometric spin-combination encoding and a two-stage strategy are developed, using quantum-inspired optimization for coarse search and gradient optimization for fine refinement. To enhance solution diversity and quality, a rainbow quantum-inspired algorithm integrates multiple optimizers for parallel exploration, followed by hierarchical-clustering-based candidate refinement. In addition, a double outer-product method and an augmented version are proposed to construct the coupling matrix and bias vector efficiently, improving numerical precision and implementation efficiency. Under the scoring rules of the 7th National Quantum Computing Hackathon, simulations on a 32-element antenna array show that the proposed method achieves a score of 461.58 under constraints on near-main-lobe sidelobes, wide-angle sidelobes, beamwidth, and optimization time, nearly doubling the baseline score. The proposed framework provides an effective reference for beamforming optimization in future wireless communication systems.
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.
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 paper, we investigate the potential of a near-optimal hybrid quantum-classical optimization approach to jointly optimizing beamforming and discrete phase shifts of the simultaneous transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) assisted wireless network. We first formulate a discrete optimization problem to maximize the total power transmitted to the ground users by optimizing the beamforming at the base station (BS) and STAR-RIS phase shift cells under minimal power allocation for each user and the power budget at the BS. Then, we propose a quantum approximate optimization algorithm with alternating optimization (QAOA-AO) method that iteratively addresses beamform-ing components and discrete phase shifts to search for the near-optimal solutions for the problem. Numerical results validate the effectiveness and robustness of the proposed QAOA-AO compared to the classical benchmarks, and further highlight its potential for practical applicability for solving medium-to-large-scale optimization problems.
The increasing densification of user equipment (UE) and the adoption of open radio access network (O-RAN) architectures in 6G demand energy-efficient and scalable resource allocation frameworks. Cell-free massive MIMO (CF-mMIMO) systems, while promising improved spectral efficiency (SE), introduce significant computational complexity in jointly optimizing radio units (O-RUs), fronthaul, and general-purpose processors (GPPs). In this work, we propose a hybrid quantum-classical optimization framework based on the quantum approximate optimization algorithm (QAOA) integrated with a constrained optimization by linear approximation (COBYLA)-based classical feedback loop. The optimization problem, comprising O-RU activation, UE association, GPP scheduling, and power control is formulated as a constrained mixed-integer program and mapped into a Hamiltonian suitable for quantum execution. Our framework supports multiple orchestration strategies, including end-to-end, local coordination, and radio-only. Simulation results demonstrate that the proposed method achieves up to 20% energy savings and up to 50% faster convergence compared to classical MILP baselines, even in large-scale CF-mMIMO networks. The algorithm is designed to be NISQ-compatible, making it a viable candidate for real-world near-term deployment.