Qubit-implemented role-based access control

Patent metadata

Field	Value
Publication number	US-12450376-B2
Application number	US-202217876947-A
Country	US
Kind code	B2
Filing date	Jul 29, 2022
Priority date	Jul 29, 2022
Publication date	Oct 21, 2025
Grant date	Oct 21, 2025

Abstract

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.

First claim

What is claimed is:

1. A method comprising:
receiving, by a quantum computing system from a requestor, a first access request that identifies a subject, an action, and a resource;
accessing 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;
determining, based on the mapping structure, a set of qubits of the plurality of qubits that applies to the access request; and
providing data encoded in the set of qubits or a reference to each qubit in the set of qubits to the requestor.

2. The method of claim 1 wherein providing data encoded in the set of qubits or the reference to each qubit in the set of qubits to the requestor further comprises reading out each qubit in the set of qubits to obtain the data encoded in the set of qubits.

3. The method of claim 1 wherein the set of qubits comprises a fewer number of qubits than the plurality of qubits.

4. The method of claim 1 further comprising:
determining the one or more quantum instruction files of a plurality of quantum instruction files that govern access to the resource, the one or more quantum instruction files comprising quantum instructions to, when initiated, modify the plurality of qubits to contain the rules that govern access to the resource; and
initiating the one or more quantum instruction files to place the plurality of qubits into superposition encoded with the rules.

5. The method of claim 4 further comprising:
determining a quantity of qubits to be used by the one or more quantum instruction files; and
allocating the plurality of qubits based on the quantity of qubits to be used by the one or more quantum instruction files.

6. The method of claim 5 wherein determining the quantity of qubits to be used by the one or more quantum instruction files comprises accessing quantum instruction file metadata that corresponds to the one or more quantum instruction files, the quantum instruction file metadata identifying the quantity of qubits to be used by the one or more quantum instruction files.

7. The method of claim 5 wherein determining the quantity of qubits to be used by the one or more quantum instruction files comprises parsing quantum instructions in the one or more quantum instruction files to determine the quantity of qubits to be used by the one or more quantum instruction files.

8. The method of claim 1 wherein the subject comprises a quantum task executing on the quantum computing system.

9. The method of claim 1 wherein the subject comprises a classical task executing on a classical computing device that is communicatively coupled to the quantum computing system.

10. The method of claim 1 wherein the subject comprises a quantum task executing on the quantum computing system, and wherein the resource comprises a qubit implemented on the quantum computing system.

11. The method of claim 1 further comprising:
determining, based on processing the plurality of qubits, that the subject does not have privileges to perform the action on the resource; and
denying the access request.

12. The method of claim 1 further comprising:
accessing a plurality of quantum instruction files, each quantum instruction file comprising quantum instructions to, when initiated, modify a plurality of qubits to contain rules that govern an access request;
generating, based on the plurality of quantum instruction files, an aggregate quantum instruction file that combines the rules;
and where the first quantum instruction file comprises the aggregate quantum instruction file.

13. The method of claim 1 further comprising:
generating, by the quantum computing system, the mapping structure, the mapping structure comprising data that maps subjects, actions and resources identified in the plurality of rules that govern access to the resource to specific qubits of the plurality of qubits.

14. The method of claim 13 wherein generating the mapping structure further comprises:
parsing a plurality of quantum instruction files to identify one or more subjects, actions and resources; and
determining in which qubits of the plurality of qubits the subjects, actions and resources have been encoded.

15. A quantum computing system, comprising:
a memory; and
a processor device coupled to the memory to:
receive, by a quantum computing system from a requestor, a first access request that identifies a subject, an action, and a resource;
access 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;
determine, based on the mapping structure, a set of qubits of the plurality of qubits that applies to the access request; and
provide data encoded in the set of qubits or a reference to each qubit in the set of qubits to the requestor.

16. The quantum computing system of claim 15 wherein to provide the data encoded in the set of qubits or the reference to each qubit in the set of qubits to the requestor, the processor device is further to:
read out each qubit in the set of qubits to obtain the data encoded in the set of qubits.

17. The quantum computing system of claim 15 wherein the processor device is further to:
determine the one or more quantum instruction files of a plurality of quantum instruction files that govern access to the resource, the one or more quantum instruction files comprising quantum instructions to, when initiated, modify the plurality of qubits to contain the rules that govern access to the resource; and
initiate the one or more quantum instruction files to place the plurality of qubits into superposition encoded with the rules.

18. A non-transitory computer-readable storage medium that includes executable instructions to cause a processor device of a quantum computing system to:
receive, by a quantum computing system from a requestor, a first access request that identifies a subject, an action, and a resource;
access 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;
determine, based on the mapping structure, a set of qubits of the plurality of qubits that applies to the access request; and
provide data encoded in the set of qubits or a reference to each qubit in the set of qubits to the requestor.

19. The non-transitory computer-readable storage medium of claim 18 wherein to provide the data encoded in the set of qubits or the reference to each qubit in the set of qubits to the requestor, the instructions further cause the processor device to read out each qubit in the set of qubits to obtain the data encoded in the set of qubits.

20. The non-transitory computer-readable storage medium of claim 18 wherein the instructions further cause the processor device to:
determine the one or more quantum instruction files of a plurality of quantum instruction files that govern access to the resource, the one or more quantum instruction files comprising quantum instructions to, when initiated, modify the plurality of qubits to contain the rules that govern access to the resource; and
initiate the one or more quantum instruction files to place the plurality of qubits into superposition encoded with the rules.

Assignees

• Red Hat Inc

Inventors

• Griffin Leigh
• Coady Stephen

Classifications

• G06N10/40

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

• G06N10/20

  Models of quantum computing, e.g. quantum circuits or universal quantum computers · CPC title

• G06N10/80

  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

• G06F21/6218 Primary

  to a system of files or objects, e.g. local or distributed file system or database · CPC title