Search Menu
DOE PAGES title logo U.S. Department of Energy
Office of Scientific and Technical Information
Search Scholarly Publications

Title: 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 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.

Authors:
ORCiD logo [1]
+ Show Author Affiliations
  1. 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):
LA-UR-17-22721; LA-UR-18-25614
Journal ID: ISSN 1471-0684
Grant/Contract Number:  
AC52-06NA25396; 89233218CNA000001
Resource Type:
Accepted Manuscript
Journal Name:
Theory and Practice of Logic Programming
Additional Journal Information:
Journal Volume: 18; Journal Issue: 5-6; Journal ID: ISSN 1471-0684
Publisher:
Cambridge University Press
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS AND COMPUTING; quantum annealing; quantum computing; constraint logic programming; Prolog; D-Wave; Computer Science

Citation Formats

Pakin, Scott. Performing fully parallel constraint logic programming on a quantum annealer. United States: N. p., 2018. Web. doi:10.1017/S1471068418000066.
Copy to clipboard
Pakin, Scott. Performing fully parallel constraint logic programming on a quantum annealer. United States. https://doi.org/10.1017/S1471068418000066
Copy to clipboard
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.
Copy to clipboard
@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 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.},
doi = {10.1017/S1471068418000066},
journal = {Theory and Practice of Logic Programming},
number = 5-6,
volume = 18,
place = {United States},
year = {2018},
month = {5}
}
Copy to clipboard
Journal Article:
Free Publicly Available Full Text
Publisher's Version of Record
https://doi.org/10.1017/S1471068418000066
Copyright Statement
Other availability
Search WorldCat Search WorldCat to find libraries that may hold this journal
Citation Metrics:
Cited by: 1 work
Citation information provided by
Web of Science
Save / Share:
Export Metadata
Save to My Library
You must Sign In or Create an Account in order to save documents to your library.

Works referenced in this record:

ScaffCC: Scalable compilation and analysis of quantum programs
journal, June 2015

Quantum annealing in the transverse Ising model
journal, November 1998

Quantum mechanical computers
journal, June 1986

On the computational complexity of Ising spin glass models
journal, October 1982

Quantum annealing with manufactured spins
journal, May 2011

  • Johnson, M. W.; Amin, M. H. S.; Gildert, S.
  • Nature, Vol. 473, Issue 7346
  • DOI: 10.1038/nature10012

Analog analogue of a digital quantum computation
journal, April 1998

Optimization by Simulated Annealing
journal, May 1983

On Complexity of the Quantum Ising Model
journal, November 2016

A Machine-Oriented Logic Based on the Resolution Principle
journal, January 1965

SWI-Prolog
journal, September 2011

  • Wielemaker, Jan; Schrijvers, Tom; Triska, Markus
  • Theory and Practice of Logic Programming, Vol. 12, Issue 1-2
  • DOI: 10.1017/S1471068411000494

Quantum annealing: A new method for minimizing multidimensional functions
journal, March 1994

Minor-embedding in adiabatic quantum computation: I. The parameter setting problem
journal, September 2008

Exponential complexity of the quantum adiabatic algorithm for certain satisfiability problems
journal, December 2011

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
  • DOI: 10.1109/TASC.2014.2318294

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
  • DOI: 10.1145/2491956.2462177

Ising formulations of many NP problems
journal, January 2014

An open graph visualization system and its applications to software engineering
journal, January 2000

A fast quantum mechanical algorithm for database search
conference, January 1996

  • Grover, Lov K.
  • Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96
  • DOI: 10.1145/237814.237866

A quantum macro assembler
conference, September 2016

An open graph visualization system and its applications to software engineering
journal, September 2000

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
journal, October 1997

Quantum mechanical computers
conference, January 1984

Quipper: a scalable quantum programming language
journal, June 2013

  • Green, Alexander S.; Lumsdaine, Peter LeFanu; Ross, Neil J.
  • ACM SIGPLAN Notices, Vol. 48, Issue 6
  • DOI: 10.1145/2499370.2462177

Quantum Mechanical Computers
journal, January 1985

Architectural considerations in the design of a superconducting quantum annealing processor
text, January 2014

    Sort by:
    [ × clear filter / sort ]

    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
    • DOI: 10.3390/a12110224
      Sort by:
      [ × clear filter / sort ]

      Similar Records in DOE PAGES and OSTI.GOV collections: