Search All Patents in Quantum Computing
Patent US10373020
Issued 2019-08-06
Computer Architecture For Emulating An Asynchronous Correlithm Object Processing System
A device that includes a node engine configured to emulate a first node, a second node, and a third node. The first node is configured to receive a first correlithm object, fetch a second correlithm object based on the first correlithm object, and output the second correlithm object to the second node and the third node. Each correlithm object is a point in an n-dimensional space represented by a binary string. The second node is configured to receive the second correlithm object, fetch a third correlithm object based on the second correlithm object, and output the third correlithm object to the third node. The third node is configured to receive the second correlithm object, receive the third correlithm object, fetch a fourth correlithm object based on the second correlithm object and the third correlithm object, and output the fourth correlithm object.
Much More than Average Length Specification
View the Patent Matrix® Diagram to Explore the Claim Relationships
USPTO Full Text Publication >
- 1. A device configured to emulate an asynchronous correlithm object processing system, comprising:
a node engine configured to emulate:
a first node linked with a first node table, wherein:
the first node table identifies:
a first plurality of correlithm objects, wherein each correlithm object in the first plurality of correlithm objects is a point in a first n-dimensional space represented by a binary string; and
a second plurality of correlithm objects linked with the first plurality of correlithm objects, wherein each correlithm object in the second plurality of correlithm objects is a point in a second n-dimensional space represented by a binary string; and
the first node is configured to:
receive a first correlithm object;
fetch a second correlithm object from among the second plurality of correlithm objects based on the first correlithm object, wherein fetching the second correlithm object comprises:
determining Hamming distances between the first correlithm object and each of the first plurality of correlithm objects;
identifying a correlithm object with the shortest Hamming distance between the first correlithm object and each of the first plurality of correlithm objects; and
identifying an entry in the first node table that corresponds with the identified correlithm object; and
output the second correlithm object to a second node.
- 8. A method for emulating an asynchronous correlithm object processing system, comprising:
receiving, by a first node implemented by a node engine, a first correlithm object; fetching, by the first node, a second correlithm object from a first node table based on the first correlithm object, wherein the first node table identifies:
a first plurality of correlithm objects, wherein each correlithm object in the first plurality of correlithm objects is a point in a first n-dimensional space represented by a binary string; and
a second plurality of correlithm objects linked with the first plurality of correlithm objects, wherein each correlithm object in the second plurality of correlithm objects is a point in a second n-dimensional space represented by a binary string; and
wherein fetching the second correlithm object comprises:
determining Hamming distances between the first correlithm object and each of the first plurality of correlithm objects;
identifying a correlithm object with the shortest Hamming distance between the first correlithm object and each of the first plurality of correlithm objects; and
identifying an entry in the first node table that corresponds with the identified correlithm object; and
outputting, by the first node, the second correlithm object to a second node implemented by the node engine.
- 15. A computer program product comprising executable instructions stored in a non-transitory computer readable medium such that when executed by a processor causes the processor to emulate an asynchronous correlithm object processing system configured to:
implement a first node using a node engine; receive, using the first node, a first correlithm object; fetch, using the first node, a second correlithm object from a first node table based on the first correlithm object, wherein the first node table identifies:
a first plurality of correlithm objects, wherein each correlithm object in the first plurality of correlithm objects is a point in a first n-dimensional space represented by a binary string; and
a second plurality of correlithm objects linked with the first plurality of correlithm objects, wherein each correlithm object in the second plurality of correlithm objects is a point in a second n-dimensional space represented by a binary string; and
wherein fetching the second correlithm object comprises:
determining Hamming distances between the first correlithm object and each of the first plurality of correlithm objects;
identifying a correlithm object with the shortest Hamming distance between the first correlithm object and each of the first plurality of correlithm objects; and
identifying an entry in the first node table that corresponds with the identified correlithm object; and
output, using the first node, the second correlithm object to a second node.
