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

Energy-Efficient Dynamic Spectrum Allocation for Massive THz IoT Networks Using Quantum Approximate Optimization Algorithm

Iqra Batool, Mostafa M. Fouda, Mohamed I. Ibrahem, Muhammad Ismail, Shikhar Verma, Zubair Md. Fadlullah

Published May 24, 2026• 0 citations
Publisher

Abstract

The exponential growth of IoT devices in 6G networks poses unprecedented challenges for spectrum allocation in energy-constrained THz communications. We present the first application of the Quantum Approximate Optimization Algorithm (QAOA) to energy-efficient spectrum allocation in massive THz IoT networks. Our approach formulates the multi-objective optimization problem as a Quadratic Unconstrained Binary Optimization (QUBO) problem, jointly optimizing spectrum assignment, interference mitigation, and energy consumption. Through comprehensive evaluation with up to 36 qubits (representing 9 IoT devices across 4 THz bands), QAOA demonstrates consistent improvements of 7.1-18.9% over classical methods, including greedy allocation, genetic algorithms, and simulated annealing. Statistical validation with 95% confidence intervals confirms quantum advantage across all performance metrics. The favorable scaling behavior and 15.3% average energy reduction establish QAOA as a viable solution for next-generation 6G networks, positioning quantum computing as an essential enabler for massive IoT deployments.

DOI
10.1109/icc59461.2026.11587626

Related papers

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 computing approach for multi-objective routing and spectrum assignment optimization

Oumayma Bouchmal, Bruno Cimoli, Ripalta Stabile +5 more

Optimization problems are fundamental in a wide range of fields, including telecommunications, where efficient resource allocation is critical to ensure good network performance and high scalability. In the context of elastic optical networks (EONs), the multi-objective routing and spectrum assignment (MO-RSA) problem represents a key challenge, as it involves selecting a valid path and assigning frequency slots while fulfilling continuity and contiguity constraints and optimizing multiple conflicting objectives. This paper presents a novel, to the best of our knowledge, quantum-based approach to solving the MO-RSA problem. We first formulate the MO-RSA problem as a quadratic unconstrained binary optimization (QUBO) problem and then solve it using the quantum approximate optimization algorithm (QAOA). Our method accounts for both minimizing the total number of used links (or any non-negative additive metric) and maximizing the optical signal-to-noise ratio. For our simulations, we employed the Qiskit framework and IBM’s sampler-based quantum backend to implement and test the proposed approach. Our results demonstrate that by encoding the MO-RSA problem into a QUBO model and optimizing it with QAOA, we achieved an approximation ratio of 88% and a computational complexity of O ( n 2 ) , which represents a significant improvement over the exponential complexity of traditional integer linear programming methods.

Journal of Optical Communications and Networking•Mar 17, 2025•7 citations

Quantum Approximate Optimization Algorithm applied to multi-objective routing for large scale 6G networks

Oumayma Bouchmal, Bruno Cimoli, Ripalta Stabile +2 more

A multi-objective optimization problem involves optimizing two or more conflicting objectives simultaneously. This type of problem arises in many scientific and industrial areas and it is classified as NP-Hard. Network routing optimization with multiple objectives falls into this category. In the context of 6G networks, solving this problem will become even more challenging due to the exponential growth of Internet of Things devices and the high quality of service requirements. Finding good quality solutions for large-scale networks will be increasingly difficult. In this paper, we introduce a quantum-inspired routing optimization scheme in which noisy-intermediate scale quantum computers (NISQ) can be used to solve the Multi-Objective Routing Problem (MORP). We evaluate the application of the proposed scheme in detail by first developing the mathematical formulas for both single-objective and multi-objective routing and mapping the problem onto gate-based models by using the quadratic unconstrained binary optimization (QUBO) approach. To validate the proposed scheme, we use the quantum approximate optimization algorithm (QAOA), the go-to approach for solving combinatorial optimization problems that are classically intractable. For the simulation, we use the IBM-Qasm simulator and Qiskit framework. Additionally, we use the Chernoff Bound as a standard technique to estimate the sample complexity of QAOA. Finally, we provide a detailed numerical and theoretical analysis of the proposed scheme, including its time complexity, resource requirements, and the challenges associated with it. Our results demonstrate that the proposed approach operates with a time complexity of O ( E 2 ) per iteration in both single and multi-objective scenarios, with an overall runtime of ( n iteration + n CB ) ⋅ O ( E 2 ) influenced by the sampling overhead, significantly outperforming Dijkstra’s algorithm in the multi-objective case, where the complexity increases to O ( 2 k ( N ( k + log N ) + 2 k E ) ) .

