International Conference on Electronic Information Engineering and Data Processing (EIEDP)

Scheduling algorithm for fidelity of quantum gate circuits

Xudong Liu, Jinchen Xu, Hang Lian

Published Jul 5, 2024• 0 citations

Abstract

As quantum computing technology matures, the availability and performance of quantum devices are steadily improving. However, in the NISQ (Noisy Intermediate-Scale Quantum) era, the quantum bit error rate caused by quantum noise remains a significant constraint on computational accuracy and reliability. In quantum operating systems, quantum task scheduling is a core technology crucial for fully leveraging the performance potential of quantum processors. Currently, most multi-processor scheduling algorithms focus on task load balancing and do not directly consider the characteristics of quantum circuits and the differentiated error rates of quantum computing backends. In quantum computing, the impact of noise errors in single-qubit gates, two-qubit gates, and measurement gates on the fidelity of quantum gate circuits is crucial. Therefore, intelligently matching quantum tasks with the characteristics of backend processors to optimize computational accuracy is an urgent problem to be addressed. This paper proposes a new quantum task scheduling algorithm, which matches tasks with backends based on the weight of single-qubit gates, two-qubit gates, and measurement gates in quantum circuits, as well as the error rate characteristics of each quantum computing backend. Experimental results show that the proposed scheduling algorithm for improving the fidelity of quantum gate circuits outperforms static load balancing scheduling algorithms, resulting in a 4.39% increase in the fidelity of quantum tasks.

DOI: 10.1117/12.3032999

Related papers

Resource-Aware Scheduling of Quantum Algorithms on Noisy Intermediate-Scale Quantum Computers

Jincheng Zhang

The development of quantum computing relies heavily on the effective execution of quantum algorithms. However, current Noisy Intermediate-Scale Quantum (NISQ) computers are plagued by limitations such as short coherence times and significant error rates, posing substantial challenges to scheduling and execution. This paper introduces a novel dynamic resource-aware scheduling algorithm designed to mitigate these challenges. The core of the algorithm lies in its ability to adapt to the fluctuating noise levels and coherence times of the quantum hardware, intelligently prioritizing tasks based on their estimated computational cost and error probability. We demonstrate that this adaptive approach significantly improves the potential for successful quantum algorithm execution on NISQ devices, offering a pathway towards more efficient and reliable quantum computation. The algorithm's effectiveness is evaluated through theoretical analysis and conceptual modeling, focusing on the optimization of resource allocation and task prioritization within the constraints of NISQ technology. This research contributes to the growing field of quantum resource management and scheduling, providing a framework for tackling the complexities inherent in operating quantum computers.

Sep 6, 20260 citations

Self-Adaptive Quantum Circuits for NISQ Devices

PROF.JABEEN TAJ MK

Noisy Intermediate-Scale Quantum (NISQ) devices are promising platforms for practical quantum computing, but their performance is significantly affected by limited qubit availability, gate errors, decoherence, circuit depth, and hardware-dependent noise. Conventional quantum circuits are generally designed and optimized before execution and may not respond effectively to changing hardware conditions during computation. This research proposes a Self-Adaptive Quantum Circuit framework that dynamically modifies quantum circuits according to the current computational resources and noise characteristics of NISQ devices. The proposed framework monitors parameters such as qubit fidelity, gate error rates, circuit depth, execution time, and resource availability, and automatically selects suitable circuit configurations to improve computational performance. Adaptive mechanisms can be employed to reduce unnecessary gates, optimize qubit utilization, and mitigate the impact of hardware noise while maintaining the required computational accuracy. The framework will be evaluated using simulation platforms and available NISQ quantum hardware, comparing adaptive circuits with conventional static circuits using metrics such as accuracy, fidelity, circuit depth, gate count, execution time, and error rate. The expected outcome is a resource-efficient and noise-aware quantum circuit optimization approach capable of improving the reliability and performance of quantum applications on near-term quantum hardware. The proposed research aims to contribute toward more practical, flexible, and hardware-aware quantum computing systems for NISQ-era applications. Keywords: NISQ Computing, Self-Adaptive Quantum Circuits, Quantum Circuit Optimization, Quantum Error Mitigation, Quantum Noise, Quantum Computing.

JOURNAL OF ADVANCE AND FUTURE RESEARCHAug 1, 20260 citations

