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

Globecom

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

Naman Jain, Soumya Sankar Mitra, Aryan Kaushik, Charalampos C. Tsimenidis, Shahid Mumtaz, Sudip Biswas

Published Dec 8, 2025• 2 citations
Publisher

Abstract

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.

DOI
10.1109/globecom59602.2025.11432534

Related papers

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

Differentiable Optimization of Quantum Circuits

Jincheng Zhang

This paper introduces a novel approach to optimizing quantum circuits by directly calculating and applying gradients. Traditional quantum algorithm optimization relies heavily on simulating the quantum circuit on classical computers, which is computationally expensive and limits the scalability of these algorithms. Our work proposes a framework for differentiable quantum circuit optimization, treating quantum circuits as differentiable functions and employing gradient-based optimization techniques. We outline a methodology for computing gradients of the expectation values of quantum circuits with respect to their adjustable parameters. This allows for the direct optimization of quantum circuits using algorithms such as gradient descent, potentially leading to significant improvements in the efficiency and accuracy of quantum algorithms. The core contribution lies in providing a mathematically rigorous foundation for this differentiable approach, paving the way for automated quantum algorithm design and enhancement. The presented method offers a viable alternative to classical simulation, addressing a key bottleneck in the practical implementation of quantum algorithms.

•Sep 3, 2026•0 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

Topology-Aware Quantum Graph Neural Networks for Sum-Rate Maximization in Fluid Antenna Systems

Okzata Recy, Bhaskara Narottama, Trung Q. Duong

This paper presents a quantum graph-based solution that leverages a quantum circuit to improve learning efficiency, towards maximizing the sum-rate of wireless communication with fluid antennas in dynamic environments. The employed quantum graph neural networks (QGNN) consists of three main blocks, including (i) a quantum encoding layer, (ii) a quantum graph neural network layer, and (iii) an optimizer layer, which collectively comprise the end-to-end learning workflow. The QGNN adjusts parameters through a quantum graph neural network layer, utilizing basic linear gates on a parameterized quantum circuit (PQC) platform. Additionally, the QGNN circuit is designed with shallow depth and optimized gate composition to reduce quantum resource usage and accelerate convergence during training. The results demonstrate that the proposed QGNN offers competitive performance relative to the existing PQC model. Furthermore, this paper highlights the versatility of quantum graph-based solutions for addressing dynamic, topology-aware wireless network problems.

IEEE Communications Letters•Jan 1, 2026•1 citation

Quantum‐Driven Optimization in UAV‐Assisted RIS Networks: A Comprehensive Framework for Maximizing Quantum‐Enhanced Signal Reconfiguration Efficiency

Mustafizur Rahman, Mohammed Ali Yaseen, Anum Shafiq +2 more

ABSTRACT This research presents a novel quantum‐assisted optimization framework for unmanned aerial vehicle‐assisted reconfigurable intelligent surface networks. It introduces a breakthrough metric known as quantum signal reconfiguration dynamics. Utilizing the principles of quantum computing, this framework enables real‐time signal propagation, optimizes resource usage, and reduces energy consumption in dynamic and complex scenarios. The integration of quantum algorithms significantly improves signal reconfiguration by allowing the resource allocator to coordinate control over reconfigurable intelligent surface elements effectively and make real‐time adjustments. This leads to enhanced signal strength, reduced interference, and lower overall energy consumption, minimizing the power requirements of the system. The framework employs optimization methods based on quantum computing, including the quantum approximate optimization algorithm and the variational quantum eigensolver, which can be adapted to the current network conditions. Stress‐testing using a computationally optimized fixed‐point algorithm demonstrates a threefold increase in signal reconfiguration dynamics, a fortyfold reduction in computational latency, and a 25% increase in coverage area compared to classical methods. These results represent significant progress in integrating reconfigurable intelligent surfaces with unmanned aerial vehicle‐assisted wireless communication networks. The proposed framework establishes a foundation for introducing much‐needed improvements to future communication architectures, particularly for sixth‐generation networks and beyond, promoting the development of intelligent and efficient communication systems.

International Journal of Communication Systems•Aug 13, 2025•3 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
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 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 introduces a novel approach to optimizing quantum circuits by directly calculating and applying gradients. Traditional quantum algorithm optimization relies heavily on simulating the quantum circuit on classical computers, which is computationally expensive and limits the scalability of these algorithms. Our work proposes a framework for differentiable quantum circuit optimization, treating quantum circuits as differentiable functions and employing gradient-based optimization techniques. We outline a methodology for computing gradients of the expectation values of quantum circuits with respect to their adjustable parameters. This allows for the direct optimization of quantum circuits using algorithms such as gradient descent, potentially leading to significant improvements in the efficiency and accuracy of quantum algorithms. The core contribution lies in providing a mathematically rigorous foundation for this differentiable approach, paving the way for automated quantum algorithm design and enhancement. The presented method offers a viable alternative to classical simulation, addressing a key bottleneck in the practical implementation of quantum algorithms.
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.
This paper presents a quantum graph-based solution that leverages a quantum circuit to improve learning efficiency, towards maximizing the sum-rate of wireless communication with fluid antennas in dynamic environments. The employed quantum graph neural networks (QGNN) consists of three main blocks, including (i) a quantum encoding layer, (ii) a quantum graph neural network layer, and (iii) an optimizer layer, which collectively comprise the end-to-end learning workflow. The QGNN adjusts parameters through a quantum graph neural network layer, utilizing basic linear gates on a parameterized quantum circuit (PQC) platform. Additionally, the QGNN circuit is designed with shallow depth and optimized gate composition to reduce quantum resource usage and accelerate convergence during training. The results demonstrate that the proposed QGNN offers competitive performance relative to the existing PQC model. Furthermore, this paper highlights the versatility of quantum graph-based solutions for addressing dynamic, topology-aware wireless network problems.
ABSTRACT This research presents a novel quantum‐assisted optimization framework for unmanned aerial vehicle‐assisted reconfigurable intelligent surface networks. It introduces a breakthrough metric known as quantum signal reconfiguration dynamics. Utilizing the principles of quantum computing, this framework enables real‐time signal propagation, optimizes resource usage, and reduces energy consumption in dynamic and complex scenarios. The integration of quantum algorithms significantly improves signal reconfiguration by allowing the resource allocator to coordinate control over reconfigurable intelligent surface elements effectively and make real‐time adjustments. This leads to enhanced signal strength, reduced interference, and lower overall energy consumption, minimizing the power requirements of the system. The framework employs optimization methods based on quantum computing, including the quantum approximate optimization algorithm and the variational quantum eigensolver, which can be adapted to the current network conditions. Stress‐testing using a computationally optimized fixed‐point algorithm demonstrates a threefold increase in signal reconfiguration dynamics, a fortyfold reduction in computational latency, and a 25% increase in coverage area compared to classical methods. These results represent significant progress in integrating reconfigurable intelligent surfaces with unmanned aerial vehicle‐assisted wireless communication networks. The proposed framework establishes a foundation for introducing much‐needed improvements to future communication architectures, particularly for sixth‐generation networks and beyond, promoting the development of intelligent and efficient 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.