Computer Networks•May 13, 2025•20 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

QUINOA: Quantum-Unified Intelligent Network Orchestration and Automation for 6G Heterogeneous Networks

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

The exponential growth of Internet of Things (IoT) devices and the complexity of sixth-generation (6G) heterogeneous networks create unprecedented challenges in resource optimization and security. This article introduces quantum-unified intelligent network orchestration and automation (QUINOA), a novel framework leveraging quantum computing for 6G-IoT network optimization. The architecture features four layers: a quantum security layer with post-quantum cryptography (PQC), an intelligence layer with autonomous algorithm selection, a programmable layer with specialized quantum modules [including the quantum approximate optimization algorithm (QAOA), quadratic unconstrained binary optimization (QUBO), and variational quantum eigensolver (VQE)], and an interface layer for 6G integration. The framework selects optimal quantum algorithms based on near-real-time problem characteristics at the network-management timescale. On structured problem instances, simulation-based evaluation demonstrates 47% faster convergence in massive multiple-input multiple-output (MIMO) beamforming, 35% improvement in network slicing efficiency, and 52% reduction in interference versus classical methods, with hardware validation on IBM Eagle processors and D-Wave Advantage systems confirming practical quantum advantages for selected structured small instances within current noisy intermediate-scale quantum (NISQ) feasibility limits. These advantages are bounded to$\leq $20 logical qubits for gate-based QAOA/VQE workloads and up to$\sim $100 binary variables for quantum annealing (where each logical variable embeds onto a chain of physical qubits), with gate fidelity$F_{g} \geq 0.95$. Strict-latency ultrareliable low-latency communication (URLLC) traffic is handled by a classical fallback path, while quantum acceleration targets coarser-timescale tasks such as slice reconfiguration and beamforming adaptation, alongside comprehensive quantum security.

IEEE Internet of Things Journal•Jun 23, 2026•0 citations

Quantum-Based Beamforming Optimization for Transmit Power Minimization in MISO Networks

Iqra Hameed, Uman Khalid, Md Habibur Rahman +3 more

