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

arXiv:2609.01930 · IEEE Internet of Things Journal

Quantum-Based k -Coverage Optimization for UAV-Aided Search-and-Rescue Missions

Halim Lee, Suhui Jeong, Na Young Kim, Jiwon Seo

Published Sep 1, 2026• 0 citations
arXivHTMLPDF

Abstract

In large-scale disaster scenarios, rapid localization of missing persons is a critical challenge for search-and-rescue (SAR) operations. Unmanned aerial vehicles (UAVs) equipped with radio frequency (RF) receivers can support RF-based localization by collecting signals emitted from mobile devices at spatially distributed sensing locations. This paper addresses the resulting waypoint-selection problem: determining a minimum set of UAV waypoints that provides at least threefold coverage of every potential target location. We formulate this task as an extended k-coverage problem that independently defines the UAV-navigable and target regions, and derive an exact-penalty quadratic unconstrained binary optimization (QUBO) formulation with a sufficient penalty condition that preserves feasibility and minimum waypoint cardinality. The QUBO is mapped to an Ising-form cost Hamiltonian and evaluated using the quantum approximate optimization algorithm (QAOA) on both a noise-free simulator and IBM's 127-qubit Eagle processor. On the tested simulator instances, QAOA recovers the known minimum-cardinality solutions. Across the rectangular hardware test cases, the mean 3-coverage ratio exceeded 95%. In the campus-scale evaluation, ten hardware executions achieved 99.3% mean 3-coverage with a 90% feasible-run rate, while the shortest feasible flight path was up to 37.0% shorter than those of the deterministic grid-based baselines. Additional comparisons with classical optimization and learning-based baselines are provided, together with computational and quantum-resource analyses for larger generated instances. These results establish an exact QUBO representation for RF-based SAR waypoint selection and characterize its implementation on current gate-based quantum hardware.

DOI
10.1109/jiot.2026.3729685

Related papers

Quantum-Driven UAVs for Navigation, Sensing, and Communications in Next-Gen Networks

Sana Jabbar, Ajmal Khan, Waqas Khalid +3 more

Unmanned Aerial Vehicle (UAV) technology is progressing towards autonomy, in which accurate sensor data, precise navigation, i.e., localization and path planning, sensing, and communication are vital to achieving mission success in unpredictable and complex environments. In this paper, we summarize state-of-the-art quantum-based techniques to improve UAV performance across four pillars: path planning, localization, sensing, and communication. We also benchmark the execution time of five path-planning solvers on randomly generated quadratic unconstrained binary optimization (QUBO) instances of increasing size. Exact classical search exhibitsO(2N) complexity, so each additional binary decision variable doubles the number of candidate solutions that must be checked. Within the measured range (N≤ 20), simulated QAOA execution remains slower than classical brute-force search, reflecting the overhead of classically simulating a quantum circuit rather than a property of physical quantum hardware. Additionally, we simulate three stochastic sensingerror models and show analytically that, under the assumed model, the accumulated error of a model with a damped per-step error has a bounded second moment, whereas models containing an integrated bias random walk have a variance that grows asO(T3). We further evaluate an illustrative free-space quantum key distribution (QKD) link model for UAV relays. In the end, we also summarize the research issues associated with quantum-based techniques. These issues are associated with hardware limitations, susceptibility to noise, and complexity of implementation that require further investigation.

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

Joint UAV trajectory optimization and beamforming design for wireless sensing using quantum annealing

Pham Dang Anh Duc, Nguyen Xuan Tung, Seon-Geun Jeong +2 more

This paper studies the application of unmanned aerial vehicles (UAVs) in sensing systems, focusing on minimizing total detection errors by jointly designing the UAV’s trajectory and beamforming vectors. Due to the structure of a mixed-integer nonlinear program (MINLP), the formulated optimization problem poses significant computational challenges for classical processors. To address this bottleneck, we first determine the optimal beamforming vectors as a closed-form solution at each UAV coordinate. We then leverage the advantages of quantum annealers to optimize the trajectory of the UAV. Specifically, we formulate the UAV’s trajectory optimization as a Quadratic Unconstrained Binary Optimization (QUBO) problem, with the constraints effectively handled by our suggested penalty factors. We further ensure the feasibility by establishing a lower bound of penalty factors. Numerical results demonstrate the efficiency of the proposed quantum-based approach, which is comparable to the genetic algorithm with a substantially shorter running time.

ICT Express•Aug 1, 2026•0 citations

Applying the Quantum Approximate Optimization Algorithm to the UAV Collision Avoidance Problem

