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

Proceedings of the AAAI Symposium Series

Adaptive Quantum-Inspired Annealing for Scalable Optimization of Wireless Sensor Network Coverage

Amandeep Singh Bhatia, Mandeep Kaur Saggi

Published Nov 6, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.1609/aaaiss.v10i1.43495

Related papers

Resource-Efficient Compilation of Distributed Quantum Circuits for Solving Large-Scale Wireless Communication Network Problems

Kuan‐Cheng Chen, Felix Burt, Shang Yu +3 more

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.

arXiv:2501.10242•IEEE International Symposium on Circuits and Systems proceedings•May 25, 2025•16 citations

Quantum Annealing for Resource Allocation in Next-Generation Wireless Communication Networks: A QUBO Modeling Guide

Nguyen Xuan Tung, Le Tung Giang, Mai Dinh Cong +4 more

Quantum annealing (QA) offers a physics-inspired approach for such subproblems by mapping them onto an Ising Hamiltonian, which is algebraically equivalent to a Quadratic Unconstrained Binary Optimization (QUBO) model executable on quantum annealers or hybrid solvers. However, their practical employment in wireless systems critically depends on the specific problem formulation, on the particular variable encoding, constraint handling, solver selection, hardware embedding, and fair benchmarking. This paper develops wireless-oriented QUBO modeling guidelines for QA-assisted resource allocation. We first present a beginner-friendly toy example in which a terrestrial-aerial resource-allocation problem with a fractional signal-to-interference-plus-noise ratio (SINR) maximization objective is reformulated into a two-bit QUBO via Boolean interpolation, converted into an Ising representation, and decoded back into a wireless scheduling decision. The same scheduling is applicable to UAV, aircraft, satellite, and terrestrial links in SAGIN systems. We then review the QA foundations and solver ecosystems, including binary quadratic, discrete quadratic, constrained quadratic, and hybrid models from the perspective of NG wireless optimization. Furthermore, we discuss both binary and discrete encoding, penalty-based constraint conversion, embedding overhead, solution decoding, and feasibility verification. A QUBO Compatibility Index is introduced as a lightweight diagnostic metric for assessing the associated QUBO formulation readiness, rather than a predictor of runtime or solution quality. Finally, a case study on max-min uplink power control in cell-free massive MIMO illustrates how a fairness-oriented wireless problem can be discretized, constrained, converted into the concept of a QUBO, and evaluated against classical baselines. A host of key challenges and future directions are also discussed.

arXiv:2610.14126•IEEE Open Journal of the Communications Society•Jan 1, 2026•0 citations

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

Iqra Batool, Mostafa M. Fouda, Mohamed I. Ibrahem +3 more

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.

International Conference on Communications•May 24, 2026•0 citations

Optimizing Multi-Path Routing in Large-Scale Quantum Networks Using Quantum Annealing

Parker Jones, Vini Chaudhary

This paper evaluates quantum annealing as a potential method for solving multi-path routing in large-scale quantum communication networks. The routing problem was formulated as a quadratic unconstrained binary optimization (QUBO) problem that minimizes negative throughput while satisfying quantum network constraints. The experimental framework tests four solution approaches on randomly generated networks: (1) the classical quantum fidelity rate maximizing (Q-FiRM) algorithm, (2) classical simulated annealing, (3) D-Wave hybrid solver, and (4) pure quantum annealing on D-Wave Advantage2 hardware. Results show that while quantum annealers produce feasible solutions, the classical Q-FiRM algorithm achieves superior throughput and faster computation times for this problem class. Among QUBO approaches, hybrid solvers demonstrate computational advantages over pure classical simulated annealing while maintaining comparable solution quality. These findings provide practical insight into the current capabilities and limitations of quantum optimization for quantum internet infrastructure design.

IEEE SoutheastCon•Feb 20, 2026•0 citations

Resource Optimization of SFC Embedding for IoT Networks Using Quantum Computing

Mahzabeen Emu, Salimur Choudhury, Kai Salomaa

Embedding Service Function Chain (SFC) into the massive and resource-hungry Internet of Things (IoT) substrate graph is a critical optimization research problem. Unfortunately, the classical Integer Linear Programming (ILP) formulation for such problems is usually NP-hard. Thus, this research study presses on the need to go beyond the realms and employ Quantum Annealing (QA) to speed up the computation. To comply, we reformulate the SFC embedding problem into IoT graphs as Quadratic Unconstrained Binary Optimization (QUBO) format and propose a hybrid warm start quantum annealing (WSQA) optimization technique. Simulation results show that our proposed WSQA can improve resource utilization, accelerate computing time, and achieve a better scalability success rate at solving large-scale SFC deployment compared to standalone QA. Further along the line, this research inspires the application of quantum optimization for resource allocation in next-generation networks even with the limited availability of qubits.

IEEE International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)•Nov 2, 2022•5 citations

Energy Internet Routing using Quantum Optimization Algorithms

Alireza Alamgir Tehrani, Mehrdad Boroushaki, Abbas Rajabi

