System and method for network distribution of quantum entanglement
US-2021175976-A1 · Jun 10, 2021 · US
US11716151B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-11716151-B2 |
| Application number | US-202117382975-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jul 22, 2021 |
| Priority date | Jul 22, 2021 |
| Publication date | Aug 1, 2023 |
| Grant date | Aug 1, 2023 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A method for routing in a quantum network is provided. The method may include receiving parameters including a fidelity with coherence decay time and an entanglement generation rate for each quantum node in a mesh quantum network by a controller, the controller being configured to communicate with each quantum node of a plurality of quantum nodes in the mesh quantum network. Each quantum node includes a quantum memory and a processor. The method may also include analyzing the fidelity with coherence decay time and the entanglement generation rate to yield a determination of a path fidelity with a path coherence decay time and a path entanglement generation rate between at least one pair of quantum nodes. The method may further include, based on the determination, selecting a quantum communication path from a source node to a destination node.
Opening claim text (preview).
What is claimed is: 1. A method for routing in a quantum network, the method comprising: receiving parameters comprising a fidelity with coherence decay time and an entanglement generation rate for each quantum node in a mesh quantum network by a controller, the controller being configured to communicate with each quantum node of a plurality of quantum nodes in the mesh quantum network, each quantum node comprising a quantum memory and a processor; analyzing the fidelity with coherence decay time and the entanglement generation rate to yield a determination of a path fidelity with a path coherence decay time and a path entanglement generation rate between at least one pair of quantum nodes of the plurality of quantum nodes; and based on the determination, selecting, through the mesh quantum network, a first quantum communication path from a source node to a destination node based upon a path fidelity of the first quantum communication path being greater than a minimum path fidelity for a quantum computing application. 2. The method of claim 1 , wherein the determination comprises the minimum path fidelity Fm and a minimum entanglement generation rate 1/T c for the quantum computing application. 3. The method of claim 2 , wherein selecting the first quantum communication path is based upon the path fidelity F p (t)=F p e −t/T F of the first quantum communication path being greater than the minimum path fidelity F m for the quantum computing application, wherein F p is an initial fidelity, and T F is a fidelity time constant. 4. The method of claim 3 , wherein the selecting the first quantum communication path is based upon a path entanglement generation rate 1/T p greater than 1/T c . 5. The method of claim 3 , wherein the selecting the first communication path further comprises selecting a second quantum communication path from the source node to the destination node based upon the path fidelity F p (t) of the first quantum communication path and a second path fidelity F p (t) of the second quantum communication path being greater than the minimum path fidelity F m for the quantum computing application and a combined entanglement generation rate 1/T p of the first quantum communication path and the second quantum communication path being greater than 1/T c . 6. The method of claim 5 , wherein the second quantum communication path has a same end point as the first quantum communication path. 7. The method of claim 1 , wherein the network further comprises a classical communication path between a plurality of classical nodes, where each of the plurality of classical nodes is located at a respective location of each of the plurality of quantum nodes, each classical node comprising a classical processor and a memory device. 8. The method of claim 1 , wherein the first quantum communication path between the source node and the destination node comprises at least one quantum link. 9. The method of claim 1 , further comprising teleporting by transferring a qubit is based upon a pair of entangled particles, in which a first entangled particle of the pair of entangled particles is at the source node and a second entangled particle of the pair of entangled particles is at the destination node, after completing quantum swapping that extends a distance between the first entangled particle and the second entangled particle using entanglement swapping repeaters from the source node to the destination node. 10. The method of claim 1 , wherein the selecting the first quantum communication path is based upon a highest margin of the fidelity for a quantum communication path. 11. The method of claim 1 , wherein the selecting the first quantum communication path is based upon a lowest margin of the fidelity for a quantum communication path. 12. The method of claim 1 , wherein the selecting the first quantum communication path is based upon a highest margin of the entanglement generation rate for a quantum communication path. 13. The method of claim 1 , wherein the selecting the first quantum communication path is based upon a lowest margin of the entanglement generation rate for a quantum communication path. 14. The method of claim 1 , wherein each of the plurality of quantum nodes comprises one particle of a first pair of entangled particles and one particle of a second pair of entangled particles. 15. A controller comprising: one or more processors; and a non-transitory computer readable medium comprising instructions stored therein, the instructions, when executed by the one or more processors, cause the processors perform operations comprising: receiving parameters comprising a fidelity with coherence decay time and an entanglement generation rate for each quantum node in a mesh quantum network, the controller being configured to communicate with each quantum node of a plurality of quantum nodes in the mesh quantum network, each quantum node comprising a quantum memory and a processor; analyzing the fidelity with coherence decay time and the entanglement generation rate to yield a determination of a path fidelity with a path coherence decay time and a path entanglement generation rate between at least one pair of quantum nodes; and based on the determination, selecting, through the mesh quantum network, a quantum communication path from a source node to a destination node based upon a path fidelity of the first quantum communication path being greater than a minimum path fidelity for a quantum computing application. 16. The controller of claim 15 , wherein the determination comprises the minimum path fidelity F m and a minimum entanglement generation rate 1/T c for the quantum computing application. 17. The controller of claim 16 , wherein the selecting the quantum communication path is based upon the path fidelity F p (t)=F p e −t/T F greater than the minimum F m for the quantum computing application, wherein F p is an initial fidelity, and T F is a fidelity time constant. 18. The controller of claim 16 , wherein the selecting the quantum communication path is based upon a path entanglement generation rate 1/T p greater than 1/T. 19. A non-transitory computer readable medium comprising instructions, the instructions, when executed by a computing system, cause the computing system to perform operations comprising: receiving parameters comprising a fidelity with coherence decay time and an entanglement generation rate for each quantum node in a mesh quantum network, the computing system being configured to communicate with each quantum node of a plurality of quantum nodes in the mesh quantum network, each quantum node comprising a quantum memory and a processor; analyzing the fidelity with coherence decay time and the entanglement generation rate to yield a determination of a path fidelity with a path coherence decay time and a path entanglement generation rate between at least one pair of quantum nodes; and based on the determination, selecting, through the mesh quantum network, a quantum communication path from a source node to a destination node based upon a path fidelity of the first quantum communication path being greater than a minimum path fidelity for a quantum computing application. 20. The non-transitory computer readable medium of claim 19 , wherein the determination comprises the minimum path fidelity F m and a minimum entanglement generation rate 1/T c for the quantum computing application, wherein the selecting of the quantum communication path is based upon a path entanglement generation rate 1/T p g
Related publications grouped by family.
Answers are generated from the same data shown on this page.