Performing fully parallel constraint logic programming on a quantum annealer
Abstract
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 highlevel 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 twolocal Isingmodel 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,095qubit DWave 2X quantum annealer and describe the approach's associated capabilities and shortcomings.
 Authors:

 Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
 Publication Date:
 Research Org.:
 Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
 Sponsoring Org.:
 USDOE Laboratory Directed Research and Development (LDRD) Program
 OSTI Identifier:
 1459821
 Alternate Identifier(s):
 OSTI ID: 1492667
 Report Number(s):
 LAUR1722721; LAUR1825614
Journal ID: ISSN 14710684
 Grant/Contract Number:
 AC5206NA25396; 89233218CNA000001
 Resource Type:
 Accepted Manuscript
 Journal Name:
 Theory and Practice of Logic Programming
 Additional Journal Information:
 Journal Volume: 18; Journal Issue: 56; Journal ID: ISSN 14710684
 Publisher:
 Cambridge University Press
 Country of Publication:
 United States
 Language:
 English
 Subject:
 97 MATHEMATICS AND COMPUTING; quantum annealing; quantum computing; constraint logic programming; Prolog; DWave; Computer Science
Citation Formats
Pakin, Scott. Performing fully parallel constraint logic programming on a quantum annealer. United States: N. p., 2018.
Web. https://doi.org/10.1017/S1471068418000066.
Pakin, Scott. Performing fully parallel constraint logic programming on a quantum annealer. United States. https://doi.org/10.1017/S1471068418000066
Pakin, Scott. Sun .
"Performing fully parallel constraint logic programming on a quantum annealer". United States. https://doi.org/10.1017/S1471068418000066. https://www.osti.gov/servlets/purl/1459821.
@article{osti_1459821,
title = {Performing fully parallel constraint logic programming on a quantum annealer},
author = {Pakin, Scott},
abstractNote = {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 highlevel 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 twolocal Isingmodel 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,095qubit DWave 2X quantum annealer and describe the approach's associated capabilities and shortcomings.},
doi = {10.1017/S1471068418000066},
journal = {Theory and Practice of Logic Programming},
number = 56,
volume = 18,
place = {United States},
year = {2018},
month = {5}
}
Web of Science
Works referenced in this record:
ScaffCC: Scalable compilation and analysis of quantum programs
journal, June 2015
 JavadiAbhari, Ali; Patil, Shruti; Kudrow, Daniel
 Parallel Computing, Vol. 45
Quantum annealing in the transverse Ising model
journal, November 1998
 Kadowaki, Tadashi; Nishimori, Hidetoshi
 Physical Review E, Vol. 58, Issue 5
Quantum mechanical computers
journal, June 1986
 Feynman, Richard P.
 Foundations of Physics, Vol. 16, Issue 6
On the computational complexity of Ising spin glass models
journal, October 1982
 Barahona, F.
 Journal of Physics A: Mathematical and General, Vol. 15, Issue 10
Quantum annealing with manufactured spins
journal, May 2011
 Johnson, M. W.; Amin, M. H. S.; Gildert, S.
 Nature, Vol. 473, Issue 7346
Analog analogue of a digital quantum computation
journal, April 1998
 Farhi, Edward; Gutmann, Sam
 Physical Review A, Vol. 57, Issue 4
Optimization by Simulated Annealing
journal, May 1983
 Kirkpatrick, S.; Gelatt, C. D.; Vecchi, M. P.
 Science, Vol. 220, Issue 4598
PolynomialTime Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
journal, January 1999
 Shor, Peter W.
 SIAM Review, Vol. 41, Issue 2
On Complexity of the Quantum Ising Model
journal, November 2016
 Bravyi, Sergey; Hastings, Matthew
 Communications in Mathematical Physics, Vol. 349, Issue 1
A MachineOriented Logic Based on the Resolution Principle
journal, January 1965
 Robinson, J. A.
 Journal of the ACM, Vol. 12, Issue 1
SWIProlog
journal, September 2011
 Wielemaker, Jan; Schrijvers, Tom; Triska, Markus
 Theory and Practice of Logic Programming, Vol. 12, Issue 12
Quantum annealing: A new method for minimizing multidimensional functions
journal, March 1994
 Finnila, A. B.; Gomez, M. A.; Sebenik, C.
 Chemical Physics Letters, Vol. 219, Issue 56
Minorembedding in adiabatic quantum computation: I. The parameter setting problem
journal, September 2008
 Choi, Vicky
 Quantum Information Processing, Vol. 7, Issue 5
Exponential complexity of the quantum adiabatic algorithm for certain satisfiability problems
journal, December 2011
 Hen, Itay; Young, A. P.
 Physical Review E, Vol. 84, Issue 6
Architectural Considerations in the Design of a Superconducting Quantum Annealing Processor
journal, August 2014
 Bunyk, P. I.; Hoskinson, Emile M.; Johnson, Mark W.
 IEEE Transactions on Applied Superconductivity, Vol. 24, Issue 4
Quipper: a scalable quantum programming language
conference, January 2013
 Green, Alexander S.; Lumsdaine, Peter LeFanu; Ross, Neil J.
 Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation  PLDI '13
Ising formulations of many NP problems
journal, January 2014
 Lucas, Andrew
 Frontiers in Physics, Vol. 2
An open graph visualization system and its applications to software engineering
journal, January 2000
 Gansner, Emden R.; North, Stephen C.
 Software: Practice and Experience, Vol. 30, Issue 11
A fast quantum mechanical algorithm for database search
conference, January 1996
 Grover, Lov K.
 Proceedings of the twentyeighth annual ACM symposium on Theory of computing  STOC '96
A quantum macro assembler
conference, September 2016
 Pakin, Scott
 2016 IEEE High Performance Extreme Computing Conference (HPEC)
An open graph visualization system and its applications to software engineering
journal, September 2000
 Gansner, Emden R.; North, Stephen C.
 Software: Practice and Experience, Vol. 30, Issue 11
Works referencing / citing this record:
A QUBO Model for the Traveling Salesman Problem with Time Windows
journal, October 2019
 Papalitsas, Christos; Andronikos, Theodore; Giannakis, Konstantinos
 Algorithms, Vol. 12, Issue 11