Kalleb C. Santos, Maria Eduarda W. M. Vianna, Mateus K. de Oliveira +4 more

The increasing availability of quantum hardware has stimulated interest in applying quantum algorithms to combinatorial optimization problems. Collision avoidance for unmanned aerial vehicles (UAVs) is one such challenge due to the computational complexity of coordinating multiple agents in shared airspace. In this paper, we formulate the problem as a Quadratic Unconstrained Binary Optimization (QUBO) model that captures route selection and collision constraints, enabling the use of the Quantum Approximate Optimization Algorithm (QAOA). To improve efficiency, we introduce a constrained QAOA Ansatz employing an XY-mixer that preserves one-hot route assignment constraints and restricts the search space to valid solutions. We evaluate the approach through noiseless simulations and device-based noise models, analyzing its behavior under realistic conditions and highlighting the opportunities and limitations of near-term quantum hardware for multi-agent routing problems.

Simpósio Brasileiro de Computação e Comunicação Quânticas (SBCCQ)•Jul 19, 2026•0 citations

Combinatorial optimization of connected UAV communication bridges for emergency response

Matteo Vandelli, Daniele Dragoni

We present a combinatorial optimization problem for the strategic deployment of UAVs equipped with 5G antennas to assist rescue operations in regions hit by natural disasters. Our goal is to optimize the placement of UAVs to provide coverage in flying ad-hoc networks among given candidate sites. Our formulation aims to maximize signal coverage and minimize interference while ensuring network connectivity. To mitigate interference effects, we incorporate the use of multiple frequencies. We formulate this problem as an integer quadratic program (IQP). We present numerical solutions obtained via the CPLEX solver and conduct a preliminary analysis of the problem's scalability in realistic network configurations. Our findings reveal a significant exponential increase in Time-to-Solution (TTS) as the number of sites grows, which poses a critical challenge in urgent, time-sensitive scenarios. To address this issue, approximate suboptimal solutions can be produced by enforcing a time limit on the solver. Although these solutions are not optimal, they preserve connectivity in most cases, providing a practical trade-off between solution quality and computational times that remain within feasible limits for real-time UAV redeployment. Recognizing the limitations of classical solvers in these contexts, we explore quantum computing as a promising alternative. Specifically, we reformulate the problem as a quadratic unconstrained binary optimization (QUBO) problem, suitable for most quantum algorithms. Through high-performance computing emulation, we show that the quantum adiabatic algorithm (QAA) can accurately solve small-scale instances, paving the way for future application of quantum computing to large-scale, time-critical optimization problems in disaster response.

quant-pharXiv:2609.02562•Sep 3, 2026

Variational Quantum Algorithm Applied to Collision Avoidance of Unmanned Aerial Vehicles

Zhaolong Huang, Qiting Li, Junling Zhao +1 more

Mission planning for multiple unmanned aerial vehicles (UAVs) is a complex problem that is expected to be solved by quantum computing. With the increasing application of UAVs, the demand for efficient conflict management strategies to ensure airspace safety continues to increase. In the era of noisy intermediate-scale quantum (NISQ) devices, variational quantum algorithms (VQA) for optimizing parameterized quantum circuits with the help of classical optimizers are currently one of the most promising strategies to gain quantum advantage. In this paper, we propose a mathematical model for the UAV collision avoidance problem that maps the collision avoidance problem to a quadratic unconstrained binary optimization (QUBO) problem. The problem is formulated as an Ising Hamiltonian, then the ground state is solved using two kinds of VQAs: the variational quantum eigensolver (VQE) and the quantum approximate optimization algorithm (QAOA). We select conditional value-at-risk (CVaR) to further promote the performance of our model. Four examples are given to validate that with our method the probability of obtaining a feasible solution can exceed 90% based on appropriate parameters, and our method can enhance the efficiency of a UAVs' collision avoidance model.

Entropy•Nov 18, 2022•16 citations

Reducing QUBO Complexity in Drone Delivery Through Classical Feasibility Preprocessing

Silvie Illésová, Vojtěch Novák, Martin Beseda

