Coupling of rational agents to quantum processes
First Claim
Patent Images
1. A computer program product comprising a non-transitory computer readable storage medium storing computer usable program code executable to perform operations for evaluating an influence of an artificial intelligence agent on a quantum process, the operations comprising:
- a) receiving a quantum bitstream indicative of the quantum process, wherein the quantum bitstream includes two or more bit patterns;
b) ranking a list of two or more tasks based on an algorithmically-predicted quality of each of the two or more tasks to determine a higher-ranked task and a lower-ranked task;
c) associating the higher-ranked task with a first one of the two or more bit patterns;
d) associating the lower-ranked task with a second one of the two or more bit patterns;
e) performing the higher-ranked task for each occurrence of the first bit pattern in the quantum bitstream;
f) performing the lower-ranked task for each occurrence of the second bit pattern in the quantum bitstream;
g) generating a pseudo-random bitstream comprising two or more bit patterns;
h) repeating steps c-f using the pseudo-random bitstream; and
i) determining a difference of an entropy of the quantum bitstream and an entropy of the pseudo-random bitstream.
1 Assignment
0 Petitions
Accused Products
Abstract
The present invention provides devices, methods, and systems for coupling a rational agent to a quantum process. In particular, the present invention provides rational agents configured to influence a quantum process, or to derive information from a quantum process, and methods and uses thereof.
-
Citations
3 Claims
-
1. A computer program product comprising a non-transitory computer readable storage medium storing computer usable program code executable to perform operations for evaluating an influence of an artificial intelligence agent on a quantum process, the operations comprising:
-
a) receiving a quantum bitstream indicative of the quantum process, wherein the quantum bitstream includes two or more bit patterns; b) ranking a list of two or more tasks based on an algorithmically-predicted quality of each of the two or more tasks to determine a higher-ranked task and a lower-ranked task; c) associating the higher-ranked task with a first one of the two or more bit patterns; d) associating the lower-ranked task with a second one of the two or more bit patterns; e) performing the higher-ranked task for each occurrence of the first bit pattern in the quantum bitstream; f) performing the lower-ranked task for each occurrence of the second bit pattern in the quantum bitstream; g) generating a pseudo-random bitstream comprising two or more bit patterns; h) repeating steps c-f using the pseudo-random bitstream; and i) determining a difference of an entropy of the quantum bitstream and an entropy of the pseudo-random bitstream. - View Dependent Claims (2, 3)
-
Specification