Instruction scheduling is a key transformation in backend compilers that take an untimed description of an algorithm and assigns time slots to the algorithm's instructions so that they can be executed as efficiently as possible while taking into account the target processor limitations, such as the amount of computational units available. For example, for a superconducting quantum processor these restrictions include the amount of analogue instruments available to play the waveforms to drive the qubit rotations or on-chip connectivity between qubits. Current small-scale quantum processors contain only a few qubits; therefore, it is feasible to drive qubits individually albeit not scalable. Consequently, for NISQ and beyond NISQ devices, it is expected that classical instrument sharing to be designed in the future quantum control architectures where several qubits are connected to an instrument and multiplexing is used to activate only the qubits performing the same quantum operation at a time. Existing quantum scheduling algorithms either rely on ILP formulations, which do not scale well, or use heuristic based algorithms such as list scheduling which are not versatile enough to deal with quantum requirements such as scheduling with exact relative timing constraints between instructions, situation that might occur when decomposing complex instructions into native ones and requiring to keep a fixed timing between the primitive ones to guarantee correctness. In this paper, we propose a novel resource constrained scheduling algorithm that is based on the SDC formulation, which is the state-of-the-art algorithm used in the reconfigurable computing. We evaluate it against a list scheduler and describe the benefits of the proposed approach. We find that the SDC-based scheduling is not only able to find better schedules but also model flexible relative timing constraints.
翻译:指令调度是后端编译器的关键转换, 后端编译器对算法进行不及时的描述, 并给算法指示分配时间档, 以便尽可能高效地执行qubits, 同时考虑到目标处理器的局限性, 比如计算单位的数量。 例如, 对于超导量处理器来说, 这些限制包括可用于播放波形的模拟工具的数量, 以驱动qubit 旋转或者在 qubits 之间连接。 目前小规模量子处理器只包含几平方位; 因此, 单独驱动qubits 相对处理器( 虽然不易缩放 ) 是可行的 。 因此, 对于 NISQQ 和 NISQ 设备之外的目标处理器的限制, 期望在未来的量子控制结构中, 将共享经典工具设计为典型工具, 用于播放波比特在一次运行相同的量操作的模拟工具。 现有的量测算算法要么依靠 ILP 的配方, 但不能够评估状态,, 也可以使用基于超值算法的算法的算法算法算算法作为列表, 列表, 这样的算算算法, 列表作为列表, 列表, 列表, 的比重算法, 。 因此,,,, 比较不易算算算算算算算算算算算算算算算算算算算算方法,,,,,,, 的算法, 比较算算算算方法, 比较算方法, 比较算方法, 比较算方法,,, 比较算算算算算算算算算算算方法,,, 算算算算算算算算算算算算算算算方法,,,, 比较算算算方法,,,,,,, 比较算方法, 算法,,,, 比较算算算算算算算算算算算方法, 比较算算算算算算算算算算算算算算算算方法, 比较算方法,,,, 比较算算算算算算算算算算算算算算方法,,, 比较算算算算算算算算