Inductive Construction of Variational Quantum Circuit for Constrained Combinatorial Optimization
Hyakka Nakada, Kotaro Tanahashi, Shu Tanaka

TL;DR
This paper introduces an inductive method for constructing variational quantum circuits capable of solving constrained combinatorial optimization problems, expanding the range of constraints that can be efficiently handled.
Contribution
It proposes a novel inductive circuit construction technique that manages complex constraints in variational quantum algorithms for optimization.
Findings
Increased probability of measuring feasible or optimal solutions.
Circuit complexity comparable to conventional variational circuits.
Effective application to facility location problem.
Abstract
In this study, we propose a new method for constrained combinatorial optimization using variational quantum circuits. Quantum computers are considered to have the potential to solve large combinatorial optimization problems faster than classical computers. Variational quantum algorithms, such as Variational Quantum Eigensolver (VQE), have been studied extensively because they are expected to work on noisy intermediate scale devices. Unfortunately, many optimization problems have constraints, which induces infeasible solutions during VQE process. Recently, several methods for efficiently solving constrained combinatorial optimization problems have been proposed by designing a quantum circuit so as to output only the states that satisfy the constraints. However, the types of available constraints are still limited. Therefore, we have started to develop variational quantum circuits that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata
