 |
For a graph state distribution task, a request is sent with the required graph structure G and the vertices of graph G corresponding to the locations in the quantum communication network. The system then generates and distributes the corresponding graph state based on the request.
For example, to distribute a GHZ state over nodes A, B, and C, a copy is created on node A, and entangled pairs are shared between (A, C) and (A, B) using entanglement swapping technology.
By using entanglement swapping, entangled pairs can be shared over long distances. Quantum teleportation is then utilized to send the qubits of the graph state to the corresponding nodes, enabling the distribution of graph states across different nodes in the quantum network.
For example, after sharing entangled pairs between the nodes, quantum teleportation is performed at the graph state copy on node A to distribute the graph state to nodes B and C.
|
IEEE/ICACT20250011 Slide.09
[Big Slide]
[YouTube]