Scheduling services for quantum computing

US11086665B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-11086665-B2
Application numberUS-201816167167-A
CountryUS
Kind codeB2
Filing dateOct 22, 2018
Priority dateOct 22, 2018
Publication dateAug 10, 2021
Grant dateAug 10, 2021

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

Aspects of the disclosure provide for mechanisms for scheduling execution of quantum algorithm. A method of the disclosure includes: receiving a request to execute a quantum algorithm at a quantum computer system, determining whether the one or more execution environment requirements from the request are satisfied in view of the state of the quantum computer system, responsive to determining that the one or more execution environment requirements are not satisfied in view of the state of the quantum computer system, causing an execution of the quantum algorithm to be delayed until the one or more execution environment requirements are satisfied, and responsive to determining that the one or more execution environment requirements are satisfied in view of the state of the quantum computer system, forwarding the request to execute the quantum algorithm to the quantum computer system to cause the execution of the quantum algorithm.

First claim

Opening claim text (preview).

What is claimed is: 1. A method comprising: receiving, at a server, a request to execute a quantum algorithm at a quantum computer system connected to the server, the request to execute the quantum algorithm comprising a plurality of instructions for implementing the quantum algorithm and one or more execution environment requirements, wherein the one or more execution environment requirements comprise one or more qubit state requirements with respect to one or more qubits provided by the quantum computer system; determining a state of the quantum computer system, the state of the quantum computer system comprising at least one of an error rate or a coherence time of the quantum computer system; determining whether the one or more execution environment requirements are satisfied in view of the state of the quantum computer system; responsive to determining that the one or more execution environment requirements are not satisfied in view of the state of the quantum computer system, causing an execution of the quantum algorithm to be delayed until the one or more execution environment requirements are satisfied; and responsive to determining that the one or more execution environment requirements are satisfied in view of the state of the quantum computer system, forwarding a modified request to execute the quantum algorithm to the quantum computer system to cause execution of a first subset of the plurality of instructions without causing execution of a second subset of the plurality of instructions for implementing the quantum algorithm, wherein the first subset of instructions is associated with a first qubit having a qubit state by which the one or more execution environment requirements are satisfied, and the second subset of instructions is associated with one or more qubits other than the first qubit. 2. The method of claim 1 , wherein: the request to execute the quantum algorithm comprises a Quantum Assembly Language (QASM) file; and the determining of whether the one or more execution environment requirements are satisfied in view of the state of the quantum computer system comprises: identifying, from the request to execute the quantum algorithm, a statement starting with an annotation indicating an execution environment requirement by parsing the request to execute the quantum algorithm, and determining the execution environment requirement from the identified statement. 3. The method of claim 1 , wherein the one or more execution environment requirements include at least one of: an error rate threshold for the quantum computer system, a channel load rate threshold for a quantum communication channel within the quantum computer system, a coherence time threshold for the quantum computer system, or a temperature threshold for a temperature of the quantum computer system. 4. The method of claim 1 , wherein: the request to execute the quantum algorithm comprises a scheduling optimization option; and the determining of whether the one or more execution environment requirements are satisfied in view of the state of the quantum computer system further comprises: determining a particular execution environment requirement that is associated with the scheduling optimization option, determining whether the particular execution environment requirement is satisfied in view of the state of the quantum computer system, and responsive to determining that the particular execution environment requirement is satisfied, determining that the one or more execution environment requirements are satisfied. 5. The method of claim 1 , wherein: determining that the one or more execution environment requirements are satisfied in view of the state of the quantum computer system comprises: identifying the first qubit provided by the quantum computer system having the state by which the one or more execution environment requirements are satisfied; and forwarding the modified request comprises: determining, from the plurality of instructions for implementing the quantum algorithm, the first subset of instructions associated with the first qubit, and modifying the request to execute the quantum algorithm to cause the execution of the first subset of instructions associated with the first qubit and to not cause execution of the second subset of instructions associated with the one or more qubits other than the first qubit. 6. The method of claim 1 , further comprising: responsive to receiving the request to execute the quantum algorithm, determining an identifier of the quantum algorithm of the request; and responsive to receiving, from the quantum computer system, a result of the execution of the quantum algorithm, storing the result in association with the identifier of the quantum algorithm. 7. The method of claim 6 , further comprising: responsive to receiving the request to execute the quantum algorithm, determining whether the quantum algorithm of the request was previously executed in view of the identifier of the quantum algorithm; and responsive to determining that the quantum algorithm in the request was previously executed, identifying the result of the execution of the quantum algorithm that is stored in view of the identifier of the quantum algorithm. 8. A system comprising: a memory; and a processing device operatively coupled to the memory, the processing device to: receive a request to execute a quantum algorithm at a quantum computer system connected to the system, the request to execute the quantum algorithm comprising a plurality of instructions for implementing the quantum algorithm and one or more execution environment requirements, wherein the one or more execution environment requirements comprise one or more qubit state requirements with respect to one or more qubits provided by the quantum computer system; determine a state of the quantum computer system, the state of the quantum computer system comprising at least one of an error rate or a coherence time of the quantum computer system; determine whether the one or more execution environment requirements are satisfied in view of the state of the quantum computer system; responsive to determining that the one or more execution environment requirements are not satisfied in view of the state of the quantum computer system, cause an execution of the quantum algorithm to be delayed until the one or more execution environment requirements are satisfied; and responsive to determining that the one or more execution environment requirements are satisfied in view of the state of the quantum computer system, forward a modified request to execute the quantum algorithm to the quantum computer system to cause execution of a first subset of the plurality of instructions without causing execution of a second subset of the plurality of instructions for implementing the quantum algorithm, wherein the first subset of instructions is associated with a first qubit having a qubit state by which the one or more execution environment requirements are satisfied, and the second subset of instructions is associated with one or more qubits other than the first qubit. 9. The system of claim 8 , wherein: the request to execute the quantum algorithm comprises a Quantum Assembly Language (QASM) file; and to determine whether the one or more execution environment requirements are satisfied in view of the state of the quantum computer system, the processing device to: identify, from the request to execute the quantum algorithm, a statement starting with an annotation indicating an execution environment requirement by parsing the request to execute the quantum algorithm, and determine the execution environment requirement from the identified statement.

Assignees

Inventors

Classifications

  • Quantum algorithms, e.g. based on quantum optimisation, quantum Fourier or Hadamard transforms · CPC title

  • by exceeding limits · CPC title

  • G06F9/4881Primary

    Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues · CPC title

  • Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs {(coordinating program control therefor G06F9/52; in regulating and control system G05B)} · CPC title

  • the resource being a machine, e.g. CPUs, Servers, Terminals · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US11086665B2 cover?
Aspects of the disclosure provide for mechanisms for scheduling execution of quantum algorithm. A method of the disclosure includes: receiving a request to execute a quantum algorithm at a quantum computer system, determining whether the one or more execution environment requirements from the request are satisfied in view of the state of the quantum computer system, responsive to determining th…
Who is the assignee on this patent?
Red Hat Inc
What technology area does this patent fall under?
Primary CPC classification G06F9/4881. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Aug 10 2021 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 3 related publications on this page (citations in our corpus or others sharing the same primary CPC).