|
Existing quantum communication networks, designed primarily for single- qubit transmission, face challenges in effectively distributing graph states. These networks lack the capability to handle the complex entanglement relationships required for graph states.
For example, methods proposed by M. Cuquet et al. and Clément Meignant et al. assume unlimited node qubit resources, which is not practical in real- world quantum communication network environments.
In practical quantum communication networks, nodes have limited quantum resources. Distributing a complete graph state in one go can impose significant resource pressure on individual nodes, making it difficult to meet distribution requests.
For instance, a node preparing a large graph state copy may not have enough quantum bits to also hold the entangled pairs required for quantum teleportation, leading to resource constraints.
|