Automating the Generation of Quantum Programs: a Case for Solving SAT Problems

Several researchers have recently highlighted the convenience of adopting and

adapting the techniques and tools of Software Engineering for the development

of programs in the eld of Quantum Computing. Model-driven engineering

is one of the techniques that has generated the best results in the eld of

Software Engineering in the last twenty years, so it seems sensible to explore

the benet of applying this technique in the eld of quantum programming,

given the conceptual dierences that exist between quantum and classical

programming primitives. In this context, the Boolean satisability problem has

received attention as quantum programming provides a solution that reduces

to polynomial the search for solutions to the problem. This work addresses the

consideration of applying model-driven engineering to ease the generation of

quantum programs and make it more aordable. To demonstrate the feasibility

of the approach, we apply it to solve the Boolean satisability problem by taking

advantage of the benets of model compilation, in terms of obtaining a quantum

circuit that minimizes the number of gates involved in the solution, thus limiting

the possible de-coherence of the quantum system.