aiqbench takeQuantum Computing

Researchers have developed a formally verified method to compile recursive Datalog programs into 2-local Ising models compatible with quantum annealers like those from D-Wave. This advancement allows specialized hardware to solve knowledge-based problems by finding the minimal Herbrand model of logic programs, bridging the gap between classical logic programming and quantum optimization. The work provides both theoretical guarantees via Lean 4 verification and practical implementation details for mapping these models onto existing quantum hardware.

Source coveringQuantum Zeitgeist

What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Compiling Logic Programs for Quantum Annealers

Quantum ZeitgeistAugust 25, 20264 min read

Researchers have compiled logic programs into 2-local Ising models, suitable for solving problems on systems like those from D-Wave. This verified process aims to utilize quantum annealing to find solutions via the machine’s minimal Herbrand model.

Researchers at the University of Tartu and colleagues present a novel method for solving complex computational problems using quantum annealers. They demonstrate a compilation process that transforms recursive Datalog programs into 2-local Ising models, enabling the annealer to find solutions corresponding to the program's minimal Herbrand model. This work advances the field by providing both theoretical guarantees, including correctness lemmas and a correspondence theorem formally verified in Lean 4, and practical implementation, mapping compiled models onto existing quantum annealing hardware. The team…

Excerpt shown under the publisher's RSS terms · 82 words · full text and figures are on the publisher's site

Read at Quantum Zeitgeist ↗Ask about this article