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

19 Mar 2018Kyle E. C. BoothMinh DoJ. Christopher BeckEleanor RieffelDavide VenturelliJeremy Frank

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... (read more)

PDF Abstract


No code implementations yet. Submit your code now


Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.