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

Robotics and Autonomous Systems

Quantum planning for swarm robotics

Antonio Chella, Salvatore Gaglio, Maria Mannone, Giovanni Pilato, Valeria Seidita, Filippo Vella, Salvatore Zammuto

Published Jan 7, 2023• 30 citations
Publisher

Abstract

Computational resources of quantum computing can enhance robotic motion, decision making, and path planning. While the quantum paradigm is being applied to individual robots, its approach to swarms of simple and interacting robots remains largely unexplored. In this paper, we attempt to bridge the gap between swarm robotics and quantum computing, in the framework of a search and rescue mission. We focus on a decision-making and path-planning collective task. Thus, we present a quantum-based path-planning algorithm for a swarm of robots. Quantization enters position and reward information (measured as a robot’s proximity to the target) and path-planning decisions. Pairwise information-exchange is modeled through a logic gate, implemented with a quantum circuit. Path planning draws upon Grover’s search algorithm, implemented with another quantum circuit. Our case study involves a search and rescue scenario, inspired by ant-foraging behavior in nature, as an example of swarm intelligence. We show that our method outperforms two ant-behavior simulations, in NetLogo and Java, respectively, presenting a faster convergence to the target, represented here by the source of food. This study can shed light on future applications of quantum computing to swarm robotics.

DOI
10.1016/j.robot.2023.104362

Related papers

Categories, Quantum Computing, and Swarm Robotics: A Case Study

Maria Mannone, Valeria Seidita, Antonio Chella

The swarms of robots are examples of artificial collective intelligence, with simple individual autonomous behavior and emerging swarm effect to accomplish even complex tasks. Modeling approaches for robotic swarm development is one of the main challenges in this field of research. Here, we present a robot-instantiated theoretical framework and a quantitative worked-out example. Aiming to build up a general model, we first sketch a diagrammatic classification of swarms relating ideal swarms to existing implementations, inspired by category theory. Then, we propose a matrix representation to relate local and global behaviors in a swarm, with diagonal sub-matrices describing individual features and off-diagonal sub-matrices as pairwise interaction terms. Thus, we attempt to shape the structure of such an interaction term, using language and tools of quantum computing for a quantitative simulation of a toy model. We choose quantum computing because of its computational efficiency. This case study can shed light on potentialities of quantum computing in the realm of swarm robotics, leaving room for progressive enrichment and refinement.

Mathematics•Jan 25, 2022•19 citations

Quantum Machine Learning for Robotics: A Comprehensive Review of Algorithms, Applications, and Future Directions

Hassen Nigatu, Gaokun Shi, Jituo Li +2 more

The convergence of quantum computing and robotics represents a paradigm shift in autonomous systems design, promising to overcome fundamental computational limitations that have constrained classical robotic capabilities. This comprehensive review surveys the rapidly evolving field of quantum machine learning (QML) for robotics, systematically analyzing 107 peer-reviewed contributions spanning quantum algorithms, machine learning techniques, and their robotic applications. We provide a detailed historical perspective on the field's development, from the early theoretical foundations established by Grover's search algorithm and quantum reinforcement learning proposals to current experimental implementations on noisy intermediate-scale quantum (NISQ) devices. The review systematically examines five major application domains: (1) quantum reinforcement learning for navigation and control, (2) quantum search and path planning algorithms, (3) quantum-enhanced localization and mapping, (4) quantum optimization for inverse kinematics and task allocation, and (5) multi-robot coordination and swarm intelligence. For each domain, we present detailed algorithmic formulations, computational complexity analyses, and critical assessments of experimental results. Our analysis reveals that while provable quantum advantage in robotics remains largely prospective, recent demonstrations show promising results: quantum deep reinforcement learning achieving 40\% parameter reduction in navigation tasks, Grover-based kinematic optimization demonstrating up to 93x speedups, and quantum annealing providing practical solutions for multi-robot routing. We identify key technical challenges, including barren plateaus in variational circuits, noise-induced performance degradation, and the quantum-classical integration bottleneck. Finally, we outline a strategic roadmap for quantum robotics research, distinguishing near-term opportunities in hybrid algorithms from long-term goals requiring fault-tolerant quantum computation. This paper serves as both an authoritative technical reference and a comprehensive guide for researchers working at the intersection of quantum computing and autonomous systems.

•Jun 30, 2026•0 citations

Quantum computing for swarm robotics: a local-to-global approach

Maria Mannone, Valeria Seidita, Antonio Chella

