IP Library Granted Patent US 11,876,566
Granted Patent B2
US 11,876,566 · App. 17/681,834 · Granted Jan 16, 2024

Classical implementation of entanglement

Inventor: Paul L. Borrill (Palo Alto, CA)
Assignee: Eric Litak
H04B10/70H04L41/12
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,876,566
App. No.
17/681,834
Granted
Jan 16, 2024
Kind
B2
Abstract

Computational nodes are connected to each other via multiple point to point communication ports to form a mesh network. When a node receives such a routing information, it will be a set of {Route ID, Forwarding Ports} pair, where the ports can be multiple targets including the node itself. When all the nodes within the routing path receive such information, the mesh system can handle the packet transfer for the given Route ID. Each node looks up the table with Route ID and determines where to forward the packet.

Claims (17)

1. A method for point-to-point communications in a link between a first networking node and another networking node for transferring a packet of information between the first networking node and another networking node within a mesh network, comprising:

preparing an Element of Independent Information (EII) capable of representing a plurality of states;

sending the EII continually on the link until the EII is either received and accepted by another networking node or another networking node sends an Element of Shared Information (ESI) to the link in response to the EII, wherein the ESI is a combination of EII merged with the packet of information available at another networking node;

exchanging the ESI between the first networking node and another networking node; and

updating the ESI continually with information from both the first networking node and another networking node.

2. The method according to claim 1 , wherein the plurality of states is represented by +1, −1, or Ø state.

3. The method according to claim 2 , wherein the ESI represent half of the packet of information as +1 state on the one side of the link and the other half of the information as −1 on the other side of the link, wherein the half of the packet of information on one side of the link is complementary to the other half of the information on the other side of the link.

4. The method according to claim 2 , wherein the +1, −1, or Ø state on either side of the link are maintained to track the presence or absence of the ESI on either side of the link.

5. The method according to claim 2 , wherein the +1, −1, or Ø state on either side of the link is maintained to estimate the value of the ESI on either side of the link.

6. The method according to claim 1 , wherein exchanging the ESI between the first networking node and another networking node comprises exchanging the ESI in perpetuity to establish a liveness protocol.

7. The method according to claim 1 , wherein the method exchanges the ESI between the first networking node and another networking node until either the first networking node or another networking node sends an Atomic Information Transfer (AIT) token.

8. The method according to claim 7 , wherein exchanging the ESI between the first networking node and another networking node comprises sending a plurality of AIT tokens.

9. The method according to claim 8 , wherein the each AIT token from the plurality of tokens has a unique identity enabling sending an unlimited number of AIT tokens.

10. The method according to claim 7 , wherein sending an AIT token by either the first networking node or another networking node, initiates a 4-phase protocol through a shared state machine (SSM).

11. The method according to claim 8 , wherein the method comprises sending the AIT token concurrently such that only a single AIT token is active on the link at a given time.

12. The method according to claim 1 , wherein the method manages conserved and equal quantities.

13. The method according to claim 1 , wherein the method performs exactly one semantics.

Continuity (8)
Continuation 15959161 · Apr 20, 2018
Continuation In Part 15687529 · Aug 27, 2017
Continuation 14331225 · Jul 14, 2014
Provisional Application 62488025 · Apr 20, 2017
Provisional Application 61846602 · Jul 15, 2013
Provisional Application 61893285 · Oct 21, 2013
Provisional Application 61913302 · Dec 8, 2013
Related Publication 20220182153A1 · Jun 9, 2022
Cited By (1)
US 12,381,722