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.
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.
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.
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.
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.
• We propose a new hybrid quantum-classical algorithm for solving the UC problem. • The hybrid model successfully optimizes 24-hour UC systems from 10 to 1000 units. • The model outperforms classical metaheuristics (GA and SA) and classical MINLP. • This represents an improvement over previous QCUC methods, a step to real-world use. Resource scheduling is critical in many industries, especially in power systems where the Unit Commitment (UC) problem determines the on/off status and output levels of generators under physical and economic constraints. Traditional exact methods, such as Branch‑and‑Bound, Branch‑and‑Cut, dynamic programming and mixed‑integer linear programming (MILP), remain the backbone of UC solution techniques, but they often rely on linear approximations or exhaustive search, leading to high computational burdens as system size grows. Metaheuristic approaches, such as genetic algorithms, particle swarm optimization, and other evolutionary methods, have been explored to mitigate this complexity; however, they typically lack optimality guarantees, exhibit sensitivity to initial conditions, and can become prohibitively time‑consuming for large‑scale systems. In this paper, we introduce a quantum‑classical hybrid algorithm for UC, and other resource scheduling problems by extension, that leverages Benders decomposition to decouple binary commitment decisions from continuous economic dispatch. The binary “master problem” is formulated as a quadratic unconstrained binary optimization (QUBO) model and solved on a quantum annealer. The continuous “subproblem,” which minimizes generation costs, with Lagrangian cuts feeding back to the master until convergence. We evaluate our hybrid framework on systems scaled from 10 to 1,000 generation units. Compared against a classical mixed‑integer nonlinear programming (MINLP) baseline, the hybrid algorithm achieves a consistently lower computation‑time growth rate and maintains an absolute optimality gap below 1.63%. These results demonstrate that integrating quantum annealing within a hybrid quantum-classical Benders decomposition loop can significantly accelerate large‑scale resource scheduling without sacrificing solution quality, pointing toward a viable path for addressing the escalating complexity of modern power grids.
Low Earth orbit (LEO) satellite constellations are in the spotlight during this pivotal time of developing high-speed communications not only for provisioning non-terrestrial connectivity but also for establishing in-space backhauling solutions. However, the technological evolution in this direction faces many challenges especially in the framework of coexisting with other communication systems due to the spectrum scarcity and the aggregated interference. Recently, the concept of cell-free massive multiple-input multiple-output (MIMO) has been applied to the LEO constellations for ameliorating both energy and spectral efficiencies as well as improving interference mitigation. In this paper, we propose a quantum-based activation strategy for LEO satellites based on user demands using the cell-free massive MIMO communication scheme. Specifically, a binary integer linear optimization problem is formulated and solved using the quantum approximate optimization algorithm (QAOA), which provides tangible quantum advantages through swiftly finding the optimal solutions. The performance of the proposed technique is evaluated via simulations and compared to an adaptive power control scheme. It has been shown that approximately 45%, in average, of the LEO satellite nodes can be switched-off during various traffic load instances. Deactivating the redundant nodes would not only enhance the system energy efficiency but also reduce the computational workload at the constellation and minimize the inter-satellite interference.
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+.