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

International Conference on High Performance Computing in Asia-Pacific Region (HPC Asia)

Towards Real Time Multi-robot Routing using Quantum Computing Technologies

James Clark, Tristan West, Joseph Paul Zammit, Xiaohu Guo, Luke Mason, Duncan Russell

Published Jan 14, 2019• 27 citations
Publisher

Abstract

In this paper, we investigate the potential for current quantum computing technologies to provide good solutions to the NP-hard problem of routing multiple robots on a grid in real time. A hybrid quantum-classical approach has been presented in detail. Classical computation is used to generate candidate paths, while quantum annealing is used to select the optimal combination of paths. This second process is generally the most time consuming when performed clasically. The performance is benchmarked classically and on a D-Wave 2000Q with up to 200 robots and has shown that producing valid solutions for the problem of multi-robot routing is achievable with the current quantum annealing technology. The current limitations of using quantum annealing are also discussed.

DOI
10.1145/3293320.3293333

Related papers

Optimizing Multi-Path Routing in Large-Scale Quantum Networks Using Quantum Annealing

Parker Jones, Vini Chaudhary

This paper evaluates quantum annealing as a potential method for solving multi-path routing in large-scale quantum communication networks. The routing problem was formulated as a quadratic unconstrained binary optimization (QUBO) problem that minimizes negative throughput while satisfying quantum network constraints. The experimental framework tests four solution approaches on randomly generated networks: (1) the classical quantum fidelity rate maximizing (Q-FiRM) algorithm, (2) classical simulated annealing, (3) D-Wave hybrid solver, and (4) pure quantum annealing on D-Wave Advantage2 hardware. Results show that while quantum annealers produce feasible solutions, the classical Q-FiRM algorithm achieves superior throughput and faster computation times for this problem class. Among QUBO approaches, hybrid solvers demonstrate computational advantages over pure classical simulated annealing while maintaining comparable solution quality. These findings provide practical insight into the current capabilities and limitations of quantum optimization for quantum internet infrastructure design.

IEEE SoutheastCon•Feb 20, 2026•0 citations

A Study on Dynamic Optimization Methods of Annealing Coefficients in Quantum Computing

Guixiang JIN, Zhe Jin, Hiroaki MATSUKAWA

Quantum computing has emerged as a promising computational paradigm with the potential to solve problems that are intractable for classical computers. This paper provides an overview of the current state of quantum computing, including its historical development, hardware advancements, applications, and challenges. Special attention is given to combinatorial optimization, which is considered one of the most promising application domains. The limitations of current quantum systems and future research directions are also discussed. This paper presents a comparative study between a conventional D-Wave-based simulated annealing approach and a proposed hybrid optimization model for solving largescale combinatorial optimization problems. The study focuses on benchmark problems, including AES, TSP gr24, and a real-world load balancing problem, all formulated as QUBO models. The D-Wave approach employs the dwave-neal simulated annealing engine with various parameter settings, while the proposed model introduces a decomposition-based framework combined with adaptive parameter control and iterative refinement. The experimental results demonstrate that the proposed model consistently outperforms the conventional approach in terms of solution quality, achieving significantly lower energy values across all problem instances. In particular, for the TSP gr24 problem, the proposed model achieves near-optimal solutions with substantially reduced computation time. For large-scale problems such as AES and load balancing, the proposed model maintains scalability and robustness, whereas the conventional approach suffers from increased computational cost and performance degradation. Although the proposed method introduces additional computational steps, its hybrid structure effectively mitigates limitations related to local minima, parameter sensitivity, and scalability. These findings indicate that integrating classical optimization techniques with quantum-inspired methods is essential for practical applications. The proposed model provides a promising framework for solving complex real-world optimization problems and highlights the importance of hybrid approaches in advancing quantum annealing technologies.

Innovation and supply chain management•Mar 31, 2026•0 citations

A Quantum Computing Approach for Multi-robot Coverage Path Planning

Poojith U Rao, Florian Speelman, Balwinder Sodhi +1 more

This paper tackles the multi-vehicle Coverage Path Planning (CPP) problem, crucial for applications like search and rescue or environmental monitoring. Due to its NP-hard nature, finding optimal solutions becomes infeasible with larger problem sizes. This motivates the development of heuristic approaches that enhance efficiency even marginally. We propose a novel approach for exploring paths in a 2D grid, specifically designed for easy integration with the Quantum Alternating Operator Ansatz (QAOA), a powerful quantum heuristic. Our contribution includes: 1) An objective function tailored to solve the multi-vehicle CPP using QAOA. 2) Theoretical proofs guaranteeing the validity of the proposed approach. 3) Efficient construction of QAOA operators for practical implementation. 4) Resource estimation to assess the feasibility of QAOA execution. 5) Performance comparison against established algorithms like the Depth First Search. This work paves the way for leveraging quantum computing in optimizing multi-vehicle path planning, potentially leading to real-world advancements in various applications.

arXiv:2407.08767•Jul 11, 2024•4 citations

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

Traffic Flow Optimization Using a Quantum Annealer

Florian Neukart, G. Compostella, Christian Seidel +3 more

