Abstract
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.
Original language | English |
---|---|
Article number | 473 |
Number of pages | 11 |
Journal | Entropy |
Volume | 19 |
Issue number | 9 |
DOIs | |
Publication status | Published - 05 Sept 2017 |
Keywords
- Cluster states
- Multipartite entanglement
- Percolation
ASJC Scopus subject areas
- General Physics and Astronomy