|Mapping constrained optimization problems to quantum annealing with application to fault diagnosis
|Year of Publication
|Bian, Z, Chudak, F, Israel, R, Lackey, B, Macready, WG, Roy, A
Current quantum annealing (QA) hardware suffers from practical limitations such as finite temperature, sparse connectivity, small qubit numbers, and control error. We propose new algorithms for mapping boolean constraint satisfaction problems (CSPs) onto QA hardware mitigating these limitations. In particular we develop a new embedding algorithm for mapping a CSP onto a hardware Ising model with a fixed sparse set of interactions, and propose two new decomposition algorithms for solving problems too large to map directly into hardware.