Performing fully parallel constraint logic programming on a quantum annealer

DOI10.1017/S1471068418000066zbMath1452.68039arXiv1804.00036OpenAlexW2963704146WikidataQ59222970 ScholiaQ59222970MaRDI QIDQ4559836

Scott Pakin

Publication date: 4 December 2018

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.00036

zbMATH Keywords

quantum computingPrologconstraint logic programmingquantum annealingD-wave

Mathematics Subject Classification ID

Quantum computation (81P68) Logic programming (68N17)

Related Items (2)

Least-squares solutions to polynomial systems of equations with quantum annealing ⋮ Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results

Uses Software

• Python
• SWI-Prolog
• ScaffCC
• Deqo

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• On complexity of the quantum Ising model
• Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
• SWI-Prolog
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• An open graph visualization system and its applications to software engineering
• A Machine-Oriented Logic Based on the Resolution Principle

This page was built for publication: Performing fully parallel constraint logic programming on a quantum annealer