Journal
EPJ QUANTUM TECHNOLOGY
Volume 9, Issue 1, Pages -Publisher
SPRINGER
DOI: 10.1140/epjqt/s40507-022-00123-4
Keywords
Combinatorial optimization; Variational quantum algorithms; Heuristics; Quantum hardware
Ask authors/readers for more resources
In this study, four variational quantum heuristics were applied to the job shop scheduling problem on IBM's superconducting quantum processors. The results showed that the filtering variational quantum eigensolver (F-VQE) outperformed other algorithms in terms of convergence speed and sampling the global optimum.
Combinatorial optimization models a vast range of industrial processes aiming at improving their efficiency. In general, solving this type of problem exactly is computationally intractable. Therefore, practitioners rely on heuristic solution approaches. Variational quantum algorithms are optimization heuristics that can be demonstrated with available quantum hardware. In this case study, we apply four variational quantum heuristics running on IBM's superconducting quantum processors to the job shop scheduling problem. Our problem optimizes a steel manufacturing process. A comparison on 5 qubits shows that the recent filtering variational quantum eigensolver (F-VQE) converges faster and samples the global optimum more frequently than the quantum approximate optimization algorithm (QAOA), the standard variational quantum eigensolver (VQE), and variational quantum imaginary time evolution (VarQITE). Furthermore, F-VQE readily solves problem sizes of up to 23 qubits on hardware without error mitigation post processing.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available