Compiling Logic Programs for Quantum Annealers

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…