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

IEEE Wireless Communications and Networking Conference Workshops (WCNCW)

Hybrid Quantum-Classical Resource Slicing for eMBB and URLLC in O-RAN

Srikanta Dash, Keshav Singh, Sudip Biswas

Published Apr 13, 2026• 0 citations
Publisher

Abstract

Open radio access networks (O-RAN) enable flexible orchestration of heterogeneous services such as enhanced mobile broadband (eMBB) and ultra-reliable low-latency communication (URLLC), but jointly satisfying their conflicting throughput and latency requirements leads to a highly combinatorial resource allocation problem. In this paper, we propose a hybrid quantum-classical optimization framework for dynamic O-RAN resource slicing, leveraging the quantum approximate optimization algorithm (QAOA) to jointly optimize radio resource block assignment, punctured scheduling, and power allocation in multi-O-RU networks. The proposed framework integrates orthogonal and shared slicing through a quantumenabled puncturing mechanism that allows URLLC traffic to preempt eMBB transmissions while maintaining overall system efficiency. An adaptive weight normalization strategy driven by real-time queue dynamics balances eMBB throughput maximization and URLLC latency minimization. The resulting constrained optimization problem is mapped to a quantum-executable Hamiltonian and solved using a hybrid QAOA-classical refinement loop compatible with noisy intermediate-scale quantum devices. Simulation results show that the proposed approach outperforms classical optimization baselines, achieving up to 25% higher eMBB throughput, faster convergence, and consistently lower URLLC latency across different power budgets and network densities.

DOI
10.1109/wcncw67598.2026.11555117

Related papers

Open RAN Slicing with Quantum Optimization

Patatchona Keyela, Soumaya Cherkaoui

RAN slicing technology is a key aspect of the Open RAN paradigm, allowing simultaneous and independent provision of various services such as ultra-reliable low-latency communications (URLLC), enhanced mobile broadband (eMBB), and massive machine-type communications (mMTC) through virtual networks that share a single radio access infrastructure. Efficient resource allocation is crucial for RAN slicing, as each service has specific quality of service (QoS) requirements, and a balance between different services must be maintained. Although heuristic and reinforcement learning (RL) techniques have been explored to achieve efficient resource allocation, these approaches face notable limitations: heuristic algorithms face complexity issues that limit their effectiveness in large networks, RL solutions are constrained by their dependency on training data and struggle to adapt to new scenarios and environments. This paper proposes a framework that leverages quantum optimization techniques to optimize radio resource blocks allocation in Open RAN slicing for URLLC and eMBB services. We provide a classical problem formulation and the quantum implementation using the constrained quadratic model on Dwave quantum annealing platform, showcasing the potential of quantum optimization techniques to deliver in real-time optimal solutions for optimization problems in 5G and beyond networks.

arXiv:2502.00142•Global Information Infrastructure and Networking Symposium•Feb 25, 2025•13 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

Hybrid Quantum-Classical Routing for QKD-ON: Leveraging QAOA and QVE for Minimizing Blocking

Sriansh Tripathy, Suman Palrecha, Vimal Bhatia

Resource Allocation in quantum key distribution-enabled optical networks (QKD-ON) is an NP-hard combinatorial problem. Classical heuristics are greedy and suffer high blocking under dynamic traffic and security constraints, while deep reinforcement learning (DRL) methods can reduce blocking but introduce a processing bottleneck because their inference latency is often slower than the operational timescales of QKD-ON. We introduce hybrid quantum–classical frameworks using the quantum approximate optimization algorithm (QAOA) and variational quantum eigensolver (VQE) to perform request routing. The scheduling problem is encoded as a hamiltonian with penalty terms for wavelength and timeslot conflicts. We evaluate the approach on NSFNet and UBN topologies under dynamic traffic with time division multiplexing (TDM) and wavelength-time division multiplexing (WTDM). Our quantum-enhanced algorithms yield comparable or lower blocking with reduced inference latency, which can improve further on quantum hardware.

