What is it about?
Quantum Computing has become a more and more prominent research field in the last few decades. This growth in interest is mainly related to the so-called quantum speed up that some quantum procedure exhibits. Answer Set Programming (ASP) is a declarative programming paradigm mainly used to tackle computationally hard problems. In this paper we propose a technique to improve ASP performances exploiting the speed up provided by quantum computation. We present both the technical details and a Proof of Concept implementation.
Featured Image
Photo by Andrew on Unsplash
Why is it important?
It is important since it allows computer scientists to use powerful yet simple declarative paradigms for modelling problems, while adopting quantum computation for gaining in efficiency. Moreover, we aim at stimulating the dialogue between the logic programming and quantum computation research communities.
Read the Original
This page is a summary of: Speeding up Answer Set Programming by Quantum Computing, June 2024, ACM (Association for Computing Machinery),
DOI: 10.1145/3660318.3660328.
You can read the full text:
Contributors
The following have contributed to this page







