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.
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.
Path planning in complex and obstacle-constrained environments remains a challenging combinatorial optimization problem due to the exponential growth of the solution space and the limitations of classical algorithms in dynamic decision-making scenarios. Traditional approaches such as Dijkstra or A* may experience high computational costs and susceptibility to local optima when dealing with large-scale directed graphs containing obstacles. This study proposes a hybrid quantum computing approach that integrates the Grover Search Algorithm and the Quantum Approximate Optimization Algorithm (QAOA) to address optimal path planning on obstacle-oriented directed graphs. The Grover algorithm is first employed as an oracle-based filtering mechanism to detect and eliminate obstacle-containing edges, thereby generating a valid subgraph of feasible paths. Following this preprocessing step, QAOA is applied to the filtered graph within a nonlinear optimization framework to determine the minimum-cost path between source and destination nodes. The optimization model represents the graph as G=(V,E), where binary decision variables indicate whether an edge is included in the selected route while satisfying flow conservation constraints. By narrowing the solution space through Grover-based obstacle detection and performing optimization only on valid edges, the proposed method significantly reduces computational complexity compared to conventional approaches. Experimental analysis demonstrates that the hybrid quantum model effectively identifies optimal routes and adapts to different obstacle configurations while maintaining efficient convergence behavior. The results highlight the potential of integrating quantum search and quantum optimization techniques for solving combinatorial graph problems. This work contributes to the growing body of research on quantum-assisted optimization and demonstrates the feasibility of applying hybrid quantum algorithms to directed path planning problems relevant to autonomous navigation 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.
Trajectory optimization is a fundamental problem in aerospace mission planning, involving the selection of optimal paths to minimize fuel consumption, travel time, or other mission costs. This study explores the use of the Quantum Approximate Optimization Algorithm (QAOA) implemented in the Cirq simulator to solve discrete trajectory planning problems modeled as directed graphs. A level-based graph is constructed to represent multiple candidate waypoints between a starting location and a goal, ensuring that feasible paths respect continuity and waypoint constraints. QAOA is applied to select edges that minimize a cost function representing trajectory efficiency while enforcing path consistency through penalty terms. The simulations demonstrate that the algorithm successfully identifies feasible and cost-effective paths, highlighting the potential of quantum-inspired optimization methods for aerospace applications. The results provide a foundation for future research on integrating quantum computing techniques into autonomous mission planning and trajectory optimization tasks.
Quantum computing in drone technology begins to show potential big time, especially in the possibility of data processing, communication, and how to bring operational efficiency.In this study, the integration of quantum algorithms on drone navigation systems to enhance their efficiency in terms of security and performance is being investigated.However, in the interest of full disclosure, it should be noted that quantum-enabled drones have not been built and tested elsewhere to get an insight from a practical standpoint. This research is based on simulations and hypothetical models, which show that quantum algorithms could improve the optimization of drone operations.A simulation performed showed that the mean path length of data transmission was shortened by 12.4%, both from source to destination and back, compacting the whole process and increasing speed while it decreased packet loss by an average value close to 75% — when compared with regular methods. High-density urban obstacle avoidance efficiency increased by 26.1%. Though these results demonstrate an impressive theoretical advantage, realizing practical quantum computing on drones has many challenges to be overcome such as miniaturization of hardware components, power consumption and environmental protection. Overcoming these challenges is critical for future explorations into what quantum-integrated drones can achieve.This article presents a holistic overview of the current status of quantum technological advances in drones and sketches out what constitutes crucial steps to make things turn from theoretical calculations to real-life operational systems. Accordingly, this study sets a new foundation for future advancements in this nascent field and offers solutions that could get one step closer to realizing ambitious visions of autonomous aerial systems across multiple domains.
Real-time monitoring systems that combine autonomous vehicles (AVs) and unmanned aerial vehicles (UAVs) with Internet of Things (IoT) networks have to deal with a huge number of computational problems such as resource allocation, trajectory optimization, and data processing. In this paper, an intelligent quantum optimization framework is proposed which involves the principles of quantum computing to improve the efficiency and performance of AV-drone IoT systems in real-time surveillance and monitoring applications. The proposed methodology combines Quantum Approximate Optimization Algorithm (QAOA) and quantum annealing with quantuminspired reinforcement learning approaches to solve combinatorial optimization problems occurring in a multi-UAV network. The approach includes an edge-quantum computing architecture to provide distributed computing and lower latency for time-sensitive applications. It is shown that the energy savings of quantum annealing for route optimization over classical simulated annealing is 21% with experimental results and that quantum-assisted path planning has linear scaling in circuit depth. Hybrid quantum-classical framework exhibits 26.1% higher high density urban obstacle avoidance efficiency and 75% lower packet loss rates. Evaluation on five benchmark datasets shows an average accuracy of 94.7% and a maximum of 96.5% in disaster management scenarios. The proposed system aims to provide energy-efficient, intelligent monitoring infrastructure, thereby contributing to Sustainable Development Goals (SDGs) 9 (Industry, Innovation, and Infrastructure), 11 (Sustainable Cities and Communities), and 13 (Climate Action). Comparative analysis shows that the accuracy is improved by 7.8% over the classical baselines and end-to-end latency is reduced by 64.6%. The findings from this research illustrate the potential of quantum computing in revolutionizing autonomous IoT systems for smart city applications, disaster response, and environmental monitoring.
Quantum-assisted UAV path planning has recently been studied using QAOA-style obstacle-avoidance formulations, but a low-energy binary sample is not necessarily a valid UAV trajectory. This paper presents a feasibility-aware evaluation protocol on one discrete 8 × 8, L = 20 UAV grid-planning instance with obstacle avoidance, a line-of-sight visibility cost, and a higher-order temporal buffer-risk term. The horizon L denotes discrete planning layers, not physical seconds. The model uses binary variables x_{t,v} indicating whether the UAV occupies cell v at time layer t and forms a HUBO objective with one-hot, start, motion, obstacle, visibility, terminal-goal, and sustained near-obstacle proximity terms. The instance has 1,280 original binary variables and 118,344 polynomial terms, including 4,392 cubic monomials. We compare A*, RRT-best, a QUAV-style QAOA candidate-path selector, native trajectory-level simulated annealing (SA), the classical neal BQM sampler after HUBO-to-QUBO reduction, and an exact CP-SAT baseline that minimizes the native HUBO soft objective over hard-feasible paths. The CP-SAT solver returns OPTIMAL and certifies that the best observed SA path is globally optimal for the enforced feasible-path objective, with implementation HUBO energy −20752.43, soft cost 247.57, path length 14, six turns, and 85% visibility. On the tested instance, the results show why feasibility-aware decoding, exact baselines, and quadratization effects matter; they do not establish quantum speedup or performance across an instance suite.