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

Quantum-Assisted Route Planning for UAV-Based Offshore Geological Exploration: A Simulation Study in the Guajira Basin

Andrés Polo, Javier García-Guerrero, David Rojas-Arciniegas, Diana Catalina Guzmán-Hernández, Ricardo Antonio Tobón

Published Jul 9, 2025• 0 citations
Publisher

Abstract

Offshore geological exploration increasingly confronts operational and environmental challenges, including ecological constraints, elevated costs, and limited availability of high-resolution geospatial data. This study proposes a quantum-enhanced simulation framework that integrates Quadratic Unconstrained Binary Optimization (QUBO) with the Quantum Approximate Optimization Algorithm (QAOA) to optimize route planning for early-stage geological reconnaissance in the Guajira Offshore basin, Colombia. The study domain—a 1 km² marine area—is discretized into a 10×10 grid of 100 m × 100 m cells, each assigned a geostructural priority score. The resulting QUBO formulation encodes spatial connectivity, movement rules, and geological relevance into a binary decision structure, which is then solved through hybrid quantum–classical optimization routines. Results indicate that QAOA-based solutions produce coherent and efficient exploration routes that prioritize high-value geological targets while respecting spatial continuity and energy limitations. The proposed framework offers a promising pathway toward low-impact, cost-effective offshore exploration strategies and is scalable to broader maritime contexts. Additionally, it is compatible with future extensions involving AI-driven geological classification and real-time, adaptive route planning using multi-agent systems.

DOI
10.20944/preprints202507.0809.v1

Related papers

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

Quantum algorithms for drone mission planning

Ethan G. Davies, Pranav V. Kalidindi

Mission planning often involves optimising the use of ISR (Intelligence, Surveillance and Reconnaissance) assets in order to achieve a set of mission objectives within allowed parameters subject to constraints. The missions of interest here, involve routing multiple UAVs visiting multiple targets, utilising sensors to capture data relating to each target. Finding such solutions is often an NP-Hard problem and cannot be solved efficiently on classical computers. Furthermore, during the mission new constraints and objectives may arise, requiring a new solution to be computed within a short time period. To achieve this we investigate near term quantum algorithms that have the potential to offer speed-ups against current classical methods. We demonstrate how a large family of these problems can be formulated as a Mixed Integer Linear Program (MILP) and then converted to a Quadratic Unconstrained Binary Optimisation (QUBO). The formulation provided is versatile and can be adapted for many different constraints with clear qubit scaling provided. We discuss the results of solving the QUBO formulation using commercial quantum annealers and compare the solutions to current edge classical solvers. We also analyse the results from solving the QUBO using Quantum Approximate Optimisation Algorithms (QAOA) and discuss their results. Finally, we also provide efficient methods to encode to the problem into the Variational Quantum Eigensolver (VQE) formalism, where we have tailored the ansatz to the problem making efficient use of the qubits available.

arXiv:2409.18631•SPIE Quantum Technologies for Defence and Security•Nov 15, 2024•3 citations

Quantum-enhanced Optimization for LNG Ship Routing: Integrating Digital Twins with QAOA

Elif Ak, Dang Van Huynh, Trung Q. Duong

Liquefied natural gas (LNG) shipping poses unique optimization challenges in global logistics due to strict operational constraints, dynamic environmental conditions, and the need to minimize both costs and delays. This study explores the integration of quantum optimization and digital twin technology to address the complexities of LNG ship routing. Specifically, we formulate the ship routing problem as a mixed-integer linear programming (MILP) problem aimed at minimizing costs and travel time while incorporating constraints such as ship capacities and weather variability. Given the NP-hard nature of the problem, classical optimization methods struggle to scale efficiently. To overcome this, we transform the MILP into a quadratic unconstrained binary optimization (QUBO) format and employ the quantum approximate optimization algorithm (QAOA) to solve it. The proposed framework integrates real-time data via digital twins, enabling dynamic updates to the optimization process.

IEEE International Conference on Communications workshops•Jun 8, 2025•0 citations

QUAV: Quantum-Assisted Path Planning and Optimization for UAV Navigation with Obstacle Avoidance

Nouhaila Innan, Muhammad Kashif, Alberto Marchisio +3 more

The growing demand for drone navigation in urban and restricted airspaces requires real-time path planning that is both safe and scalable. Classical methods often struggle with the computational load of high-dimensional optimization under dynamic constraints like obstacle avoidance and no-fly zones. This work introduces QUAV, a quantum-assisted UAV path planning framework based on the Quantum Approximate Optimization Algorithm (QAOA), to the best of our knowledge, this is one of the first applications of QAOA for drone trajectory optimization. QUAV models pathfinding as a quantum optimization problem, allowing efficient exploration of multiple paths while incorporating obstacle constraints and geospatial accuracy through UTM coordinate transformation. A theoretical analysis shows that QUAV achieves linear scaling in circuit depth relative to the number of edges, under fixed optimization settings. Extensive simulations and a realhardware implementation on IBM's ibm_kyiv backend validate its performance and robustness under noise. Despite hardware constraints, results demonstrate that QUAV generates feasible, efficient trajectories, highlighting the promise of quantum approaches for future drone navigation systems.

arXiv:2508.21361•IEEE International Conference on Quantum Artificial Intelligence (QAI)•Nov 2, 2025•3 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

Reinforcement Learning based Quantum Approximate Optimization Algorithm for Vehicle Routing Problem.