Quantum computing is a branch of computer science derived from the fundamental laws of quantum mechanics, such as state superposition, multi-value logic and destructive measure. An open challenge in itself is to re-think in quantum terms classic problems and solving techniques. Another nature-inspired field is the development of swarm-based robotic applications, where the challenge is catching the fundamental laws governing swarm dynamics, such as pattern formation and target reaching. Here, we review some recent approaches on swarm dynamics, the organizational rules of which are formalized according to quantum computing. In this way, the shades of probability in decision-making for multiple-robot systems can be expressed according to the multi-value logic underlying quantum computing. In our review, specific quantum circuits are sketched to give an idea of how these problems have been faced in computational terms. The article is enriched by references to sonification, a strategy adding one more sensory dimension to data representation, a human-friendly tool to navigate the complexity of swarm-robotic movements in a given arena.This article is part of the theme issue 'The road forward with swarm systems'.

Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences•Jan 29, 2025•7 citations

Density matrix-based dynamics for quantum robotic swarms

Maria Mannone, Mahathi Anand, Peppino Fazio +1 more

In a robotic swarm, parameters such as position and proximity to the target can be described in terms of probability amplitudes. This idea led to recent studies on a quantum approach to the definition of the swarm, including a block-matrix representation. However, the size of such matrix-based representation increases drastically with the swarm size, making them impractical for large swarms. Hence, in this work, we propose a new approach for modeling robotic swarms and robotic networks by considering them as mixed quantum states that can be represented mathematically via density matrices. The size of such an approach only depends on the available degrees of freedom of the robot, and not its swarm size and thus scales well to large swarms. Moreover, it also enables the extraction of local information of the robots from the global swarm information contained in the density matrices, facilitating decentralized behavior that aligns with the collective swarm behavior. Our approach is validated on several simulations including large-scale swarms of up to 1000 robots. Finally, we provide some directions for future research that could potentially widen the impact of our approach.

arXiv:2509.08002•Robotics and Autonomous Systems•Mar 4, 2026•2 citations

A Brief Review on Quantum-Based Control Strategies for Robotic Systems

Mehdi Fazilat, Nadjet Zioui

The increasing convergence of quantum computing (QC) and advanced robotic control is giving rise to a new class of intelligent automation systems. Utilizing quantum-inspired computational principles, contemporary robotic platforms demonstrate greater optimization efficiency, superior perceptual processing, and improved decision-making performance. This survey outlines the principal quantum-oriented control methodologies utilized in robotics, with particular emphasis on approaches that incorporate Quantum Neural Networks (QNN), Quantum Machine Learning (QML), and Quantum-behaved Particle Swarm Optimization (QPSO). The investigation systematically reviews recent advances in quantum-assisted adaptive control, trajectory planning, and optimization frameworks, spotlighting their contributions to improved robustness, precision, and energy efficiency. By analyzing research in quantum reinforcement learning, distributed Noisy Intermediate-Scale Quantum (NISQ) computing, and hybrid quantum-classical approaches, this review clarifies how quantum principles are transforming both theoretical and practical aspects of robotic control. Likewise, several real-world implementations ranging from industrial manipulators to autonomous and cognitive robotic systems demonstrate the growing feasibility of quantum-enhanced decision-making. The review concludes that while remarkable progress has been made in quantum-inspired control for robotics, most existing studies remain constrained to simulations with restricted experimental validation on physical platforms. Addressing this gap will be essential in future research to transition from theoretical and simulated models toward hardware-level implementations, enabling the realization of scalable, fault-tolerant quantum control architectures.

International Conference on Applied Automation and Industrial Diagnostics (ICAAID)•Nov 18, 2025•1 citation

A Novel Hybrid Quantum Architecture for Path Planning in Quantum-Enabled Autonomous Mobile Robots

Mayukh Sarkar, Jitesh Pradhan, Anil Kumar Singh +1 more

Autonomous mobile robots are being used increasingly as consumer devices around the globe, such as for fetching items and cleaning purposes, to name a few, in households and industries. Such robots are being employed to traverse a set of target locations and provide the necessary services. In a 2-dimensional environment, these robots are required to traverse following a Hamiltonian path to reduce energy consumption and time requirements. This problem can be formulated as a Travelling Salesman Problem (TSP), an NP-hard problem. Moreover, upon urgent requirements, these robots must traverse in real-time, demanding speedy path planning from the TSP instance. Among the well-known optimization techniques for solving the TSP problem, Ant Colony Optimization has a good stronghold in providing good approximate solutions. Moreover, ACO not only provides near-optimal solutions for TSP instances but can also output optimal or near-optimal solutions for many other demanding hard optimization problems. However, most of the implementations of Ant Colony Optimization on quantum or hybrid quantum architecture proposed in the literature require conversion of classical data to qubits before being fed to the algorithm, and cannot be automated. But quantum-enabled mobile robots require automated path formation after receiving the commands from the environment. The novelties of the proposed work are many-fold. Firstly, the proposed work allows ACO to be applied as its classical counterparts, allowing automation in path formation in quantum-enabled mobile robots. Secondly, this allows a new way of incorporating quantum processing unit in the research of quantum-enabled mobile robots. Researchers around the globe have been trying to incorporate quantum computing in autonomous mobile robots, and true to the best of authors’ knowledge, no work in path planning for multiple targets in quantum-enabled mobile robots have been found in literature. Thirdly, quantum processing unit has been applied at exactly that point where it will be most useful, as in NISQ era quantum computer is not reliable for arithmetic processing. Simulation results of the proposed Hybrid Quantum Ant Colony Optimization algorithm on several TSP instances have shown promising results with average error percentage from optimumresults of only 6.985%. Hence, it is expected that the proposed work to be important in future research of fusing the two rising domains of quantum computing and autonomous mobile robots.

