Scheduling of Operations in Quantum Compiler

TL;DR

This paper models quantum operation scheduling as a job-shop problem, using constraint programming to optimize execution time and account for operation commutation, leading to improved quantum circuit performance.

Contribution

It introduces a novel formulation of quantum scheduling as a constraint programming problem that considers commutation, enhancing schedule efficiency.

Findings

Improved execution times in quantum circuit scheduling.

Effective modeling of quantum scheduling as a job-shop problem.

Validation with real quantum compiler and benchmark circuits.

Abstract

When scheduling quantum operations, a shorter overall execution time of the resulting schedule yields a better throughput and higher fidelity output. In this paper, we demonstrate that quantum operation scheduling can be interpreted as a special type of job-shop problem. On this basis, we provide its formulation as Constraint Programming while taking into account commutation between quantum operations. We show that this formulation improves the overall execution time of the resulting schedules in practice through experiments with a real quantum compiler and quantum circuits from two common benchmark sets.