Drone-delivery planning combines routing decisions with operational constraints such as payload capacity and limited onboard energy, resulting in combinatorial optimization problems that can become costly to encode directly in binary form. This work investigates a hybrid quantum--classical approach in which candidate drone missions are generated and evaluated classically before constructing a quadratic unconstrained binary optimization (QUBO) model for mission selection. Payload- and energy-infeasible missions are removed during preprocessing, while the reduced QUBO is solved using exact enumeration, simulated annealing (SA), and the Quantum Approximate Optimization Algorithm (QAOA), with mixed-integer linear programming (MILP) used as a classical reference. Experiments on controlled synthetic delivery instances evaluate solution quality, the effect of preprocessing, and computational scaling. Exact QUBO optimization reproduces the MILP optimum on the evaluated small instances, while SA achieves $100\%$ feasibility with a median optimality gap of $0\%$. Combined payload-and-energy preprocessing reduces the mean number of QUBO variables by $29.60\%$ and quadratic interactions by $49.20\%$, while reducing mean SA runtime by $31.26\%$. In contrast, the evaluated shallow statevector-based QAOA configuration achieves lower feasibility and is restricted to small QUBO instances. These results indicate that, in the considered setting, the main practical benefit of the hybrid architecture comes from classical feasibility preprocessing that reduces the binary search space before QUBO-based optimization.

