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

Robot localization aided by quantum algorithms

Unai Antero, Basilio Sierra, Jon Oñativia, Alejandra Ruíz, Eneko Osaba

Published Apr 26, 2025• 2 citations
Publisher

Abstract

Localization is a critical aspect of mobile robotics, enabling robots to navigate their environment efficiently and avoid obstacles. Current probabilistic localization methods , such as the Adaptive Monte Carlo localization (AMCL) algorithm, are computationally intensive and may struggle with large maps or high resolution sensor data. This paper explores the application of quantum computing in robotics, focusing on the use of Grover’s search algorithm to improve the efficiency of localization in mobile robots. We propose a novel approach to utilize Grover’s algorithm in a 2D map, enabling faster and more efficient localization. Despite the limitations of current physical quantum computers , our experimental results demonstrate a significant speedup over classical methods, highlighting the potential of quantum computing to improve robotic localization. This work bridges the gap between quantum computing and robotics, providing a practical solution for robotic localization and paving the way for future research in quantum robotics.

DOI
10.1016/j.robot.2025.105026

Related papers

Robot localization aided by quantum algorithms

Unai Antero, Basilio Sierra, Jon Oñativia +2 more

Localization is a critical aspect of mobile robotics, enabling robots to navigate their environment efficiently and avoid obstacles. Current probabilistic localization methods, such as the Adaptive-Monte Carlo localization (AMCL) algorithm, are computationally intensive and may struggle with large maps or high-resolution sensor data. This paper explores the application of quantum computing in robotics, focusing on the use of Grover's search algorithm to improve the efficiency of localization in mobile robots. We propose a novel approach to utilize Grover's algorithm in a 2D map, enabling faster and more efficient localization. Despite the limitations of current physical quantum computers, our experimental results demonstrate a significant speedup over classical methods, highlighting the potential of quantum computing to improve robotic localization. This work bridges the gap between quantum computing and robotics, providing a practical solution for robotic localization and paving the way for future research in quantum robotics.

arXiv:2502.00077•Jan 31, 2025•0 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 Machine Learning for Robotics: A Comprehensive Review of Algorithms, Applications, and Future Directions

Hassen Nigatu

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.

•Jan 5, 2026•0 citations

Quantum-Enhanced Constraint Propagation for Robotics

Jincheng Zhang

This paper explores the application of quantum computing to enhance constraint propagation within robotics. Conventional constraint propagation algorithms struggle with complex environments, often requiring extensive simulations. We propose a novel quantum-enhanced technique that leverages quantum algorithms to efficiently explore potential trajectories and constraints, resulting in improved motion planning and robustness. The core mechanism involves utilizing quantum annealing to accelerate the search for optimal solutions, leading to more efficient and robust motion planning. The research focuses on the potential of quantum computing to overcome the limitations of existing constraint propagation methods, specifically addressing challenges in dynamic environments and high-dimensional constraints. We present a preliminary analysis demonstrating improvements in planning efficiency and robustness compared to classical methods.

•Sep 3, 2026•0 citations

Quantum-Driven Constraint Optimization for Robotics

Jincheng Zhang

This paper investigates the application of quantum-enhanced constraint optimization to robotics, specifically focusing on dynamic adjustment of robot control parameters to maximize task performance. Traditional optimization methods often struggle with complex, dynamic environments, and quantum computing offers the potential for significant speed-ups in solving optimization problems. We propose a novel algorithm leveraging a quantum-inspired optimization technique – specifically, a modified version of Grover's algorithm – to rapidly identify optimal control parameters. The core claim is that this algorithm can dramatically improve the efficiency and responsiveness of robotic systems, particularly in tasks requiring real-time adaptation. This work demonstrates the feasibility of using quantum mechanics principles to accelerate optimization processes, ultimately enabling more sophisticated and adaptable robotic control.

•Sep 6, 2026•0 citations

Quantum-Driven Constraint Optimization for Complex Robotics

Jincheng Zhang