IEEE Transactions on Consumer Electronics•Jul 4, 2024•18 citations
Computational resources of quantum computing can enhance robotic motion, decision making, and path planning. While the quantum paradigm is being applied to individual robots, its approach to swarms of simple and interacting robots remains largely unexplored. In this paper, we attempt to bridge the gap between swarm robotics and quantum computing, in the framework of a search and rescue mission. We focus on a decision-making and path-planning collective task. Thus, we present a quantum-based path-planning algorithm for a swarm of robots. Quantization enters position and reward information (measured as a robot’s proximity to the target) and path-planning decisions. Pairwise information-exchange is modeled through a logic gate, implemented with a quantum circuit. Path planning draws upon Grover’s search algorithm, implemented with another quantum circuit. Our case study involves a search and rescue scenario, inspired by ant-foraging behavior in nature, as an example of swarm intelligence. We show that our method outperforms two ant-behavior simulations, in NetLogo and Java, respectively, presenting a faster convergence to the target, represented here by the source of food. This study can shed light on future applications of quantum computing to swarm robotics.
The swarms of robots are examples of artificial collective intelligence, with simple individual autonomous behavior and emerging swarm effect to accomplish even complex tasks. Modeling approaches for robotic swarm development is one of the main challenges in this field of research. Here, we present a robot-instantiated theoretical framework and a quantitative worked-out example. Aiming to build up a general model, we first sketch a diagrammatic classification of swarms relating ideal swarms to existing implementations, inspired by category theory. Then, we propose a matrix representation to relate local and global behaviors in a swarm, with diagonal sub-matrices describing individual features and off-diagonal sub-matrices as pairwise interaction terms. Thus, we attempt to shape the structure of such an interaction term, using language and tools of quantum computing for a quantitative simulation of a toy model. We choose quantum computing because of its computational efficiency. This case study can shed light on potentialities of quantum computing in the realm of swarm robotics, leaving room for progressive enrichment and refinement.
The convergence of quantum computing and robotics represents a paradigm shift in autonomous systems design, promising to overcome fundamental computational limitations that have constrained classical robotic capabilities. This comprehensive review surveys the rapidly evolving field of quantum machine learning (QML) for robotics, systematically analyzing 107 peer-reviewed contributions spanning quantum algorithms, machine learning techniques, and their robotic applications. We provide a detailed historical perspective on the field's development, from the early theoretical foundations established by Grover's search algorithm and quantum reinforcement learning proposals to current experimental implementations on noisy intermediate-scale quantum (NISQ) devices. The review systematically examines five major application domains: (1) quantum reinforcement learning for navigation and control, (2) quantum search and path planning algorithms, (3) quantum-enhanced localization and mapping, (4) quantum optimization for inverse kinematics and task allocation, and (5) multi-robot coordination and swarm intelligence. For each domain, we present detailed algorithmic formulations, computational complexity analyses, and critical assessments of experimental results. Our analysis reveals that while provable quantum advantage in robotics remains largely prospective, recent demonstrations show promising results: quantum deep reinforcement learning achieving 40\% parameter reduction in navigation tasks, Grover-based kinematic optimization demonstrating up to 93x speedups, and quantum annealing providing practical solutions for multi-robot routing. We identify key technical challenges, including barren plateaus in variational circuits, noise-induced performance degradation, and the quantum-classical integration bottleneck. Finally, we outline a strategic roadmap for quantum robotics research, distinguishing near-term opportunities in hybrid algorithms from long-term goals requiring fault-tolerant quantum computation. This paper serves as both an authoritative technical reference and a comprehensive guide for researchers working at the intersection of quantum computing and autonomous systems.
Quantum computing is a branch of computer science derived from the fundamental laws of quantum mechanics, such as state superposition, multi-value logic and destructive measure. An open challenge in itself is to re-think in quantum terms classic problems and solving techniques. Another nature-inspired field is the development of swarm-based robotic applications, where the challenge is catching the fundamental laws governing swarm dynamics, such as pattern formation and target reaching. Here, we review some recent approaches on swarm dynamics, the organizational rules of which are formalized according to quantum computing. In this way, the shades of probability in decision-making for multiple-robot systems can be expressed according to the multi-value logic underlying quantum computing. In our review, specific quantum circuits are sketched to give an idea of how these problems have been faced in computational terms. The article is enriched by references to sonification, a strategy adding one more sensory dimension to data representation, a human-friendly tool to navigate the complexity of swarm-robotic movements in a given arena.This article is part of the theme issue 'The road forward with swarm systems'.
In a robotic swarm, parameters such as position and proximity to the target can be described in terms of probability amplitudes. This idea led to recent studies on a quantum approach to the definition of the swarm, including a block-matrix representation. However, the size of such matrix-based representation increases drastically with the swarm size, making them impractical for large swarms. Hence, in this work, we propose a new approach for modeling robotic swarms and robotic networks by considering them as mixed quantum states that can be represented mathematically via density matrices. The size of such an approach only depends on the available degrees of freedom of the robot, and not its swarm size and thus scales well to large swarms. Moreover, it also enables the extraction of local information of the robots from the global swarm information contained in the density matrices, facilitating decentralized behavior that aligns with the collective swarm behavior. Our approach is validated on several simulations including large-scale swarms of up to 1000 robots. Finally, we provide some directions for future research that could potentially widen the impact of our approach.
The increasing convergence of quantum computing (QC) and advanced robotic control is giving rise to a new class of intelligent automation systems. Utilizing quantum-inspired computational principles, contemporary robotic platforms demonstrate greater optimization efficiency, superior perceptual processing, and improved decision-making performance. This survey outlines the principal quantum-oriented control methodologies utilized in robotics, with particular emphasis on approaches that incorporate Quantum Neural Networks (QNN), Quantum Machine Learning (QML), and Quantum-behaved Particle Swarm Optimization (QPSO). The investigation systematically reviews recent advances in quantum-assisted adaptive control, trajectory planning, and optimization frameworks, spotlighting their contributions to improved robustness, precision, and energy efficiency. By analyzing research in quantum reinforcement learning, distributed Noisy Intermediate-Scale Quantum (NISQ) computing, and hybrid quantum-classical approaches, this review clarifies how quantum principles are transforming both theoretical and practical aspects of robotic control. Likewise, several real-world implementations ranging from industrial manipulators to autonomous and cognitive robotic systems demonstrate the growing feasibility of quantum-enhanced decision-making. The review concludes that while remarkable progress has been made in quantum-inspired control for robotics, most existing studies remain constrained to simulations with restricted experimental validation on physical platforms. Addressing this gap will be essential in future research to transition from theoretical and simulated models toward hardware-level implementations, enabling the realization of scalable, fault-tolerant quantum control architectures.
Autonomous mobile robots are being used increasingly as consumer devices around the globe, such as for fetching items and cleaning purposes, to name a few, in households and industries. Such robots are being employed to traverse a set of target locations and provide the necessary services. In a 2-dimensional environment, these robots are required to traverse following a Hamiltonian path to reduce energy consumption and time requirements. This problem can be formulated as a Travelling Salesman Problem (TSP), an NP-hard problem. Moreover, upon urgent requirements, these robots must traverse in real-time, demanding speedy path planning from the TSP instance. Among the well-known optimization techniques for solving the TSP problem, Ant Colony Optimization has a good stronghold in providing good approximate solutions. Moreover, ACO not only provides near-optimal solutions for TSP instances but can also output optimal or near-optimal solutions for many other demanding hard optimization problems. However, most of the implementations of Ant Colony Optimization on quantum or hybrid quantum architecture proposed in the literature require conversion of classical data to qubits before being fed to the algorithm, and cannot be automated. But quantum-enabled mobile robots require automated path formation after receiving the commands from the environment. The novelties of the proposed work are many-fold. Firstly, the proposed work allows ACO to be applied as its classical counterparts, allowing automation in path formation in quantum-enabled mobile robots. Secondly, this allows a new way of incorporating quantum processing unit in the research of quantum-enabled mobile robots. Researchers around the globe have been trying to incorporate quantum computing in autonomous mobile robots, and true to the best of authors’ knowledge, no work in path planning for multiple targets in quantum-enabled mobile robots have been found in literature. Thirdly, quantum processing unit has been applied at exactly that point where it will be most useful, as in NISQ era quantum computer is not reliable for arithmetic processing. Simulation results of the proposed Hybrid Quantum Ant Colony Optimization algorithm on several TSP instances have shown promising results with average error percentage from optimumresults of only 6.985%. Hence, it is expected that the proposed work to be important in future research of fusing the two rising domains of quantum computing and autonomous mobile robots.