IP Library Granted Patent US 12,451,974
Granted Patent B2
US 12,451,974 · App. 18/528,706 · Granted Oct 21, 2025

Classical implementation of entanglement

Inventor: Paul L. Borrill (Palo Alto, CA)
Assignee: Eric Litak
H04B10/70
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 12,451,974
App. No.
18/528,706
Granted
Oct 21, 2025
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 (16)

1. A computer-implemented method for sending an Atomic Information Transfer (AIT) token from a cell to multiple cells within a mesh of cells through multiple intermediate endpoints to complete the AIT token transfer among each cell within the mesh of cells, comprising:

(a) sending multiple separate AIT tokens successively to the mesh of cells unless the multiple separate AIT tokens are retired by each cell along the path of the AIT token within the mesh of cells, wherein the AIT tokens are transferred from one cell to another cell within the mesh of cells and wherein the AIT token transfer fails once the AIT token transfers to each cell within the mesh of cells indicating the AIT token transfer is complete; or

(b) sending a single AIT token with a count allowing each cell within the mesh of cells to decrement the count wherein if the count does not go to zero, then either an error occurred while sending the single AIT token or during the transfer of the single AIT token from one cell to another cell within the mesh of cells or one or more cells departed from the mesh of cells; or

(c) sending a single AIT token on each port within the mesh of cells, wherein as the single AIT token transfers from one cell to another cell, the single AIT token replicates itself into other cells within each port, collects and accumulates information from each cell and returns the AIT token from each cell within each port and send a summary token comprising a summary of information from each cell within each port forward, wherein the summary token reflects each cell information which respond to the AIT token and each cell information which did not respond to the AIT token.

2. The computer-implemented method of claim 1 , wherein each AIT token has a unique identifier, wherein recovery of each AIT token can occur independently of another.

3. The computer-implemented method of claim 1 , wherein the method enables load balancing.

4. The computer-implemented method of claim 1 , wherein the method enables credit-based control flow on a single link.

5. The computer-implemented method of claim 1 , wherein each cell within the mesh of cells sending the AIT token to another cell within the mesh of cells cannot make a change to the AIT token after sending the AIT token.

6. The computer-implemented method of claim 1 , wherein each cell within the mesh of cells receiving the AIT token from another cell within the mesh of cells rejects the AIT token back to the cell and sends the AIT token as unprocessed if the cell within the mesh of cells receiving the AIT token has a failure of local application.

7. The computer-implemented method of claim 6 , wherein rejecting and sending the AIT token as unprocessed, return the AIT token back to the state the AIT token was before the beginning of the AIT token transfer.

8. The computer-implemented method of claim 1 , wherein the cell within the mesh of cells sending the AIT token cannot retrieve the AIT token after sending the AIT token.

9. The computer-implemented method of claim 1 , wherein the multiple AIT tokens can be pipelined such that only one AIT token may be concurrently active.

10. The computer-implemented method of claim 1 , wherein the AIT token is transferred from one cell within the mesh of cells to another cell within the mesh of cells over a communication link.

11. The computer-implemented method of claim 1 , wherein sending the AIT token from a cell within the mesh of cells initiates a 4-phase protocol through a shared state machine (SSM).

12. The computer-implemented method of claim 1 , wherein the AIT token comprises a packet of information.

13. The computer-implemented method of claim 1 , wherein the method performs exactly one semantics.

Continuity (9)
Continuation 17681834 · Feb 27, 2022
Continuation 15959161 · Apr 20, 2018
Continuation In Part 15687529 · Aug 27, 2017
Continuation 14331225 · Jul 14, 2014
Provisional Application 61846602 · Jul 15, 2013
Provisional Application 61893285 · Oct 21, 2013
Provisional Application 61913302 · Dec 8, 2013
Provisional Application 62488025 · Apr 20, 2017
Related Publication 20250112707A1 · Apr 3, 2025
References Cited (27)
US 6993022B1 · James et al. · 2006 [cited by applicant]
US 7440436B2 · Cheng et al. · 2008 [cited by applicant]
US 7623459B2 · Yang et al. · 2009 [cited by applicant]
US 7626967B2 · Yarvis et al. · 2009 [cited by applicant]
US 7836007B2 · Beausoleil · 2010 [cited by applicant]
US 9173111B2 · Pace et al. · 2015 [cited by applicant]
US 20040208638A1 · Jansen · 2004 [cited by examiner]
US 20090037451A1 · Borrill · 2009 [cited by applicant]
US 20090046732A1 · Pratt et al. · 2009 [cited by applicant]
US 20090254572A1 · Redlich et al. · 2009 [cited by applicant]
US 20100085916A1 · Yu et al. · 2010 [cited by applicant]
US 20100165886A1 · Borrill · 2010 [cited by applicant]
US 20110113099A1 · Teng et al. · 2011 [cited by applicant]
US 20140347975A1 · Yoshimoto · 2014 [cited by applicant]
US 20160105439A1 · Hunt et al. · 2016 [cited by applicant]
US 20190141016A1 · Borrill · 2019 [cited by applicant]
Borrill, Insights into the Nature of Time in Physics, and implications for Computer Science, Earth Computing, Inc., 58 pages, Apr. 16, 2014. [cited by examiner]
Chen, Breaking Quantum Limits with Collective Cavity-QED: Generation of Spin Squeezed States via Quantum Non-Demolition Measurements, Thesis, University of Colorado, 214 pages, 2013. [cited by examiner]
Schleier-Smith, Cavity-Enabled Spin Squeezing for a Quantum-Enhanced Atomic Clock, Thesis, Massachusetts Institute of Technology, 135 pages, Jun. 2011. [cited by examiner]
Marcello Caleffi, “Optimal routing for quantum networks”, IEEE Access, Oct. 16, 2017, vol. 5, pp. 22299-22312. [cited by applicant]
Borrill and Karp, “The time-less datacenter”, Stanford EE Computer System Colloquium, Nov. 16, 2016. [cited by applicant]
Reutter and Vicary, “A classical groupoid model for quantum networks”, Department of Computer Science, University of Oxford, Oct. 4, 2018. [cited by applicant]
Ian F. Akyildiz, “A survey on wireless mesh networks”, IEEE Radio Communications, Sep. 2005. [cited by applicant]
Bruno et al,, “Mesh networks: Commodity multihop ad hoc networks”, IEEE Communications Magazine, Mar. 2005. [cited by applicant]
DARPA Quantum Network Testbed, Final Technical Report, Jul. 2007. [cited by applicant]
Xiu et al., Quantum Teleportation Schemes of an N-Particle State via Three-Particle General W States, Commun. Theor. Phys. Beijing China, vol. 49, No. 4, 4 pages, Apr. 15, 2008. [cited by applicant]
Tsai et al., Teleportation of a Pure EPR State via GHZ-like State, Springer, 7 pages, May 21, 2010. [cited by applicant]