Solving Complex Combinatorial Optimization Problems Using Quantum Annealing Approaches

Currently, state-of-the-art approaches to solving complex optimization problems have focused solely on methods requiring high computational time and unable to find the global optimal solution. In this work, a methodology based on quantum computing is presented to overcome these drawbacks. The novelty of this framework stems from the quantum computer�s architecture and taking into consideration the quantum phenomena that take place to solve optimization problems with specific structure. The proposed methodology includes steps for the transformation of the initial optimization problem into an unconstrainted optimization problem with binary variables and its embedding onto a quantum device. Moreover, different resolution levels for the transformation step and different architectures for the embedding process are utilized. To illustrate the procedure, a case study based on Haverly�s pooling and blending problem is examined while demonstrating the potential of the proposed approach. The results indicate that the succinct formulation exhibited higher success rate during the embedding procedure for the different examined architectures, and the quantum annealing solver exhibited the best performance among the various solvers investigated. This highlights the potential of the approach for solving this type of problems with the rapid development and improvement of quantum hardware and expanding it to more complex chemical engineering optimization systems.