This paper investigates the potential of quantum computing to revolutionize complex robotics, specifically focusing on optimization of robot control and movement. Traditional robotic control systems often struggle with complex environments and constraints, limiting the ability to achieve optimal performance. We propose a novel quantum algorithm designed to address these challenges by leveraging a dynamic, quantum-based simulation of the physical environment to generate constraints. This approach aims to enable robots to navigate and manipulate objects with unprecedented precision and adaptability. The core mechanism centers on utilizing a quantum solver to efficiently explore the search space of possible robot motions, guided by the simulation's feedback. This contrasts with traditional methods, which often struggle with the high dimensionality and complexity of robot dynamics. The research demonstrates the feasibility of this quantum-driven approach through simulations and preliminary experiments, showcasing potential improvements in robot control and movement.

•Sep 3, 2026•0 citations
Localization is a critical aspect of mobile robotics, enabling robots to navigate their environment efficiently and avoid obstacles. Current probabilistic localization methods , such as the Adaptive Monte Carlo localization (AMCL) algorithm, are computationally intensive and may struggle with large maps or high resolution sensor data. This paper explores the application of quantum computing in robotics, focusing on the use of Grover’s search algorithm to improve the efficiency of localization in mobile robots. We propose a novel approach to utilize Grover’s algorithm in a 2D map, enabling faster and more efficient localization. Despite the limitations of current physical quantum computers , our experimental results demonstrate a significant speedup over classical methods, highlighting the potential of quantum computing to improve robotic localization. This work bridges the gap between quantum computing and robotics, providing a practical solution for robotic localization and paving the way for future research in quantum robotics.
Localization is a critical aspect of mobile robotics, enabling robots to navigate their environment efficiently and avoid obstacles. Current probabilistic localization methods, such as the Adaptive-Monte Carlo localization (AMCL) algorithm, are computationally intensive and may struggle with large maps or high-resolution sensor data. This paper explores the application of quantum computing in robotics, focusing on the use of Grover's search algorithm to improve the efficiency of localization in mobile robots. We propose a novel approach to utilize Grover's algorithm in a 2D map, enabling faster and more efficient localization. Despite the limitations of current physical quantum computers, our experimental results demonstrate a significant speedup over classical methods, highlighting the potential of quantum computing to improve robotic localization. This work bridges the gap between quantum computing and robotics, providing a practical solution for robotic localization and paving the way for future research in quantum robotics.
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.
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.
This paper explores the application of quantum computing to enhance constraint propagation within robotics. Conventional constraint propagation algorithms struggle with complex environments, often requiring extensive simulations. We propose a novel quantum-enhanced technique that leverages quantum algorithms to efficiently explore potential trajectories and constraints, resulting in improved motion planning and robustness. The core mechanism involves utilizing quantum annealing to accelerate the search for optimal solutions, leading to more efficient and robust motion planning. The research focuses on the potential of quantum computing to overcome the limitations of existing constraint propagation methods, specifically addressing challenges in dynamic environments and high-dimensional constraints. We present a preliminary analysis demonstrating improvements in planning efficiency and robustness compared to classical methods.
This paper investigates the application of quantum-enhanced constraint optimization to robotics, specifically focusing on dynamic adjustment of robot control parameters to maximize task performance. Traditional optimization methods often struggle with complex, dynamic environments, and quantum computing offers the potential for significant speed-ups in solving optimization problems. We propose a novel algorithm leveraging a quantum-inspired optimization technique – specifically, a modified version of Grover's algorithm – to rapidly identify optimal control parameters. The core claim is that this algorithm can dramatically improve the efficiency and responsiveness of robotic systems, particularly in tasks requiring real-time adaptation. This work demonstrates the feasibility of using quantum mechanics principles to accelerate optimization processes, ultimately enabling more sophisticated and adaptable robotic control.
This paper investigates the potential of quantum computing to revolutionize complex robotics, specifically focusing on optimization of robot control and movement. Traditional robotic control systems often struggle with complex environments and constraints, limiting the ability to achieve optimal performance. We propose a novel quantum algorithm designed to address these challenges by leveraging a dynamic, quantum-based simulation of the physical environment to generate constraints. This approach aims to enable robots to navigate and manipulate objects with unprecedented precision and adaptability. The core mechanism centers on utilizing a quantum solver to efficiently explore the search space of possible robot motions, guided by the simulation's feedback. This contrasts with traditional methods, which often struggle with the high dimensionality and complexity of robot dynamics. The research demonstrates the feasibility of this quantum-driven approach through simulations and preliminary experiments, showcasing potential improvements in robot control and movement.