Quantum Job Scheduling via Qubit Fidelity Constraints

Solution Overview

Problem

Existing classical and quantum computing job scheduling systems fail to account for quantum-based run constraints, leading to inefficient and unfair use of quantum computing devices.

Innovation Solution

A system comprising a scheduler component that determines a run order for quantum computing jobs based on quantum-based run constraints, including qubit availability, fidelity, and confidence levels, to facilitate efficient and fair scheduling across multiple entities in a cloud computing environment.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If quantum computing jobs are scheduled without considering quantum-based run constraints, then scheduling simplicity is maintained, but resource utilization efficiency deteriorates

Engineering Contradiction:

Improveresource utilization efficiencyVSAvoidscheduling system complexity

Core Design Contradiction:

ProductivityVSDevice complexity

Solution Approach 1:

The system performs preliminary actions by pre-calculating and storing quantum constraint parameters (qubit availability, fidelity requirements, confidence levels) for each job before scheduling. The scheduler component retrieves these pre-computed constraints to make scheduling decisions, avoiding complex real-time calculations and improving resource utilization efficiency while maintaining manageable system complexity.

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

The patent introduces a scheduler component as an intermediary between job submission and quantum computing device execution. This intermediary translates quantum-specific constraints into scheduling decisions, managing the complexity by encapsulating quantum constraint handling within a dedicated component that interfaces with both job queues and quantum devices.

Inventive Principle:

Principle #24Intermediary (Mediator)

2Reliability

If quantum computing jobs are scheduled without considering quantum-based run constraints, then scheduling speed is maintained, but processing accuracy deteriorates

Engineering Contradiction:

Improveprocessing accuracyVSAvoidscheduling time

Core Design Contradiction:

ReliabilityVSLoss of time

Solution Approach 1:

The system performs preliminary actions by pre-calculating and storing quantum constraint parameters (qubit availability, fidelity requirements, confidence levels) for each job before scheduling. The scheduler component retrieves these pre-computed constraints to make scheduling decisions, avoiding complex real-time calculations and improving resource utilization efficiency while maintaining manageable system complexity.

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

The scheduler incorporates feedback mechanisms by continuously monitoring quantum device state (qubit availability, fidelity) and adjusting job scheduling decisions accordingly. This feedback loop ensures that jobs are scheduled based on current quantum resource conditions, improving processing accuracy while the system optimizes scheduling time by using efficient feedback evaluation.

Inventive Principle:

Principle #23Feedback

3Ease of operation

If quantum computing jobs are scheduled without considering quantum-based run constraints, then ease of operation is maintained, but fairness in resource allocation deteriorates

Engineering Contradiction:

Improvescheduling operation simplicityVSAvoidfairness of resource allocation

Core Design Contradiction:

Ease of operationVSAdaptability or versatility

Solution Approach 1:

The patent introduces a scheduler component as an intermediary between job submission and quantum computing device execution. This intermediary translates quantum-specific constraints into scheduling decisions, managing the complexity by encapsulating quantum constraint handling within a dedicated component that interfaces with both job queues and quantum devices.

Inventive Principle:

Principle #24Intermediary (Mediator)

Solution Approach 2:

The system implements fairness by dynamically adjusting scheduling parameters based on quantum constraints. The scheduler considers multiple parameters including qubit availability, fidelity requirements, and confidence levels when determining job execution order. This parameter-based approach ensures fair resource allocation while maintaining operational simplicity through standardized parameter evaluation.

Inventive Principle:

Principle #35Parameter changes

Data Source

PatentUS11972321B2Co-scheduling quantum computing jobs

Publication Date: 2024.04.30 INTERNATIONAL BUSINESS MACHINE CORPORATION

AI summary

Systems, computer-implemented methods, and computer program products to facilitate quantum computing job scheduling are provided. According to an embodiment, a system can comprise a memory that stores computer executable components and a processor that executes the computer executable components stored in the memory. The computer executable components can comprise a scheduler component that can determine a run order of quantum computing jobs based on one or more quantum based run constraints. The computer executable components can further comprise a run queue component that can store the quantum computing jobs based on the run order. In an embodiment, the scheduler component can determine the run order based on availability of one or more qubits comprising a defined level of fidelity.