Qubit mapped diamond dependency recommendation service

US12450516B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-12450516-B2
Application numberUS-202217874167-A
CountryUS
Kind codeB2
Filing dateJul 26, 2022
Priority dateJul 26, 2022
Publication dateOct 21, 2025
Grant dateOct 21, 2025

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.

Embodiments of the present disclosure provide techniques for performing a quantum computing-based diamond dependency analysis. A classical diamond dependency service may analyze a service and determine a set of dependencies that the service requires to execute. The classical DDS may then generate a quantum assembly language (QASM) file comprising a diamond dependency algorithm (DDA) and a mapping of a configuration file of the service and a configuration file of each of the set of dependencies to a respective qubit among a plurality of qubits. The classical DDS may interface with one or more quantum DDSs (QDDSs) that are each part of a respective quantum environment in order to determine qubits that are available to be mapped to the configuration files of the service and its dependencies. The classical DDS may execute the QASM file using the one or more QDDSs to detect one or more diamond dependencies.

First claim

Opening claim text (preview).

What is claimed is: 1. A method comprising: determining a set of dependencies that a service requires to execute; generating, by a processing device, a quantum assembly language (QASM) file comprising a mapping of a configuration file of the service and a configuration file of each of the set of dependencies to a respective qubit among a plurality of qubits, wherein the QASM file further comprises a diamond dependency algorithm (DDA); executing the QASM file using one or more quantum diamond dependency services (QDDSs) to detect one or more diamond dependencies based on the DDA and the mapping of the configuration file of the service and the configuration file of each of the set of dependencies to a respective qubit among a plurality of qubits, wherein each of the one or more QDDSs corresponds to a quantum environment having a subset of the plurality of qubits; and connecting to the one or more quantum diamond dependency services (QDDSs) to identify a respective available qubit for the service and a respective available qubit for each of the set of dependencies; and as the respective available qubit for the service and the respective available qubit for each of the set of dependencies is identified, locking the respective available qubit down. 2. The method of claim 1 , wherein connecting to the one or more QDDSs comprises: iteratively, until a respective available qubit for the service and a respective available qubit for each of the set of dependencies are identified: connecting to a QDDS to interface with a qubit registry of a quantum environment corresponding to the QDDS; determining, via the qubit registry, a set of available qubits in the quantum environment; and determining whether a respective available qubit for the service and a respective available qubit for each of the set of dependencies have been identified based on the set of available qubits in the quantum environment. 3. The method of claim 1 , further comprising: in response to connecting to more than one QDDS to identify a respective available qubit for the service and a respective available qubit for each of the set of dependencies, adding entanglement commands to the QASM file to account for each quantum environment from which respective available qubits are identified while detecting the one or more diamond dependencies. 4. The method of claim 1 , further comprising: annotating the QASM file with an indication of a relationship each respective qubit has with other respective qubits based on a configuration file each respective qubit is mapped to. 5. The method of claim 1 , further comprising: returning a list of each respective qubit that is in conflict based on the detected one or more diamond dependencies. 6. The method of claim 1 , wherein the generating of the QASM file is performed by a classical diamond dependency service. 7. A system comprising: a memory; and a processing device operatively coupled to the memory, the processing device to: determine a set of dependencies that a service requires to execute; generate a quantum assembly language (QASM) file comprising a mapping of a configuration file of the service and a configuration file of each of the set of dependencies to a respective qubit among a plurality of qubits, wherein the QASM file further comprises a diamond dependency algorithm (DDA); execute the QASM file using one or more quantum diamond dependency services (QDDSs) to detect one or more diamond dependencies based on the DDA and the mapping of the configuration file of the service and the configuration file of each of the set of dependencies to a respective qubit among a plurality of qubits, wherein each of the one or more QDDSs corresponds to a quantum environment having a subset of the plurality of qubits; and connect to the one or more quantum diamond dependency services (ODDSs) to identify a respective available qubit for the service and a respective available qubit for each of the set of dependencies, wherein as the respective available qubit for the service and the respective available qubit for each of the set of dependencies is identified, the respective available qubit is locked down by a QDDS corresponding to a quantum environment on which the respective available qubit is located. 8. The system of claim 7 , wherein to connect to the one or more QDDSs, the processing device is to: iteratively, until a respective available qubit for the service and a respective available qubit for each of the set of dependencies are identified: connect to a QDDS to interface with a qubit registry of a quantum environment corresponding to the QDDS; determine, via the qubit registry, a set of available qubits in the quantum environment; and determine whether a respective available qubit for the service and a respective available qubit for each of the set of dependencies have been identified based on the set of available qubits in the quantum environment. 9. The system of claim 7 , wherein the processing device is further to: in response to connecting to more than one QDDS to identify a respective available qubit for the service and a respective available qubit for each of the set of dependencies, add entanglement commands to the QASM file to account for each quantum environment from which respective available qubits are identified while detecting the one or more diamond dependencies. 10. The system of claim 7 , wherein the processing device is further to: annotate the QASM file with an indication of a relationship each respective qubit has with other respective qubits based on a configuration file each respective qubit is map ped to. 11. The system of claim 7 , wherein the processing device is further to: return a list of each respective qubit that is in conflict based on the detected one or more diamond dependencies. 12. The system of claim 7 , wherein the processing device executes a classical diamond dependency service to generate the QASM file. 13. A non-transitory computer-readable medium having instructions stored thereon which, when executed by a processing device, cause the processing device to: determine a set of dependencies that a service requires to execute; generate a quantum assembly language (QASM) file comprising a mapping of a configuration file of the service and a configuration file of each of the set of dependencies to a respective qubit among a plurality of qubits, wherein the QASM file further comprises a diamond dependency algorithm (DDA); execute the QASM file using one or more quantum diamond dependency services (QDDSs) to detect one or more diamond dependencies based on the DDA and the mapping of the configuration file of the service and the configuration file of each of the set of dependencies to a respective qubit among a plurality of qubits, wherein each of the one or more QDDSs corresponds to a quantum environment having a subset of the plurality of qubits; and connect to the one or more quantum diamond dependency services (QDDSs) to identify a respective available qubit for the service and a respective available qubit for each of the set of dependencies, wherein as the respective available qubit for the service and the respective available qubit for each of the set of dependencies is identified, the respective available qubit is locked down by a QDDS corresponding to a quantum environment on which the respective available qubit is located. 14. The non-transitory computer-readable medium of claim 13 , wherein to connect to the one or more QDDSs, the processing device is to: iteratively, until a respective available qubit for the service and a respective available qubit for each of the set of dependencies are identified: con

Assignees

Inventors

Classifications

  • Quantum programming, e.g. interfaces, languages or software-development kits for creating or handling programs capable of running on quantum computers; Platforms for simulating or accessing quantum computers, e.g. cloud-based quantum computing · CPC title

  • Physical realisations or architectures of quantum processors or components for manipulating qubits, e.g. qubit coupling or qubit control · CPC title

  • G06N10/60Primary

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

  • G06N10/00Primary

    Quantum computing, i.e. information processing based on quantum-mechanical phenomena · 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 US12450516B2 cover?
Embodiments of the present disclosure provide techniques for performing a quantum computing-based diamond dependency analysis. A classical diamond dependency service may analyze a service and determine a set of dependencies that the service requires to execute. The classical DDS may then generate a quantum assembly language (QASM) file comprising a diamond dependency algorithm (DDA) and a mappi…
Who is the assignee on this patent?
Red Hat Inc
What technology area does this patent fall under?
Primary CPC classification G06N10/60. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Oct 21 2025 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 2 related publications on this page (citations in our corpus or others sharing the same primary CPC).