IEEE Conference on Information and Communication Technology (CICT)•Dec 19, 2025•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

Dynamic Spectrum Allocation, Hybrid Beamforming, and Sub-THz Channel Tracking in 6G Ultra-Dense Networks: A Comparative Microarchitectural Benchmark of Parameterized Variational Quantum Reinforcement Learning (VQRL) versus Deep Q-Networks (DQN)

Kartik Kothalkar

The impending transition to sixth-generation (6G) wireless networks introduces the operational deployment of sub-terahertz and terahertz (sub-THz/THz) frequency bands (0.1 THz to 1.0 THz, specifically the 140 GHz D-Band and 300 GHz transmission windows) to support multi-terabit-per-second (Tbps) data rates and sub-0.1 millisecond Ultra-Reliable Low-Latency Communication (URLLC). However, the physics of THz electromagnetic propagation—characterized by severe atmospheric molecular absorption, extreme free-space path loss, and shadow attenuation from dynamic blockages—demands narrow pencil-beam hybrid beamforming alongside massive Reconfigurable Intelligent Surfaces (RIS). When millions of autonomous vehicles, aerial drones, and mobile devices traverse high-density urban environments, joint real-time spectrum sub-band scheduling, continuous phase-shift tracking, and power allocation induce an NP-hard combinatorial optimization problem scaling exponentially as O(K^N). Classical Deep Reinforcement Learning (DRL) frameworks, such as Deep Q-Networks (DQN) and Soft Actor-Critic (SAC) executing on high-performance host GPUs, suffer from a prohibitive computational inference barrier (requiring 28.5 ms to 74.2 ms per scheduling decision), fundamentally violating the 6G URLLC scheduling budget (<1.0 ms). This paper proposes and rigorously evaluates a Parameterized Variational Quantum Reinforcement Learning (VQRL) framework utilizing quantum state amplitude-phase embedding and parameterized rotation-entanglement quantum circuits (VQC) executed on superconducting NISQ quantum co-processors. By evaluating multi-user allocation policies simultaneously in quantum superposition across a 2^N-dimensional Hilbert space and eliminating multi-cell co-channel interference through inter-tower quantum entanglement, VQRL achieves: • Exponential Latency Reduction: Slashes scheduling execution latency to just 0.078 milliseconds (78 microseconds)—a 365x speedup over GPU-based DQN—comfortably meeting 6G sub-millisecond sub-frame budgets.• Superior Convergence Speed: Achieves a 94.2% reduction in training convergence time (converging within 42 episodes versus 720 episodes for double DQN).• Massive Multi-Terabit Throughput: Delivers an aggregate cell throughput of 1.48 Tbps (a 2.84x improvement over classical DQN baselines) under 3GPP Urban Microcell (UMi) topographies.• High-Mobility Vehicular Beam Tracking: Eliminates 98.6% of vehicular beam-alignment dropouts under 120 km/h mobility through predictive quantum Hamiltonian evolution.• Energy Efficiency: Reduces base station computational energy consumption from 480 Watts to 24 Watts per radio frame. The repository includes the full 31-page primary academic treatise, complete novelty and systems defense dossiers, and full Hindi and Marathi translations.

•May 22, 2023•0 citations

Hybrid Optimization QAOA for Scalable Vehicle Scheduling Problems

Jakub Kołota