Md. Aqib Aman, Fardin Azam Sakib

Reinforcement Learning–based Quantum Approximate Optimization Algorithm (QAOA-RL) is used to solve the Vehicle Routing Problem (VRP) by transforming it into a Quadratic Unconstrained Binary Optimization (QUBO) form. The RL agent learns to optimize QAOA parameters for better route selection. Results show that QAOA-RL achieves a lower total cost compared to exact ILP and heuristic Greedy Search methods. Although the training time is higher, the solution quality improves significantly for larger problem sizes. This study highlights QAOA-RL as a scalable and promising hybrid quantum–classical approach for real-world logistics optimization.

Transportation research procedia•Jan 1, 2026•0 citations
Offshore geological exploration increasingly confronts operational and environmental challenges, including ecological constraints, elevated costs, and limited availability of high-resolution geospatial data. This study proposes a quantum-enhanced simulation framework that integrates Quadratic Unconstrained Binary Optimization (QUBO) with the Quantum Approximate Optimization Algorithm (QAOA) to optimize route planning for early-stage geological reconnaissance in the Guajira Offshore basin, Colombia. The study domain—a 1 km² marine area—is discretized into a 10×10 grid of 100 m × 100 m cells, each assigned a geostructural priority score. The resulting QUBO formulation encodes spatial connectivity, movement rules, and geological relevance into a binary decision structure, which is then solved through hybrid quantum–classical optimization routines. Results indicate that QAOA-based solutions produce coherent and efficient exploration routes that prioritize high-value geological targets while respecting spatial continuity and energy limitations. The proposed framework offers a promising pathway toward low-impact, cost-effective offshore exploration strategies and is scalable to broader maritime contexts. Additionally, it is compatible with future extensions involving AI-driven geological classification and real-time, adaptive route planning using multi-agent systems.
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.
Mission planning often involves optimising the use of ISR (Intelligence, Surveillance and Reconnaissance) assets in order to achieve a set of mission objectives within allowed parameters subject to constraints. The missions of interest here, involve routing multiple UAVs visiting multiple targets, utilising sensors to capture data relating to each target. Finding such solutions is often an NP-Hard problem and cannot be solved efficiently on classical computers. Furthermore, during the mission new constraints and objectives may arise, requiring a new solution to be computed within a short time period. To achieve this we investigate near term quantum algorithms that have the potential to offer speed-ups against current classical methods. We demonstrate how a large family of these problems can be formulated as a Mixed Integer Linear Program (MILP) and then converted to a Quadratic Unconstrained Binary Optimisation (QUBO). The formulation provided is versatile and can be adapted for many different constraints with clear qubit scaling provided. We discuss the results of solving the QUBO formulation using commercial quantum annealers and compare the solutions to current edge classical solvers. We also analyse the results from solving the QUBO using Quantum Approximate Optimisation Algorithms (QAOA) and discuss their results. Finally, we also provide efficient methods to encode to the problem into the Variational Quantum Eigensolver (VQE) formalism, where we have tailored the ansatz to the problem making efficient use of the qubits available.
Liquefied natural gas (LNG) shipping poses unique optimization challenges in global logistics due to strict operational constraints, dynamic environmental conditions, and the need to minimize both costs and delays. This study explores the integration of quantum optimization and digital twin technology to address the complexities of LNG ship routing. Specifically, we formulate the ship routing problem as a mixed-integer linear programming (MILP) problem aimed at minimizing costs and travel time while incorporating constraints such as ship capacities and weather variability. Given the NP-hard nature of the problem, classical optimization methods struggle to scale efficiently. To overcome this, we transform the MILP into a quadratic unconstrained binary optimization (QUBO) format and employ the quantum approximate optimization algorithm (QAOA) to solve it. The proposed framework integrates real-time data via digital twins, enabling dynamic updates to the optimization process.
The growing demand for drone navigation in urban and restricted airspaces requires real-time path planning that is both safe and scalable. Classical methods often struggle with the computational load of high-dimensional optimization under dynamic constraints like obstacle avoidance and no-fly zones. This work introduces QUAV, a quantum-assisted UAV path planning framework based on the Quantum Approximate Optimization Algorithm (QAOA), to the best of our knowledge, this is one of the first applications of QAOA for drone trajectory optimization. QUAV models pathfinding as a quantum optimization problem, allowing efficient exploration of multiple paths while incorporating obstacle constraints and geospatial accuracy through UTM coordinate transformation. A theoretical analysis shows that QUAV achieves linear scaling in circuit depth relative to the number of edges, under fixed optimization settings. Extensive simulations and a realhardware implementation on IBM's ibm_kyiv backend validate its performance and robustness under noise. Despite hardware constraints, results demonstrate that QUAV generates feasible, efficient trajectories, highlighting the promise of quantum approaches for future drone navigation systems.
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.
Reinforcement Learning–based Quantum Approximate Optimization Algorithm (QAOA-RL) is used to solve the Vehicle Routing Problem (VRP) by transforming it into a Quadratic Unconstrained Binary Optimization (QUBO) form. The RL agent learns to optimize QAOA parameters for better route selection. Results show that QAOA-RL achieves a lower total cost compared to exact ILP and heuristic Greedy Search methods. Although the training time is higher, the solution quality improves significantly for larger problem sizes. This study highlights QAOA-RL as a scalable and promising hybrid quantum–classical approach for real-world logistics optimization.