专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20220103528A1 CLASSICAL IMPLEMENTATION OF QUANTUM ENTANGLEMENT IN DATACENTER NETWORK DESIGN 有权
公开(公告)号：US20220103528A1
公开(公告)日：2022-03-31
申请号：US17515424
申请日：2021-10-30
申请人： ERIC LITAK
发明人： PAUL L. BORRILL
IPC分类号： H04L29/06 , H04L9/08
摘要： Quantum mechanics provides several features useful for datacenter networking. The no cloning theorem, which states that it is impossible to mate a duplicate of an arbitrary, unknown quantum state, can be used to detect eavesdroppers. Entanglement allows two parties to have common knowledge of a shared state.
These properties are being used today for quantum key exchange and quantum computing, but they are currently too expensive for general use. Fortunately, we can use classical mechanisms to get a close enough approximation of these quantum properties to solve some important problems in distributed computing.
Nothing we describe here is quantum mechanical. Rather, we show that it is possible to use classical mechanisms to emulate some properties of quantum mechanics, which enable us to address interesting problems in distributed computing. The engineering insight, is that we can get closer to achieving these properties than might be expected through conventional thinking. The key to obtaining the properties we desire is to make the inherently asynchronous system temporarily locally synchronous tor the operations we need.
In this patent, we describe how to classically emulate the parts of the no cloning theorem and entanglement that we need for datacenter networking. We then demonstrate how those approximations to quantum behavior can be used to solve important problems in distributed computing, such as ‘exactly-once’ semantics in an environment where failures occur and can be healed without applications needing to know.

2. 发明申请

US20220182153A1 CLASSICAL IMPLEMENTATION OF ENTANGLEMENT 有权
公开(公告)号：US20220182153A1
公开(公告)日：2022-06-09
申请号：US17681834
申请日：2022-02-27
申请人： Eric Litak
发明人： Paul L. Borrill
IPC分类号： H04B10/70 , H04L41/12
摘要： 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.

3. 发明授权

US11296800B2 Classical implementation of entanglement 有权
公开(公告)号：US11296800B2
公开(公告)日：2022-04-05
申请号：US15959161
申请日：2018-04-20
申请人： ERIC LITAK
发明人： Paul L. Borrill
IPC分类号： H04L12/28 , H04B10/70 , H04L41/12
摘要： Computational nodes are connected to each other via multiple point to point communication ports to form a mesh network. When a node receives such 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.

4. 发明授权

US11196713B2 Classical implementation of quantum entanglement in datacenter network design 有权
公开(公告)号：US11196713B2
公开(公告)日：2021-12-07
申请号：US16162632
申请日：2018-10-17
申请人： Eric Litak
发明人： Paul L. Borrill
IPC分类号： H04L29/06 , H04L9/08
摘要： Quantum mechanics provides several features useful for datacenter networking. The no cloning theorem, which states that it is impossible to mate a duplicate of an arbitrary, unknown quantum state, can be used to detect eavesdroppers. Entanglement allows two parties to have common knowledge of a shared state.
These properties are being used today for quantum key exchange and quantum computing, but they are currently too expensive for general use. Fortunately, we can use classical mechanisms to get a close enough approximation of these quantum properties to solve some important problems in distributed computing.
Nothing we describe here is quantum mechanical. Rather, we show that it is possible to use classical mechanisms to emulate some properties of quantum mechanics, which enable us to address interesting problems in distributed computing. The engineering insight, is that we can get closer to achieving these properties than might be expected through conventional thinking. The key to obtaining the properties we desire is to make the inherently asynchronous system temporarily locally synchronous for the operations we need.
In this patent, we describe how to classically emulate the parts of the no cloning theorem and entanglement that we need for datacenter networking. We then demonstrate how those approximations to quantum behavior can be used to solve important problems in distributed computing, such as ‘exactly-once’ semantics in an environment where failures occur and can be healed without applications needing to know.

5. 发明申请

US20230111678A1 ENTANGLED LINKS, TRANSACTIONS AND TREES FOR DISTRIBUTED COMPUTING SYSTEMS 有权
公开(公告)号：US20230111678A1
公开(公告)日：2023-04-13
申请号：US18045457
申请日：2022-10-10
申请人： ERIC LITAK
发明人： Paul Borrill
IPC分类号： H04L9/08
摘要： An entangled links mechanism to establish and maintain bipartite temporal intimacy between pairs of computers using an idempotent, reversible token method, which presents no observable external “change” until communication of information needs to occur between the computers and which maintains the potential for “bounded (or unbounded) reversibility” in case the intended information dispatched by a source computational entity is not captured or properly accepted by a destination computational entity. The mechanism enables distributed computers in a network to remain continuously aware of each other's presence; to communicate on a logically nearest neighbor basis in a secure and reliable manner in which packets passed over these links do not conflict with normal traffic or cause the available resources of the link to exceeded; and that atomicity, isolation, and “reversible durability” may be maintained for transactions when perturbations occur.

6. 发明授权

US11526493B2 Generalized reversibility framework for common knowledge in scale-out database systems 有权
公开(公告)号：US11526493B2
公开(公告)日：2022-12-13
申请号：US16694054
申请日：2019-11-25
申请人： Eric Litak
发明人： Paul L. Borrill
IPC分类号： G06F16/00 , G06F16/23 , H04L67/10
摘要： A computer-implemented system with a processor provides a reversible transfer of an atomic token from one side of an imperfect link to the other, such that if the protocol (or process) on either side fails at a critical moment, the atomic token will be found on both sides to be verifiably incomplete, unless the protocol has completed successfully past its ‘irreversible threshold’ on both sides.

7. 发明授权

US11516007B2 Entangled links, transactions and trees for distributed computing systems 有权
公开(公告)号：US11516007B2
公开(公告)日：2022-11-29
申请号：US15687529
申请日：2017-08-27
申请人： Eric Litak
发明人： Paul Borrill
IPC分类号： H04L12/00 , H04L9/08
摘要： An entangled links mechanism to establish and maintain bipartite temporal intimacy between pairs of computers, using an idempotent, reversible token method which presents no observable external “change” until a communication of information needs to occur between the computers, and which maintains the potential for “bounded (or unbounded) reversibility” in case the intended information dispatched by a source computational entity is not captured or properly accepted by a destination computational entity. The mechanism enables distributed computers in a network to remain continuously aware of each other's presence; to communicate on a logically nearest neighbor basis in a secure and reliable manner in which packets passed over these links do not conflict with normal traffic or cause the available resources of the link to be exceeded; and that atomicity, consistency, isolation, and “reversible durability” may be maintained for transactions when perturbations occur.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式