Red Hat, Inc.

Leigh Griffin

Stephen Coady

Pierre-Yves Chibon

Luigi Zuccarelli

Paolo Antinori

Andrea Cosentino

Cathal O'Connor

Sanja Bonic

Janos Bonic

Leonardo Rossetti

Ali Ok

Srinivasa Bharath Kanta

Veera Raghava Beri Reddy

Laura Fitzgerald

Aoife Moloney

David Ffrench

Anthony Carroll

Christopher Foley

Julia Bley

Florence Renaud

Rachel Elizabeth Sibley

Brendan O'Farrell

Anne Mulhern

Eric Curtin

Maja Massarini

Pierre-Yves Chiben

Access protection for shared qubits is disclosed herein. In one example, a processor device first determines that a first quantum process associated with one or more qubits is scheduled for execution (e.g., based on metadata obtained from the quantum process manager.) The processor device next identifies a second quantum process that is active and that is also associated with the one or more qubits. The processor device then prevents the first quantum process (i.e., the quantum process that is scheduled to execute) from accessing the one or more qubits. In some examples, the processor device may prevent access to the one or more qubits by causing the first quantum process to be placed in a blocked state pending release of the one or more qubits by the second quantum process (i.e., the currently active quantum process).

Access protection for shared qubits

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.

Qubit mapped diamond dependency recommendation service

A quantum computing system receives, from a requestor, a first access request that identifies a subject, an action, and a resource. A mapping structure that identifies a plurality of qubits that are in superposition and encoded with a plurality of rules that govern access to the resource is accessed. Based on the mapping structure it is determined that a set of qubits of the plurality of qubits applies to the access request. Data encoded in the set of qubits or a reference to each qubit in the set of qubits is provided to the requestor.

Qubit-implemented role-based access control

A quantum isolation zone (QIZ) controller executing on a quantum computing system, makes a determination to initiate, for a first QIZ of a plurality of different QIZs, a first local service instance of a global service instance that is executing on the quantum computing system, the first QIZ having a first set of qubits associated therewith. The first local service instance is caused to be initiated, and the QIZ controller modifies a local service data structure to indicate that the first local service instance is associated with the first QIZ.

Local services in quantum isolation zones

A gateway device receives a request from a client device, the gateway to provide access to a plurality of services provided by a plurality of compute nodes. A manifest is created based on metadata associated with the request and characteristics of the plurality of services, the manifest identifying a logical view of a subset of the plurality of services provided by a subset of the plurality of compute nodes. The request is routed to one of the subset of the plurality of services based on the manifest.

Dynamic API gateway routing based on request metadata

Iterative workload processing having a mandatory processing task and a preferred processing task. A processor device iteratively performs a processing workload that comprises a mandatory processing task and a preferred processing task. The mandatory processing task includes accessing a plurality of input messages that have not yet been processed, and the preferred processing task has a target timeframe within which to be performed. For each iteration, a maximum preferred processing task amount of time to perform the preferred processing task is determined based on a moving average of mandatory processing task times of previous iterations and based on the target timeframe. The preferred processing task is performed for a period of time no greater than the maximum preferred processing task amount of time.

Iterative workload processing having a mandatory processing task and a preferred processing task

A system and method of Byzantine fault prevention in mesh networks. The method includes detecting a consensus operation among a plurality of node devices of a network for a blockchain operation of a blockchain within the network, wherein each consensus operation includes a vote transmission associated with the blockchain within the network, wherein detecting the consensus operation includes examining an approval status of a particular vote transmission associated with a particular consensus operation. The method includes controlling, by a processing device responsive to detecting the consensus operation, content of a proxy vote transmission provided by a proxy device corresponding to at least one node device of the plurality of node devices by setting the content of the proxy vote transmission based on the approval status of the particular vote transmission. The method includes causing the proxy device to transmit the proxy vote transmission.

Byzantine fault prevention in mesh networks

A system and method of a distributed and partitioned state machine for mesh devices. The method includes obtaining a first capability dataset indicating capabilities of a first mesh node of a first mesh network system to provide a first service for a first object. The method includes obtaining a second capability dataset indicating capabilities of a second mesh node of a second mesh network system to provide a second service to a second object. The method includes generating a set of NFSM models for the first object and the second object, each NFSM model to provide the first service for the first object or the second object. The method includes providing the set of NFSM models and a partition dataset to cause a first gateway device and a second gateway device to use a single NFSM model to provide the first service to the second object.

Distributed and partitioned state machine based rule engine for mesh devices and edge devices

Systems and methods include storing, in a first base boot partition, an image of a first base operating system; storing, in a first overlay boot partition, a first overlay file system comprising a first encrypted file; configuring the first overlay boot partition to boot the image of the first base operating system from the first base boot partition and install the first overlay filesystem; and responsive to detecting an attempt to access the first encrypted file, designating the first base boot partition as an active boot partition.

Dynamic booting of operating system by designating first base boot partition as active boot partition responsive to detecting unauthorized attempt to access first encrypted file

Processing logic may provide a first container having a first software version. Processing logic may create a second container having a second software version within the first container. Processing logic may replace the first container with the second container, in response to testing of the second container satisfying one or more criteria.

Inheritance container service

A computing device determines that an action should be performed on a first edge device operating in a computing system. The computing device accesses a data structure that identifies values of computing resources of the first edge device and computational requirements of performing the action on the first edge device. The computing device determines, based on the data structure, that the first edge device lacks a computing resource to meet the computational requirements of performing the action on the first edge device. In response to determining that the first edge device lacks the computing resource to meet the computational requirements of performing the action on the first edge device, the computing device inhibits the action from being performed on the first edge device.

Minimum viable charge exchange for service operations in edge devices

Performing qubit manipulation using push notifications is disclosed herein. In one example, a quantum computing device comprises a system memory and a processor device communicatively coupled to the system memory. The processor device is to receive a push notification that includes an identifier of a qubit and a push notification payload, such as a data value to be written to the qubit and/or one or more qubit manipulation commands to be performed using the qubit. Upon receiving the push notification, the processor device obtains write access to the qubit, and then applies the push notification payload to the qubit, for example by writing the data value to the qubit and/or by executing the one or more qubit manipulation commands using the qubit.

Push notification qubit manipulation

An access request to allow a requestor process to access a protected resource is received. A qubit authentication state that identifies a desired state of a qubit is sent to the requestor process. It is determined that the requestor process has caused the qubit to have the qubit authentication state. Based at least in part on determining that the requestor process has caused the qubit to have the qubit authentication state, the requestor process is granted access to the protected resource.

Quantum authentication of protected resources

An access control process executing in a declarative container orchestration system receives a notification that the declarative container orchestration system has received a configuration file that identifies a desired future state that includes a creation of an object. Prior to allowing the declarative container orchestration system to create the object, the configuration file is analyzed. Based on the analysis, it is determined that the configuration file includes a key/value pair that is to be associated with the object. The access control process determines that a user associated with the configuration file lacks authorization to request the key/value pair. In response to determining that the user associated with the configuration file lacks authorization to request the key/value pair, the declarative container orchestration system is prevented from creating the desired future state identified in the configuration file.

Key/value pair metadata authentication for declarative process orchestration environments

A method includes determining characteristics of nodes of a mesh network and selecting one or more nodes of the mesh to receive a payload in view of the characteristics of the plurality of nodes of the mesh network. The method further includes pushing the payload to the one or more selected nodes of the mesh network, wherein the one or more nodes propagate the payload to remaining nodes of the mesh network.

Growing community of inventors

Waterford, Ireland

Leigh Griffin