Multi-disk clutch optimization using quantum annealing

Abstract

In this work, we develop a new quantum algorithm to solve a combinatorial problem with significant practical relevance occurring in clutch manufacturing. It is demonstrated how quantum optimization can play a role in real industrial applications in the manufacturing sector. Using the quantum annealer provided by D-Wave Systems, we analyze the performance of the quantum and quantum-classical hybrid solvers and compare them to deterministic- and random-algorithm classical benchmark solvers. The continued evolution of the quantum technology, indicating an expectation for even greater relevance in the future is discussed and the revolutionary potential it could have in the manufacturing sector is highlighted.

11 pages, 4 figures

References in corpus (15)

• Adiabatic Quantum Computing
• Quantum computing for finance: overview and prospects
• A Hybrid Solution Method for the Capacitated Vehicle Routing Problem Using a Quantum Annealer
• Dynamic Portfolio Optimization with Real Datasets Using Quantum Processors and Quantum-Inspired Tensor Networks
• Power of Pausing: Advancing Understanding of Thermalization in Experimental Quantum Annealers
• Domain wall encoding of discrete variables for quantum annealing and QAOA
• Unconstrained Binary Models of the Travelling Salesman Problem Variants for Quantum Optimization
• Pegasus: The second connectivity graph for large-scale quantum annealing hardware
• Optimal Control of Traffic Signals using Quantum Annealing
• Quantum Computing: Towards Industry Reference Problems
• Quantum Shuttle: Traffic Navigation with Quantum Computing
• Beating classical heuristics for the binary paint shop problem with the quantum approximate optimization algorithm
• Quantum speedup of the Travelling Salesman Problem for bounded-degree graphs
• Understanding domain-wall encoding theoretically and experimentally
• Architectural considerations in the design of a third-generation superconducting quantum annealing processor