Wireless network coverage optimization is critical for improving service quality. However, optimizing large-scale networks remains challenging for both classical algorithms and quantum methods in the NISQ era. This paper proposes a quantum approach that models the problem as a covering graph, partitions it using a QUBO formulation, and solves subproblems via a filtered variational quantum eigensolver. The method is experimentally validated on real quantum hardware, including a coherent Ising machine and a superconducting quantum processor, and compared with classical methods like SA and PSO. This work introduces a divide-and-conquer strategy for large-scale network coverage optimization and expands the solution landscape.
Wireless network coverage optimization is critical for improving service quality. However, optimizing large-scale networks remains challenging for both classical algorithms and quantum methods in the NISQ era. This paper proposes a quantum approach that models the problem as a covering graph, partitions it using a QUBO formulation, and solves subproblems via a filtered variational quantum eigensolver. The method is experimentally validated on real quantum hardware, including a coherent Ising machine and a superconducting quantum processor, and compared with classical methods like SA and PSO. This work introduces a divide-and-conquer strategy for large-scale network coverage optimization and expands the solution landscape.
Quantum approximate optimization algorithm (QAOA) is a promising hybrid quantum-classical algorithm for solving combinatorial optimization problems. However, it cannot overcome qubit limitation for large-scale problems. Furthermore, the simulation time of QAOA scales poorly with the problem size. We propose a divide-and-conquer QAOA (DC-QAOA) to address the above challenges for graph maximum cut (MaxCut) problem. The algorithm works by recursively partitioning a larger graph into smaller ones whose MaxCut solutions are obtained with small-size noisy intermediate-scale quantum computers. The overall solution is retrieved from the subsolutions by applying the combination policy of measurement distribution reconstruction (MDR). The solution quality depends on the graph partitioning algorithm and MDR policy. Multiple partitioning and reconstruction methods are proposed and compared. Results are evaluated by metrics, such as quantum program runtime, measurement expectation value (EV), and approximation ratio (AR). The results show that DC-QAOA achieves 97.14% AR (20.32% higher than classical counterpart), and 94.79% EV (15.80% higher than quantum annealing). DC-QAOA solves large-scale graph instances with a polynomial rate or returns unsuccessful partition if graph connectivity requirement is not fulfilled otherwise.
Wireless sensor network (WSN) coverage is a central optimization challenge in Internet of Things (IoT) deployments, where sensor mobility must be coordinated to maximize target coverage while limiting movement, redundancy, and resource usage. We formulate mobile placement as a quadratic unconstrained binary optimization (QUBO) problem using geometry-derived candidate actions. The formulation is first validated using the quantum approximate optimization algorithm (QAOA) on a 12-logical-qubit, two-sensor, three-target instance. For larger networks, we propose an adaptive simulated quantum annealing-assisted large-neighborhood search method (Adaptive SQA-LNS). The method identifies difficult target regions, solves reduced QUBO subproblems using path-integral simulated quantum annealing (SQA), a classical simulation of quantum annealing, and improves decoded solutions through constraint repair and local search. The experiments study scaling from 12 logical qubits to approximately 471 logical QUBO variables for the 50-sensor, 100-target benchmark. Networks ranging from 5 sensors and 15 targets to 50 sensors and 100 targets are evaluated using a common multi-objective formulation that incorporates coverage, movement, sensor utilization, redundancy, and connectivity. Across the evaluated instances, Adaptive SQA-LNS matches the constraint-programming reference coverage and achieves the smallest objective gap among the SQA-based approaches. These results provide a reproducible framework for studying quantum-annealing-inspired hybrid optimization for scalable wireless sensor network coverage.
The widespread deployment of 5G networks has drawn growing attention to the optimization of wireless communication systems. Among various techniques, quantum-based approaches are distinguished by their remarkably fast computation time compared to conventional optimization methods. In this paper, we propose a quantum-inspired approach to the wireless resource allocation problem. The problem is formulated as an Ising model and solved using both Coherent Ising Machine (CIM) and D-Wave’s quantum annealer. Furthermore, the performance of these quantum-based methods is compared with that of the Simulated Annealing (SA) algorithm.
Multi-objective combinatorial optimization in wireless communication networks is a challenging task, particularly for large-scale and diverse topologies. Recent advances in quantum computing offer promising solutions for such problems. Coherent Ising Machines (CIM), a quantum-inspired algorithm, leverages quantum properties of coherent light, enabling faster convergence to the ground state. This paper applies CIM to multiobjective routing optimization in wireless multi-hop networks. We formulate the routing problem as a Quadratic Unconstrained Binary Optimization (QUBO) problem, and map it onto an Ising model, allowing CIM to solve it. CIM demonstrates strong scalability across diverse network topologies without requiring topology-specific adjustments, overcoming the limitations of traditional quantum algorithms like Quantum Approximate Optimization Algorithm (QAOA) and Variational Quantum Eigensolver (VQE). Our results show that CIM provides feasible and near-optimal solutions for networks containing hundreds of nodes and thousands of edges. Additionally, a complexity analysis highlights CIM's increasing efficiency as network size grows.
Quantum Optimization (QO) is emerging as a promising approach to tackle hard combinatorial optimization problems by leveraging the unique computational properties of quantum hardware. In recent years, QO has gained traction in Machine Learning (ML), where problems such as clustering and vector quantization can be naturally expressed as Quadratic Unconstrained Binary Optimization (QUBO) problems. These ML applications often involve complex, high-dimensional data, which directly influences both the structure and scale of the resulting QUBO formulations. However, current quantum devices fall under the category of Noisy Intermediate-Scale Quantum (NISQ) hardware, which imposes significant limitations on qubit counts and small error rates. This dissertation investigates the impact of data complexity and data scale—as encountered in ML settings—on the effectiveness and feasibility of QO on NISQ devices. We propose novel, hardware-aware methods to overcome these challenges. The first part of this thesis focuses on the effect of data complexity for QO. We analyze how problem structure—particularly when QUBO formulations are derived from ML tasks—affects quantum solvability. We identify the spectral gap as a key factor in the success of adiabatic quantum algorithms and provide a theoretical and empirical analysis linking data-induced complexity to optimization performance.To address noise sensitivity and limited precision, we introduce a preprocessing framework based on a principled Branch-and-Bound algorithm that reduces dynamic range while preserving global optima. This improves robustness on both quantum annealers and classical solvers. In the second part, the thesis addresses challenges introduced by data scale. First, we propose a recursive Divide-and-Conquer strategy that breaks down large QUBO problems into tractable subproblems, demonstrated through an application to Bundle Adjustment in 3D scene reconstruction. Second, we introduce a variable and constraint generation method inspired by column generation for Integer Linear Programming, enabling dynamic QUBO size growth. This technique is successfully applied to Multi-Agent Pathfinding, where it scales well on NISQ devices while maintaining compatibility with classical solvers. Finally, we explore QUBO reformulations that reduce problem size through compact encodings and cyclic expansion, enabling the use of quantum hardware for tasks such as FPGA placement in chip design. Across all contributions, the developed algorithms are evaluated both theoretically and empirically, with experiments conducted on real quantum and quantum-inspired hardware. These methods significantly improve solution quality, scalability, and hardware compatibility, paving the way for more effective use of QO in practical settings. While tailored for NISQ era constraints, the results remain relevant for fault-tolerant quantum computing, offering insights into the long-term viability of QO across hardware generations.
Optimizing routing in Wireless Sensor Networks (WSNs) is pivotal for minimizing energy consumption and extending network lifetime. This paper introduces a resource-efficient compilation method for distributed quantum circuits tailored to address large-scale WSN routing problems. Leveraging a hybrid classical-quantum framework, we employ spectral clustering for network partitioning and the Quantum Approximate Optimization Algorithm (QAOA) for optimizing routing within manageable subgraphs. We formulate the routing problem as a Quadratic Unconstrained Binary Optimization (QUBO) problem, providing comprehensive mathematical formulations and complexity analyses. Comparative evaluations against traditional classical algorithms demonstrate significant energy savings and enhanced scalability. Our approach underscores the potential of integrating quantum computing techniques into wireless communication networks, offering a scalable and efficient solution for future network optimization challenges.