Beamforming optimization in 6G networks is essential for ensuring energy-efficient and interference-aware transmission, where ultra-reliable low-latency communication (URLLC) and scalable antenna technologies play a key role. Classical optimization methods face scalability challenges, making real-time beamforming infeasible. This paper applies the quantum approximate optimization algorithm (QAOA) to minimize transmit power while ensuring signal quality constraints. The problem is formulated as a quadratic unconstrained binary optimization (QUBO) and solved using quantum simulation. Simulation results demonstrate that QAOA achieves lower transmit power compared to classical solvers, with faster convergence and improved efficiency. These findings suggest that quantum computing can significantly enhance beamforming optimization, paving the way for its integration into future wireless networks.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Sep 1, 2025•1 citation
The exponential growth of IoT devices in 6G networks poses unprecedented challenges for spectrum allocation in energy-constrained THz communications. We present the first application of the Quantum Approximate Optimization Algorithm (QAOA) to energy-efficient spectrum allocation in massive THz IoT networks. Our approach formulates the multi-objective optimization problem as a Quadratic Unconstrained Binary Optimization (QUBO) problem, jointly optimizing spectrum assignment, interference mitigation, and energy consumption. Through comprehensive evaluation with up to 36 qubits (representing 9 IoT devices across 4 THz bands), QAOA demonstrates consistent improvements of 7.1-18.9% over classical methods, including greedy allocation, genetic algorithms, and simulated annealing. Statistical validation with 95% confidence intervals confirms quantum advantage across all performance metrics. The favorable scaling behavior and 15.3% average energy reduction establish QAOA as a viable solution for next-generation 6G networks, positioning quantum computing as an essential enabler for massive IoT deployments.
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+.
Optimization problems are fundamental in a wide range of fields, including telecommunications, where efficient resource allocation is critical to ensure good network performance and high scalability. In the context of elastic optical networks (EONs), the multi-objective routing and spectrum assignment (MO-RSA) problem represents a key challenge, as it involves selecting a valid path and assigning frequency slots while fulfilling continuity and contiguity constraints and optimizing multiple conflicting objectives. This paper presents a novel, to the best of our knowledge, quantum-based approach to solving the MO-RSA problem. We first formulate the MO-RSA problem as a quadratic unconstrained binary optimization (QUBO) problem and then solve it using the quantum approximate optimization algorithm (QAOA). Our method accounts for both minimizing the total number of used links (or any non-negative additive metric) and maximizing the optical signal-to-noise ratio. For our simulations, we employed the Qiskit framework and IBM’s sampler-based quantum backend to implement and test the proposed approach. Our results demonstrate that by encoding the MO-RSA problem into a QUBO model and optimizing it with QAOA, we achieved an approximation ratio of 88% and a computational complexity of O ( n 2 ) , which represents a significant improvement over the exponential complexity of traditional integer linear programming methods.
A multi-objective optimization problem involves optimizing two or more conflicting objectives simultaneously. This type of problem arises in many scientific and industrial areas and it is classified as NP-Hard. Network routing optimization with multiple objectives falls into this category. In the context of 6G networks, solving this problem will become even more challenging due to the exponential growth of Internet of Things devices and the high quality of service requirements. Finding good quality solutions for large-scale networks will be increasingly difficult. In this paper, we introduce a quantum-inspired routing optimization scheme in which noisy-intermediate scale quantum computers (NISQ) can be used to solve the Multi-Objective Routing Problem (MORP). We evaluate the application of the proposed scheme in detail by first developing the mathematical formulas for both single-objective and multi-objective routing and mapping the problem onto gate-based models by using the quadratic unconstrained binary optimization (QUBO) approach. To validate the proposed scheme, we use the quantum approximate optimization algorithm (QAOA), the go-to approach for solving combinatorial optimization problems that are classically intractable. For the simulation, we use the IBM-Qasm simulator and Qiskit framework. Additionally, we use the Chernoff Bound as a standard technique to estimate the sample complexity of QAOA. Finally, we provide a detailed numerical and theoretical analysis of the proposed scheme, including its time complexity, resource requirements, and the challenges associated with it. Our results demonstrate that the proposed approach operates with a time complexity of O ( E 2 ) per iteration in both single and multi-objective scenarios, with an overall runtime of ( n iteration + n CB ) ⋅ O ( E 2 ) influenced by the sampling overhead, significantly outperforming Dijkstra’s algorithm in the multi-objective case, where the complexity increases to O ( 2 k ( N ( k + log N ) + 2 k E ) ) .
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.
The exponential growth of Internet of Things (IoT) devices and the complexity of sixth-generation (6G) heterogeneous networks create unprecedented challenges in resource optimization and security. This article introduces quantum-unified intelligent network orchestration and automation (QUINOA), a novel framework leveraging quantum computing for 6G-IoT network optimization. The architecture features four layers: a quantum security layer with post-quantum cryptography (PQC), an intelligence layer with autonomous algorithm selection, a programmable layer with specialized quantum modules [including the quantum approximate optimization algorithm (QAOA), quadratic unconstrained binary optimization (QUBO), and variational quantum eigensolver (VQE)], and an interface layer for 6G integration. The framework selects optimal quantum algorithms based on near-real-time problem characteristics at the network-management timescale. On structured problem instances, simulation-based evaluation demonstrates 47% faster convergence in massive multiple-input multiple-output (MIMO) beamforming, 35% improvement in network slicing efficiency, and 52% reduction in interference versus classical methods, with hardware validation on IBM Eagle processors and D-Wave Advantage systems confirming practical quantum advantages for selected structured small instances within current noisy intermediate-scale quantum (NISQ) feasibility limits. These advantages are bounded to$\leq 20logicalqubitsforgate−basedQAOA/VQEworkloadsandupto20 logical qubits for gate-based QAOA/VQE workloads and up to20logicalqubitsforgate−basedQAOA/VQEworkloadsandupto\sim 100binaryvariablesforquantumannealing(whereeachlogicalvariableembedsontoachainofphysicalqubits),withgatefidelity100 binary variables for quantum annealing (where each logical variable embeds onto a chain of physical qubits), with gate fidelity100binaryvariablesforquantumannealing(whereeachlogicalvariableembedsontoachainofphysicalqubits),withgatefidelityF_{g} \geq 0.95$. Strict-latency ultrareliable low-latency communication (URLLC) traffic is handled by a classical fallback path, while quantum acceleration targets coarser-timescale tasks such as slice reconfiguration and beamforming adaptation, alongside comprehensive quantum security.
Beamforming optimization in 6G networks is essential for ensuring energy-efficient and interference-aware transmission, where ultra-reliable low-latency communication (URLLC) and scalable antenna technologies play a key role. Classical optimization methods face scalability challenges, making real-time beamforming infeasible. This paper applies the quantum approximate optimization algorithm (QAOA) to minimize transmit power while ensuring signal quality constraints. The problem is formulated as a quadratic unconstrained binary optimization (QUBO) and solved using quantum simulation. Simulation results demonstrate that QAOA achieves lower transmit power compared to classical solvers, with faster convergence and improved efficiency. These findings suggest that quantum computing can significantly enhance beamforming optimization, paving the way for its integration into future wireless networks.