Mapping Constraint Problems onto Quantum Gate and Annealing Devices
Ellis Wilson, Frank Mueller, Scott Pakin · 2021
This work presents NchooseK, a unified programming model for constraint satisfaction problems that can be mapped to both quantum circuit and annealing devices through Quadratic Unconstrained Binary Operators (QUBOs). Our mapping provides an approachable and effective way to program both types of quantum computers. We provide examples of NchooseK being used.