An Optimization Case Study for solving a Transport Robot Scheduling Problem on Quantum-Hybrid and Quantum-Inspired Hardware
arXiv:2309.09736 · doi:10.1038/s41598-023-45668-1
Abstract
We present a comprehensive case study comparing the performance of D-Waves' quantum-classical hybrid framework, Fujitsu's quantum-inspired digital annealer, and Gurobi's state-of-the-art classical solver in solving a transport robot scheduling problem. This problem originates from an industrially relevant real-world scenario. We provide three different models for our problem following different design philosophies. In our benchmark, we focus on the solution quality and end-to-end runtime of different model and solver combinations. We find promising results for the digital annealer and some opportunities for the hybrid quantum annealer in direct comparison with Gurobi. Our study provides insights into the workflow for solving an application-oriented optimization problem with different strategies, and can be useful for evaluating the strengths and weaknesses of different approaches.
References in corpus (12)
- Ising formulations of many NP problems
- A Quantum Approximate Optimization Algorithm
- Quantum Chemistry in the Age of Quantum Computing
- Quantum Optimization of Maximum Independent Set using Rydberg Atom Arrays
- Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer
- Quantum Computer Systems for Scientific Discovery
- Demonstration of a scaling advantage for a quantum annealer over simulated annealing
- A Tutorial on Formulating and Using QUBO Models
- Application of Quantum Annealing to Nurse Scheduling Problem
- Benchmark of quantum-inspired heuristic solvers for quadratic unconstrained binary optimization
- Beating classical heuristics for the binary paint shop problem with the quantum approximate optimization algorithm
- Hybrid quantum annealing for larger-than-QPU lattice-structured problems