quant-pharXiv:2610.21003•Oct 16, 2026•0 citations
In large-scale disaster scenarios, rapid localization of missing persons is a critical challenge for search-and-rescue (SAR) operations. Unmanned aerial vehicles (UAVs) equipped with radio frequency (RF) receivers can support RF-based localization by collecting signals emitted from mobile devices at spatially distributed sensing locations. This paper addresses the resulting waypoint-selection problem: determining a minimum set of UAV waypoints that provides at least threefold coverage of every potential target location. We formulate this task as an extended k-coverage problem that independently defines the UAV-navigable and target regions, and derive an exact-penalty quadratic unconstrained binary optimization (QUBO) formulation with a sufficient penalty condition that preserves feasibility and minimum waypoint cardinality. The QUBO is mapped to an Ising-form cost Hamiltonian and evaluated using the quantum approximate optimization algorithm (QAOA) on both a noise-free simulator and IBM's 127-qubit Eagle processor. On the tested simulator instances, QAOA recovers the known minimum-cardinality solutions. Across the rectangular hardware test cases, the mean 3-coverage ratio exceeded 95%. In the campus-scale evaluation, ten hardware executions achieved 99.3% mean 3-coverage with a 90% feasible-run rate, while the shortest feasible flight path was up to 37.0% shorter than those of the deterministic grid-based baselines. Additional comparisons with classical optimization and learning-based baselines are provided, together with computational and quantum-resource analyses for larger generated instances. These results establish an exact QUBO representation for RF-based SAR waypoint selection and characterize its implementation on current gate-based quantum hardware.
Unmanned Aerial Vehicle (UAV) technology is progressing towards autonomy, in which accurate sensor data, precise navigation, i.e., localization and path planning, sensing, and communication are vital to achieving mission success in unpredictable and complex environments. In this paper, we summarize state-of-the-art quantum-based techniques to improve UAV performance across four pillars: path planning, localization, sensing, and communication. We also benchmark the execution time of five path-planning solvers on randomly generated quadratic unconstrained binary optimization (QUBO) instances of increasing size. Exact classical search exhibitsO(2N) complexity, so each additional binary decision variable doubles the number of candidate solutions that must be checked. Within the measured range (N≤ 20), simulated QAOA execution remains slower than classical brute-force search, reflecting the overhead of classically simulating a quantum circuit rather than a property of physical quantum hardware. Additionally, we simulate three stochastic sensingerror models and show analytically that, under the assumed model, the accumulated error of a model with a damped per-step error has a bounded second moment, whereas models containing an integrated bias random walk have a variance that grows asO(T3). We further evaluate an illustrative free-space quantum key distribution (QKD) link model for UAV relays. In the end, we also summarize the research issues associated with quantum-based techniques. These issues are associated with hardware limitations, susceptibility to noise, and complexity of implementation that require further investigation.
This paper studies the application of unmanned aerial vehicles (UAVs) in sensing systems, focusing on minimizing total detection errors by jointly designing the UAV’s trajectory and beamforming vectors. Due to the structure of a mixed-integer nonlinear program (MINLP), the formulated optimization problem poses significant computational challenges for classical processors. To address this bottleneck, we first determine the optimal beamforming vectors as a closed-form solution at each UAV coordinate. We then leverage the advantages of quantum annealers to optimize the trajectory of the UAV. Specifically, we formulate the UAV’s trajectory optimization as a Quadratic Unconstrained Binary Optimization (QUBO) problem, with the constraints effectively handled by our suggested penalty factors. We further ensure the feasibility by establishing a lower bound of penalty factors. Numerical results demonstrate the efficiency of the proposed quantum-based approach, which is comparable to the genetic algorithm with a substantially shorter running time.
The increasing availability of quantum hardware has stimulated interest in applying quantum algorithms to combinatorial optimization problems. Collision avoidance for unmanned aerial vehicles (UAVs) is one such challenge due to the computational complexity of coordinating multiple agents in shared airspace. In this paper, we formulate the problem as a Quadratic Unconstrained Binary Optimization (QUBO) model that captures route selection and collision constraints, enabling the use of the Quantum Approximate Optimization Algorithm (QAOA). To improve efficiency, we introduce a constrained QAOA Ansatz employing an XY-mixer that preserves one-hot route assignment constraints and restricts the search space to valid solutions. We evaluate the approach through noiseless simulations and device-based noise models, analyzing its behavior under realistic conditions and highlighting the opportunities and limitations of near-term quantum hardware for multi-agent routing problems.
We present a combinatorial optimization problem for the strategic deployment of UAVs equipped with 5G antennas to assist rescue operations in regions hit by natural disasters. Our goal is to optimize the placement of UAVs to provide coverage in flying ad-hoc networks among given candidate sites. Our formulation aims to maximize signal coverage and minimize interference while ensuring network connectivity. To mitigate interference effects, we incorporate the use of multiple frequencies. We formulate this problem as an integer quadratic program (IQP). We present numerical solutions obtained via the CPLEX solver and conduct a preliminary analysis of the problem's scalability in realistic network configurations. Our findings reveal a significant exponential increase in Time-to-Solution (TTS) as the number of sites grows, which poses a critical challenge in urgent, time-sensitive scenarios. To address this issue, approximate suboptimal solutions can be produced by enforcing a time limit on the solver. Although these solutions are not optimal, they preserve connectivity in most cases, providing a practical trade-off between solution quality and computational times that remain within feasible limits for real-time UAV redeployment. Recognizing the limitations of classical solvers in these contexts, we explore quantum computing as a promising alternative. Specifically, we reformulate the problem as a quadratic unconstrained binary optimization (QUBO) problem, suitable for most quantum algorithms. Through high-performance computing emulation, we show that the quantum adiabatic algorithm (QAA) can accurately solve small-scale instances, paving the way for future application of quantum computing to large-scale, time-critical optimization problems in disaster response.
Mission planning for multiple unmanned aerial vehicles (UAVs) is a complex problem that is expected to be solved by quantum computing. With the increasing application of UAVs, the demand for efficient conflict management strategies to ensure airspace safety continues to increase. In the era of noisy intermediate-scale quantum (NISQ) devices, variational quantum algorithms (VQA) for optimizing parameterized quantum circuits with the help of classical optimizers are currently one of the most promising strategies to gain quantum advantage. In this paper, we propose a mathematical model for the UAV collision avoidance problem that maps the collision avoidance problem to a quadratic unconstrained binary optimization (QUBO) problem. The problem is formulated as an Ising Hamiltonian, then the ground state is solved using two kinds of VQAs: the variational quantum eigensolver (VQE) and the quantum approximate optimization algorithm (QAOA). We select conditional value-at-risk (CVaR) to further promote the performance of our model. Four examples are given to validate that with our method the probability of obtaining a feasible solution can exceed 90% based on appropriate parameters, and our method can enhance the efficiency of a UAVs' collision avoidance model.
Drone-delivery planning combines routing decisions with operational constraints such as payload capacity and limited onboard energy, resulting in combinatorial optimization problems that can become costly to encode directly in binary form. This work investigates a hybrid quantum--classical approach in which candidate drone missions are generated and evaluated classically before constructing a quadratic unconstrained binary optimization (QUBO) model for mission selection. Payload- and energy-infeasible missions are removed during preprocessing, while the reduced QUBO is solved using exact enumeration, simulated annealing (SA), and the Quantum Approximate Optimization Algorithm (QAOA), with mixed-integer linear programming (MILP) used as a classical reference. Experiments on controlled synthetic delivery instances evaluate solution quality, the effect of preprocessing, and computational scaling. Exact QUBO optimization reproduces the MILP optimum on the evaluated small instances, while SA achieves 100%100\%100% feasibility with a median optimality gap of 0%0\%0%. Combined payload-and-energy preprocessing reduces the mean number of QUBO variables by 29.60%29.60\%29.60% and quadratic interactions by 49.20%49.20\%49.20%, while reducing mean SA runtime by 31.26%31.26\%31.26%. In contrast, the evaluated shallow statevector-based QAOA configuration achieves lower feasibility and is restricted to small QUBO instances. These results indicate that, in the considered setting, the main practical benefit of the hybrid architecture comes from classical feasibility preprocessing that reduces the binary search space before QUBO-based optimization.