2017/07/21 by Mario A. Ciampini, Mario Arnolfo Ciampini, Paolo Mataloni +1
Computer Science · Mathematics · Physics and Astronomy · #Cluster (spacecraft) #Cluster state #Combinatorics #Computer network #Computer science #Mathematics #Multipartite #Multipartite entanglement #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum computer #Quantum entanglement #Quantum mechanics #Quantum network #Squashed entanglement #Statistical physics #Theoretical computer science #Topology (electrical circuits) #quant-ph
paper · pdf · doi:10.3390/e19090473
published as Entropy 2017, 19(9), 473 · 6 pages, 8 figures, revtex4-1
arxiv created 2017/07/21 · openalex publication_date 2017/09/05 · arxiv updated 2017/12/14 · openalex created_date 2021/06/22 · openalex updated_date 2026/08/05
Quantum networks are natural scenarios for the communication of information among distributed parties, and the arena of promising schemes for distributed quantum computation. Measurement-based quantum computing is a prominent example of how quantum networking, embodied by the generation of a special class of multipartite states called cluster states, can be used to achieve a powerful paradigm for quantum information processing. Here we analyze randomly generated cluster states in order to address the emergence of correlations as a function of the density of edges in a given underlying graph. We find that the most widespread multipartite entanglement does not correspond to the highest amount of edges in the cluster. We extend the analysis to higher dimensions, finding similar results, which suggest the establishment of small world structures in the entanglement sharing of randomised cluster states, which can be exploited in engineering more efficient quantum information carriers.