The Energy Internet (EI) is a new concept aimed at enhancing the integration of renewable energy sources with the energy grid. Energy-efficient path selection in EI is NP-hard. This research presents an innovative Quadratic Unconstrained Binary Optimization (QUBO) and Ising Hamiltonian formulation for energy routing. The validation and scalability of the proposed formulation were evaluated by applying quantum-inspired annealing and quantum gate optimization to two case studies, a 9-node and a 30-node EI network. A comparative analysis was presented between classical optimization using the Dijkstra algorithm, optimization-based methods, and QAOA using the Qiskit Sampler Primitive, NumpyEigenSolver, and quantum-inspired annealing using the Ocean exact Solver, D-Wave Tabu Sampler, and D-Wave Simulated Annealing. Simulation results based on the proposed formulation agree with the exact solution, while the runtime of classical approaches is less than that of quantum approaches. However, the Simulated Annealing sampler offers the shortest runtime among all quantum methods.

quant-pharXiv:2608.28401•Aug 31, 2026•0 citations
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.
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.
Quantum annealing (QA) offers a physics-inspired approach for such subproblems by mapping them onto an Ising Hamiltonian, which is algebraically equivalent to a Quadratic Unconstrained Binary Optimization (QUBO) model executable on quantum annealers or hybrid solvers. However, their practical employment in wireless systems critically depends on the specific problem formulation, on the particular variable encoding, constraint handling, solver selection, hardware embedding, and fair benchmarking. This paper develops wireless-oriented QUBO modeling guidelines for QA-assisted resource allocation. We first present a beginner-friendly toy example in which a terrestrial-aerial resource-allocation problem with a fractional signal-to-interference-plus-noise ratio (SINR) maximization objective is reformulated into a two-bit QUBO via Boolean interpolation, converted into an Ising representation, and decoded back into a wireless scheduling decision. The same scheduling is applicable to UAV, aircraft, satellite, and terrestrial links in SAGIN systems. We then review the QA foundations and solver ecosystems, including binary quadratic, discrete quadratic, constrained quadratic, and hybrid models from the perspective of NG wireless optimization. Furthermore, we discuss both binary and discrete encoding, penalty-based constraint conversion, embedding overhead, solution decoding, and feasibility verification. A QUBO Compatibility Index is introduced as a lightweight diagnostic metric for assessing the associated QUBO formulation readiness, rather than a predictor of runtime or solution quality. Finally, a case study on max-min uplink power control in cell-free massive MIMO illustrates how a fairness-oriented wireless problem can be discretized, constrained, converted into the concept of a QUBO, and evaluated against classical baselines. A host of key challenges and future directions are also discussed.
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 evaluates quantum annealing as a potential method for solving multi-path routing in large-scale quantum communication networks. The routing problem was formulated as a quadratic unconstrained binary optimization (QUBO) problem that minimizes negative throughput while satisfying quantum network constraints. The experimental framework tests four solution approaches on randomly generated networks: (1) the classical quantum fidelity rate maximizing (Q-FiRM) algorithm, (2) classical simulated annealing, (3) D-Wave hybrid solver, and (4) pure quantum annealing on D-Wave Advantage2 hardware. Results show that while quantum annealers produce feasible solutions, the classical Q-FiRM algorithm achieves superior throughput and faster computation times for this problem class. Among QUBO approaches, hybrid solvers demonstrate computational advantages over pure classical simulated annealing while maintaining comparable solution quality. These findings provide practical insight into the current capabilities and limitations of quantum optimization for quantum internet infrastructure design.
Embedding Service Function Chain (SFC) into the massive and resource-hungry Internet of Things (IoT) substrate graph is a critical optimization research problem. Unfortunately, the classical Integer Linear Programming (ILP) formulation for such problems is usually NP-hard. Thus, this research study presses on the need to go beyond the realms and employ Quantum Annealing (QA) to speed up the computation. To comply, we reformulate the SFC embedding problem into IoT graphs as Quadratic Unconstrained Binary Optimization (QUBO) format and propose a hybrid warm start quantum annealing (WSQA) optimization technique. Simulation results show that our proposed WSQA can improve resource utilization, accelerate computing time, and achieve a better scalability success rate at solving large-scale SFC deployment compared to standalone QA. Further along the line, this research inspires the application of quantum optimization for resource allocation in next-generation networks even with the limited availability of qubits.
The Energy Internet (EI) is a new concept aimed at enhancing the integration of renewable energy sources with the energy grid. Energy-efficient path selection in EI is NP-hard. This research presents an innovative Quadratic Unconstrained Binary Optimization (QUBO) and Ising Hamiltonian formulation for energy routing. The validation and scalability of the proposed formulation were evaluated by applying quantum-inspired annealing and quantum gate optimization to two case studies, a 9-node and a 30-node EI network. A comparative analysis was presented between classical optimization using the Dijkstra algorithm, optimization-based methods, and QAOA using the Qiskit Sampler Primitive, NumpyEigenSolver, and quantum-inspired annealing using the Ocean exact Solver, D-Wave Tabu Sampler, and D-Wave Simulated Annealing. Simulation results based on the proposed formulation agree with the exact solution, while the runtime of classical approaches is less than that of quantum approaches. However, the Simulated Annealing sampler offers the shortest runtime among all quantum methods.