Improving Quantum Resource Usage Through Automated Circuit Scheduling

Jaime Alvarado‐Valiente, Javier Romero‐Álvarez, Enrique Moguel +4 more

The current execution model of quantum computers, based on serialized task processing, leads to inefficient resource utilization and increased waiting times. This inefficiency persists even as the demand for quantum computing grows. To address this, an automated scheduling approach is proposed through the AutoScheduler library, which replicates quantum circuits to fully occupy the available qubits in a quantum processor. This strategy reduces the number of required shots per execution while optimizing hardware usage. Experimental validation on IBM Quantum and Amazon Braket platforms demonstrates that autoscheduling achieves substantial reductions in execution time and cost, with minimal impact on result fidelity despite inherent quantum noise. These findings suggest that circuit autoscheduling is a viable method for improving the scalability and efficiency of quantum computing in the NISQ era.

IT ProfessionalMar 1, 20260 citations

Self-Correcting Quantum Circuits via Adaptive Gate Scheduling

Jincheng Zhang

This paper presents a novel approach to quantum circuit optimization – self-correcting quantum circuits – that leverages adaptive gate scheduling to mitigate the detrimental effects of noise and decoherence. The core concept involves establishing a closed-loop feedback system where real-time performance measurements of the circuit are utilized to dynamically adjust the execution order of quantum gates. This contrasts with traditional static circuit design or gate scheduling methods which often rely on pre-determined strategies and fail to adapt to unforeseen variations in quantum system behavior. The algorithm incorporates a scheduler that continuously monitors circuit output probabilities and adjusts gate timings and sequences to minimize error propagation. The effectiveness of this approach is demonstrated through a theoretical analysis and a conceptual framework, outlining the key components and operational principles. The primary goal is to create a system capable of actively correcting for errors during execution, enhancing the fidelity and reliability of quantum computations. We propose a mathematical framework for describing the adaptive gate scheduling process, utilizing concepts from Markov Chains and Bayesian Optimization to model the uncertainty and optimize the scheduling strategy. The potential impact of this research lies in enabling the design of more robust and reliable quantum algorithms, particularly for complex computations where error mitigation is crucial.

Sep 5, 20260 citations

QGroup: Parallel Quantum Job Scheduling Using Dynamic Programming

Aaron Orenstein, Vipin Chaudhary

Even as quantum computers continue to increase in number of qubits, high error rates limit the size of quantum circuits that can be executed. This results in low throughput and poor resource utilization on quantum computers. To address this, recent research has focused on extending circuit optimization and compilation techniques to support simultaneous execution of quantum circuits (i.e. quantum parallelism). While much work has been spent developing parallel mapping and gate scheduling techniques, there are few approaches to the problem of parallel job scheduling on quantum computers. There are several constraints that make quantum job scheduling different from classical scheduling. We propose a scheduling algorithm, QGroup, for parallelizing circuits of different lengths and shot counts while mitigating parallel slowdowns due to measurement synchronization. QGroup achieves a better parallelism-runtime tradeoff, with significant speedup and fidelity increase over existing methods. QGroup achieves improvement in both fidelity and runtime for noise-sensitive, diverse workloads.

IEEE International Conference on Quantum Computing and Engineering (QCE)Sep 15, 20246 citations

Quantum Computing Resource Allocation and Scheduling Algorithm Design

Jincheng Zhang

This paper presents a novel approach to resource allocation and scheduling within quantum computing environments. Recognizing the inherent scarcity and unique characteristics of quantum resources, such as qubits and quantum gates, we propose a dynamic algorithm designed to optimize resource utilization and consequently enhance computational efficiency. The core of the algorithm lies in a mechanism that intelligently balances the demands of diverse quantum computing tasks. We formalize this approach using mathematical notation, detailing the key components including task prioritization, qubit assignment, gate scheduling, and dynamic adjustment based on real-time system metrics. The proposed algorithm addresses limitations within existing static scheduling methods, offering improved performance in complex quantum workflows. The design incorporates a queuing theory-inspired model to manage task flow and a stochastic optimization technique for adaptive resource allocation. Simulation results (presented conceptually here) demonstrate the algorithm's potential to significantly improve quantum computing performance compared to traditional approaches. Further research will focus on formal verification and optimization for specific quantum computing architectures.

Sep 2, 20260 citations