Quantum repeater networks(QRN) require efficient resource allocation to maintain highentanglement fidelity under noise and interference. We formulate this problem as a physicsinformedquadratic unconstrained binary optimization (QUBO) and solve it using the QuantumApproximate Optimization Algorithm (QAOA). To enable scalability on Noisy Intermediate-Scale Quantum (NISQ) devices, we introduce a cluster-based variant (CLQAOA) that decomposesthe global problem into smaller subproblems. We compare CLQAOA with classicalmethods, including Greedy and Simulated Annealing, and observe that it achieves nearoptimalsolution quality with controlled runtime scaling. We further incorporate RecursiveQAOA (RQAOA), which improves solution quality through iterative variable reduction butincurs higher computational cost. These results demonstrate that hybrid, cluster-basedquantum optimization provides a practical pathway for scalable quantum repeater networkcontrol, balancing solution quality and computational efficiency.
Quantum repeater networks(QRN) require efficient resource allocation to maintain highentanglement fidelity under noise and interference. We formulate this problem as a physicsinformedquadratic unconstrained binary optimization (QUBO) and solve it using the QuantumApproximate Optimization Algorithm (QAOA). To enable scalability on Noisy Intermediate-Scale Quantum (NISQ) devices, we introduce a cluster-based variant (CLQAOA) that decomposesthe global problem into smaller subproblems. We compare CLQAOA with classicalmethods, including Greedy and Simulated Annealing, and observe that it achieves nearoptimalsolution quality with controlled runtime scaling. We further incorporate RecursiveQAOA (RQAOA), which improves solution quality through iterative variable reduction butincurs higher computational cost. These results demonstrate that hybrid, cluster-basedquantum optimization provides a practical pathway for scalable quantum repeater networkcontrol, balancing solution quality and computational efficiency.
Discrete radio resource management problems in dense wireless networks are naturally cast as quadratic unconstrained binary optimization (QUBO) programs but are difficult to solve at scale. We investigate a quantum-classical approach based on the Recursive Quantum Approximate Optimization Algorithm (RQAOA), which interleaves shallow QAOA layers with variable elimination guided by measured single- and two-qubit correlators. For interference-aware channel assignment, we give a compact QUBO/Ising formulation in which pairwise interference induces same-channel couplings and one-hot constraints are enforced via quadratic penalties (or, optionally, constraint-preserving mixers). Within RQAOA, fixing high-confidence variables or relations reduces the problem dimension, stabilizes training, and concentrates measurement effort on a shrinking instance that is solved exactly once below a cutoff. On simulated instances of modest size, including a four-user, four-channel example, the method consistently returns feasible assignments and, for the demonstrated case, attains the global optimum. These results indicate that recursion can mitigate parameter growth and feasibility issues that affect plain QAOA, and suggest a viable pathway for near-term quantum heuristics in wireless resource allocation.
The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical algorithm used to study NP-hard combinatorial optimization problems. In this work, we focused on optimization strategies for QAOA including circuit depth reduction, parameter parallelization, and hybrid classical feedback mechanisms. We will consider the application of QAOA to different types of NP-hard problems such as Max-Cut and Vehicle Routing Problem (VRP) and discuss the advantages and disadvantages of each in terms of approximation quality and cost of computation. The comparative simulation on the various qubit counts and depth layers points out the limits of scalability and the constraints of hardware on the current Noisy Intermediate-Scale Quantum (NISQ) devices. And also an improved divide-and-conquer strategy is presented in which parameter reusability and gradient-informed initialization are combined to boost convergence rates. The results of the experiment show that it is more efficient and scalable while maintaining the competitive approximation performance compared to the baseline QAOA. The experimental validation focuses on representative small-size instances, while the proposed framework provides extensions for scalable implementations. Ultimately, this work is a step towards the realization of efficient, hardware-aware, and scalable optimization strategies, thus opening up the practical deployment of QAOA on the quantum systems of the next few years.
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.
This paper introduces a noise-aware distributed Quantum Approximate Optimization Algorithm (QAOA) tailored for execution on near-term quantum hardware. Leveraging a distributed framework, we address the limitations of current Noisy Intermediate-Scale Quantum (NISQ) devices, which are hindered by limited qubit counts and high error rates. Our approach decomposes large QAOA problems into smaller subproblems, distributing them across multiple Quantum Processing Units (QPUs) to enhance scalability and performance. The noise-aware strategy incorporates error mitigation techniques to optimize qubit fidelity and gate operations, ensuring reliable quantum computations. We evaluate the efficacy of our framework using the HamilToniQ Benchmarking Toolkit, which quantifies the performance across various quantum hardware configurations. The results demonstrate that our distributed QAOA framework achieves significant improvements in computational speed and accuracy, showcasing its potential to solve complex optimization problems efficiently in the NISQ era. This work sets the stage for advanced algorithmic strategies and practical quantum system enhancements, contributing to the broader goal of achieving quantum advantage.
As quantum computing advances, quantum approximate optimization algorithms (QAOA) have shown promise in addressing combinatorial optimization problems. However, the limitations of Noisy Intermediate Scale Quantum (NISQ) devices hinder the scalability of QAOA for large-scale optimization tasks. To overcome these challenges, we propose Backbone-Driven QAOA, a hybrid framework that leverages adaptive Tabu search for classical preprocessing to decompose large-scale quadratic unconstrained binary (QUBO) problems into NISQ-compatible subproblems. In our approach, adaptive Tabu search dynamically identifies and fixes backbone variables to construct reduced-dimensional subspaces that preserve the critical optimization landscape. These quantum-tractable subproblems are then solved via QAOA, with the resulting solutions iteratively refining the backbone selection in a closed-loop quantum-classical cycle. Experimental results demonstrate that our approach not only competes with, and in some cases surpasses, traditional classical algorithms but also performs comparably with recently proposed hybrid classical-quantum algorithms. Our proposed framework effectively orchestrates the allocation of quantum and classical resources, thereby enabling the solution of large-scale combinatorial optimization problems on current NISQ hardware.
Quantum networks (QNs) are a promising platform for secure communications, enhanced sensing, and efficient distributed quantum computing. However, due to the fragile nature of quantum states, these networks face significant challenges in terms of scalability. In this paper, the scaling limits of quantum repeater networks (QRNs) are analyzed. The goal of this work is to maximize the overall length, or scalability of QRNs such that long-distance quantum communications is achieved while application-specific quality-of-service (QoS) requirements are satisfied. In particular, a novel joint optimization framework that aims at maximizing QRN scalability, while satisfyingQoS constraints on the end-to-end fidelity and rate is proposed. The proposed approach optimizes the number of QRN repeater nodes, their separation distance, and the number of distillation rounds to be performed at both link and end-to-end levels. Extensive simulations are conducted to analyze the tradeoffs between QRN scalability, rate, and fidelity under gate and measurement errors. The obtained results characterize the QRN scaling limits for a given QoS requirement. The proposed approach offers a promising solution and design guidelines for future QRN deployments.