Comparing and Integrating Constraint Programming and Temporal Planning for Quantum Circuit Compilation

Understand

Recently, the makespan-minimization problem of compiling a general class of quantum algorithms into near-term quantum processors has been introduced to the AI community.

• The research demonstrated that temporal planning is a strong approach for a class of quantum circuit compilation (QCC) problems.
• In this paper, we explore the use of constraint programming (CP) as an alternative and complementary approach to temporal planning.
• We extend previous work by introducing two new problem variations that incorporate important characteristics identified by the quantum computing community.