Optimization of vehicle-to-station assignments under capacity and distance constraints represents a challenging combinatorial problem relevant to automated planning, logistics, and autonomous mobility systems. Classical methods such as Mixed Integer Linear Programming (MILP) or metaheuristics often struggle to scale efficiently with problem dimensionality, motivating the exploration of hybrid quantum-classical paradigms. This paper presents a normalized Quantum Approximate Optimization Algorithm (QAOA) framework tailored for constrained assignment problems, where vehicle-station distances are encoded into a normalized cost Hamiltonian. Capacity violations and unused resources are incorporated through dynamically scaled penalty terms, producing a cost landscape that effectively guides the quantum search process. The proposed pipeline integrates parameter optimization using COBYLA to refine the QAOA angles, ensuring convergence toward low-cost feasible configurations. Experimental simulations in Cirq on a 10-qubit system demonstrate that the normalized QAOA pipeline consistently identifies near-optimal assignments while substantially reducing the combinatorial search space. These results provide empirical evidence for the viability of hybrid QAOA formulations in real-world planning and scheduling scenarios, establishing a foundation for future implementations on noisy intermediatescale quantum (NISQ) hardware.

International Conference on Smart Applications, Communications and Networking (SmartNets)•Jul 7, 2026•0 citations
Open radio access networks (O-RAN) enable flexible orchestration of heterogeneous services such as enhanced mobile broadband (eMBB) and ultra-reliable low-latency communication (URLLC), but jointly satisfying their conflicting throughput and latency requirements leads to a highly combinatorial resource allocation problem. In this paper, we propose a hybrid quantum-classical optimization framework for dynamic O-RAN resource slicing, leveraging the quantum approximate optimization algorithm (QAOA) to jointly optimize radio resource block assignment, punctured scheduling, and power allocation in multi-O-RU networks. The proposed framework integrates orthogonal and shared slicing through a quantumenabled puncturing mechanism that allows URLLC traffic to preempt eMBB transmissions while maintaining overall system efficiency. An adaptive weight normalization strategy driven by real-time queue dynamics balances eMBB throughput maximization and URLLC latency minimization. The resulting constrained optimization problem is mapped to a quantum-executable Hamiltonian and solved using a hybrid QAOA-classical refinement loop compatible with noisy intermediate-scale quantum devices. Simulation results show that the proposed approach outperforms classical optimization baselines, achieving up to 25% higher eMBB throughput, faster convergence, and consistently lower URLLC latency across different power budgets and network densities.
RAN slicing technology is a key aspect of the Open RAN paradigm, allowing simultaneous and independent provision of various services such as ultra-reliable low-latency communications (URLLC), enhanced mobile broadband (eMBB), and massive machine-type communications (mMTC) through virtual networks that share a single radio access infrastructure. Efficient resource allocation is crucial for RAN slicing, as each service has specific quality of service (QoS) requirements, and a balance between different services must be maintained. Although heuristic and reinforcement learning (RL) techniques have been explored to achieve efficient resource allocation, these approaches face notable limitations: heuristic algorithms face complexity issues that limit their effectiveness in large networks, RL solutions are constrained by their dependency on training data and struggle to adapt to new scenarios and environments. This paper proposes a framework that leverages quantum optimization techniques to optimize radio resource blocks allocation in Open RAN slicing for URLLC and eMBB services. We provide a classical problem formulation and the quantum implementation using the constrained quadratic model on Dwave quantum annealing platform, showcasing the potential of quantum optimization techniques to deliver in real-time optimal solutions for optimization problems in 5G and beyond networks.
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.
Resource Allocation in quantum key distribution-enabled optical networks (QKD-ON) is an NP-hard combinatorial problem. Classical heuristics are greedy and suffer high blocking under dynamic traffic and security constraints, while deep reinforcement learning (DRL) methods can reduce blocking but introduce a processing bottleneck because their inference latency is often slower than the operational timescales of QKD-ON. We introduce hybrid quantum–classical frameworks using the quantum approximate optimization algorithm (QAOA) and variational quantum eigensolver (VQE) to perform request routing. The scheduling problem is encoded as a hamiltonian with penalty terms for wavelength and timeslot conflicts. We evaluate the approach on NSFNet and UBN topologies under dynamic traffic with time division multiplexing (TDM) and wavelength-time division multiplexing (WTDM). Our quantum-enhanced algorithms yield comparable or lower blocking with reduced inference latency, which can improve further on quantum hardware.
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.
The impending transition to sixth-generation (6G) wireless networks introduces the operational deployment of sub-terahertz and terahertz (sub-THz/THz) frequency bands (0.1 THz to 1.0 THz, specifically the 140 GHz D-Band and 300 GHz transmission windows) to support multi-terabit-per-second (Tbps) data rates and sub-0.1 millisecond Ultra-Reliable Low-Latency Communication (URLLC). However, the physics of THz electromagnetic propagation—characterized by severe atmospheric molecular absorption, extreme free-space path loss, and shadow attenuation from dynamic blockages—demands narrow pencil-beam hybrid beamforming alongside massive Reconfigurable Intelligent Surfaces (RIS). When millions of autonomous vehicles, aerial drones, and mobile devices traverse high-density urban environments, joint real-time spectrum sub-band scheduling, continuous phase-shift tracking, and power allocation induce an NP-hard combinatorial optimization problem scaling exponentially as O(K^N). Classical Deep Reinforcement Learning (DRL) frameworks, such as Deep Q-Networks (DQN) and Soft Actor-Critic (SAC) executing on high-performance host GPUs, suffer from a prohibitive computational inference barrier (requiring 28.5 ms to 74.2 ms per scheduling decision), fundamentally violating the 6G URLLC scheduling budget (<1.0 ms). This paper proposes and rigorously evaluates a Parameterized Variational Quantum Reinforcement Learning (VQRL) framework utilizing quantum state amplitude-phase embedding and parameterized rotation-entanglement quantum circuits (VQC) executed on superconducting NISQ quantum co-processors. By evaluating multi-user allocation policies simultaneously in quantum superposition across a 2^N-dimensional Hilbert space and eliminating multi-cell co-channel interference through inter-tower quantum entanglement, VQRL achieves: • Exponential Latency Reduction: Slashes scheduling execution latency to just 0.078 milliseconds (78 microseconds)—a 365x speedup over GPU-based DQN—comfortably meeting 6G sub-millisecond sub-frame budgets.• Superior Convergence Speed: Achieves a 94.2% reduction in training convergence time (converging within 42 episodes versus 720 episodes for double DQN).• Massive Multi-Terabit Throughput: Delivers an aggregate cell throughput of 1.48 Tbps (a 2.84x improvement over classical DQN baselines) under 3GPP Urban Microcell (UMi) topographies.• High-Mobility Vehicular Beam Tracking: Eliminates 98.6% of vehicular beam-alignment dropouts under 120 km/h mobility through predictive quantum Hamiltonian evolution.• Energy Efficiency: Reduces base station computational energy consumption from 480 Watts to 24 Watts per radio frame. The repository includes the full 31-page primary academic treatise, complete novelty and systems defense dossiers, and full Hindi and Marathi translations.
Optimization of vehicle-to-station assignments under capacity and distance constraints represents a challenging combinatorial problem relevant to automated planning, logistics, and autonomous mobility systems. Classical methods such as Mixed Integer Linear Programming (MILP) or metaheuristics often struggle to scale efficiently with problem dimensionality, motivating the exploration of hybrid quantum-classical paradigms. This paper presents a normalized Quantum Approximate Optimization Algorithm (QAOA) framework tailored for constrained assignment problems, where vehicle-station distances are encoded into a normalized cost Hamiltonian. Capacity violations and unused resources are incorporated through dynamically scaled penalty terms, producing a cost landscape that effectively guides the quantum search process. The proposed pipeline integrates parameter optimization using COBYLA to refine the QAOA angles, ensuring convergence toward low-cost feasible configurations. Experimental simulations in Cirq on a 10-qubit system demonstrate that the normalized QAOA pipeline consistently identifies near-optimal assignments while substantially reducing the combinatorial search space. These results provide empirical evidence for the viability of hybrid QAOA formulations in real-world planning and scheduling scenarios, establishing a foundation for future implementations on noisy intermediatescale quantum (NISQ) hardware.