Online Job Scheduler for Fault-tolerant Quantum Multiprogramming

TL;DR

This paper presents an online scheduling algorithm for fault-tolerant quantum computers that improves utilization and throughput by approximating complex programs and incorporating defragmentation.

Contribution

It introduces an efficient online scheduler for quantum multiprogramming that uses cuboid approximations and defragmentation to optimize resource utilization.

Findings

The scheduler effectively approximates lattice surgery programs for faster scheduling.

Incorporating defragmentation improves quantum processing unit (QPU) utilization.

The approach enhances throughput in fault-tolerant quantum systems.

Abstract

Fault-tolerant quantum computers are expected to be offered as cloud services due to their significant resource and infrastructure requirements. Quantum multiprogramming, which runs multiple quantum jobs in parallel, is a promising approach to maximize the utilization of such systems. A key challenge in this setting is the need for an online scheduler capable of handling jobs submitted dynamically while other programs are already running. In this study, we formulate the online job scheduling problem for fault-tolerant quantum computing systems based on lattice surgery and propose an efficient scheduler to address it. To meet the responsiveness required in an online environment, our scheduler approximates lattice surgery programs, originally represented as polycubes, by using simpler cuboid representations. This approximation enables efficient scheduling while improving overall throughput. In addition, we incorporate a defragmentation mechanism into the scheduling process, demonstrating that it can further enhance QPU utilization.