Postprocessing Variationally Scheduled Quantum Algorithm for Constrained Combinatorial Optimization Problems

• Published in: IEEE transactions on quantum engineering Vol. 5; pp. 1 - 14
• Main Authors: Shirai, Tatsuhiko, Togawa, Nozomu
• Format: Journal Article
• Language: English
• Published: New York The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2024; IEEE
• Subjects: Algorithms; Annealing; Combinatorial analysis; Combinatorial optimization problem (COP); Constraints; Greedy algorithms; Ising model; Knapsack problem; metaheuristics; Optimization; quantum device; Variational methods; variational quantum algorithm
• ISSN: 2689-1808; 2689-1808
• DOI: 10.1109/TQE.2024.3376721

In this article, we propose a postprocessing variationally scheduled quantum algorithm (pVSQA) for solving constrained combinatorial optimization problems (COPs). COPs are typically transformed into ground-state search problems of the Ising model on a quantum annealer or gate-based quantum device. Variational methods are used to find an optimal schedule function that leads to high-quality solutions in a short amount of time. Postprocessing techniques convert the output solutions of the quantum devices to satisfy the constraints of the COPs. The pVSQA combines the variational methods and the postprocessing technique. We obtain a sufficient condition for constrained COPs to apply the pVSQA based on a greedy postprocessing algorithm. We apply the proposed method to two constrained NP-hard COPs: the graph partitioning problem and the quadratic knapsack problem. The pVSQA on a simulator shows that a small number of variational parameters is sufficient to achieve a (near-) optimal performance within a predetermined operation time. Then, building upon the simulator results, we implement the pVSQA on a quantum annealer and a gate-based quantum device. The experimental results demonstrate the effectiveness of our proposed method.