Performing fully parallel constraint logic programming on a quantum annealer

Journal Article · 06 May 2018 · Theory and Practice of Logic Programming

DOI: https://doi.org/10.1017/S1471068418000066 · OSTI ID:1459821

Pakin, Scott  ^[1]

---

1. Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

A quantum annealer exploits quantum effects to solve a particular type of optimization problem. The advantage of this specialized hardware is that it effectively considers all possible solutions in parallel, thereby potentially outperforming classical computing systems. However, despite quantum annealers having recently become commercially available, there are relatively few high-level programming models that target these devices. In this article, we show how to compile a subset of Prolog enhanced with support for constraint logic programming into a two-local Ising-model Hamiltonian suitable for execution on a quantum annealer. In particular, we describe the series of transformations one can apply to convert constraint logic programs expressed in Prolog into an executable form that bears virtually no resemblance to a classical machine model yet that evaluates the specified constraints in a fully parallel manner. We evaluate our efforts on a 1,095-qubit D-Wave 2X quantum annealer and describe the approach's associated capabilities and shortcomings.

• Research Organization: Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
• Sponsoring Organization: USDOE Laboratory Directed Research and Development (LDRD) Program
• Grant/Contract Number: AC52-06NA25396; 89233218CNA000001
• OSTI ID: 1459821
• Alternate ID(s): OSTI ID: 1492667
• Report Number(s): LA-UR-17-22721; LA-UR-18-25614
• Journal Information: Theory and Practice of Logic Programming, Vol. 18, Issue 5-6; ISSN 1471-0684
• Publisher: Cambridge University PressCopyright Statement
• Country of Publication: United States
• Language: English