Abstract

H. Xu, K. Sun, S. Koenig, I. Hen and S. Kumar. Hybrid Quantum-Classical Algorithms for Solving the Weighted CSP. In Proceedings of the International Symposium on Artificial Intelligence and Mathematics (ISAIM), 2020.

Abstract: Many kinds of algorithms have been developed for solving the constraint satisfaction problem (WCSP), a combinatorial optimization problem that frequently appears in AI. Unfortunately, its NP-hardness prohibits the existence of an algorithm for solving it that is universally efficient on classical computers. Therefore, a peek into quantum computers may be imperative for solving the WCSP efficiently. In this paper, we focus on a specific type of quantum computer, called the quantum annealer, which approximately solves quadratic unconstrained binary optimization (QUBO) problems. We propose the first three hybrid quantum-classical algorithms (HQCAs) for the WCSP: one specifically for the binary Boolean WCSP and the other two for the general WCSP. We experimentally show that the HQCA based on simple polynomial reformulation works well on the binary Boolean WCSP, but the HQCA based on the constraint composite graph works best on the general WCSP.

Download the paper in pdf.

Many publishers do not want authors to make their papers available electronically after the papers have been published. Please use the electronic versions provided here only if hardcopies are not yet available. If you have comments on any of these papers, please send me an email! Also, please send me your papers if we have common interests.


This page was automatically created by a bibliography maintenance system that was developed as part of an undergraduate research project, advised by Sven Koenig.