Quantum annealing algorithms belong to the class of meta-heuristic tools, applicable for solving binary optimization problems. Hardware implementations of quantum annealing, such as the quantum processing units (QPUs) produced by D-Wave Systems, have been subject to multiple analyses in research, with the aim of characterizing the technology's usefulness for optimization and sampling tasks. In this paper, we present a real-world application that uses quantum technologies. Specifically, we show how to map certain parts of a real-world traffic flow optimization problem to be suitable for quantum annealing. We show that time-critical optimization tasks, such as continuous redistribution of position data for cars in dense road networks, are suitable candidates for quantum computing. Due to the limited size and connectivity of current-generation D-Wave QPUs, we use a hybrid quantum and classical approach to solve the traffic flow problem.

arXiv:1708.01625•Frontiers in ICT•Dec 19, 2017•516 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
In this paper, we investigate the potential for current quantum computing technologies to provide good solutions to the NP-hard problem of routing multiple robots on a grid in real time. A hybrid quantum-classical approach has been presented in detail. Classical computation is used to generate candidate paths, while quantum annealing is used to select the optimal combination of paths. This second process is generally the most time consuming when performed clasically. The performance is benchmarked classically and on a D-Wave 2000Q with up to 200 robots and has shown that producing valid solutions for the problem of multi-robot routing is achievable with the current quantum annealing technology. The current limitations of using quantum annealing are also discussed.
This paper evaluates quantum annealing as a potential method for solving multi-path routing in large-scale quantum communication networks. The routing problem was formulated as a quadratic unconstrained binary optimization (QUBO) problem that minimizes negative throughput while satisfying quantum network constraints. The experimental framework tests four solution approaches on randomly generated networks: (1) the classical quantum fidelity rate maximizing (Q-FiRM) algorithm, (2) classical simulated annealing, (3) D-Wave hybrid solver, and (4) pure quantum annealing on D-Wave Advantage2 hardware. Results show that while quantum annealers produce feasible solutions, the classical Q-FiRM algorithm achieves superior throughput and faster computation times for this problem class. Among QUBO approaches, hybrid solvers demonstrate computational advantages over pure classical simulated annealing while maintaining comparable solution quality. These findings provide practical insight into the current capabilities and limitations of quantum optimization for quantum internet infrastructure design.
Quantum computing has emerged as a promising computational paradigm with the potential to solve problems that are intractable for classical computers. This paper provides an overview of the current state of quantum computing, including its historical development, hardware advancements, applications, and challenges. Special attention is given to combinatorial optimization, which is considered one of the most promising application domains. The limitations of current quantum systems and future research directions are also discussed. This paper presents a comparative study between a conventional D-Wave-based simulated annealing approach and a proposed hybrid optimization model for solving largescale combinatorial optimization problems. The study focuses on benchmark problems, including AES, TSP gr24, and a real-world load balancing problem, all formulated as QUBO models. The D-Wave approach employs the dwave-neal simulated annealing engine with various parameter settings, while the proposed model introduces a decomposition-based framework combined with adaptive parameter control and iterative refinement. The experimental results demonstrate that the proposed model consistently outperforms the conventional approach in terms of solution quality, achieving significantly lower energy values across all problem instances. In particular, for the TSP gr24 problem, the proposed model achieves near-optimal solutions with substantially reduced computation time. For large-scale problems such as AES and load balancing, the proposed model maintains scalability and robustness, whereas the conventional approach suffers from increased computational cost and performance degradation. Although the proposed method introduces additional computational steps, its hybrid structure effectively mitigates limitations related to local minima, parameter sensitivity, and scalability. These findings indicate that integrating classical optimization techniques with quantum-inspired methods is essential for practical applications. The proposed model provides a promising framework for solving complex real-world optimization problems and highlights the importance of hybrid approaches in advancing quantum annealing technologies.
This paper tackles the multi-vehicle Coverage Path Planning (CPP) problem, crucial for applications like search and rescue or environmental monitoring. Due to its NP-hard nature, finding optimal solutions becomes infeasible with larger problem sizes. This motivates the development of heuristic approaches that enhance efficiency even marginally. We propose a novel approach for exploring paths in a 2D grid, specifically designed for easy integration with the Quantum Alternating Operator Ansatz (QAOA), a powerful quantum heuristic. Our contribution includes: 1) An objective function tailored to solve the multi-vehicle CPP using QAOA. 2) Theoretical proofs guaranteeing the validity of the proposed approach. 3) Efficient construction of QAOA operators for practical implementation. 4) Resource estimation to assess the feasibility of QAOA execution. 5) Performance comparison against established algorithms like the Depth First Search. This work paves the way for leveraging quantum computing in optimizing multi-vehicle path planning, potentially leading to real-world advancements in various applications.
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.
Quantum annealing algorithms belong to the class of meta-heuristic tools, applicable for solving binary optimization problems. Hardware implementations of quantum annealing, such as the quantum processing units (QPUs) produced by D-Wave Systems, have been subject to multiple analyses in research, with the aim of characterizing the technology's usefulness for optimization and sampling tasks. In this paper, we present a real-world application that uses quantum technologies. Specifically, we show how to map certain parts of a real-world traffic flow optimization problem to be suitable for quantum annealing. We show that time-critical optimization tasks, such as continuous redistribution of position data for cars in dense road networks, are suitable candidates for quantum computing. Due to the limited size and connectivity of current-generation D-Wave QPUs, we use a hybrid quantum and classical approach to solve the traffic flow problem.
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.