Structural Complexity Of Quantum Networks

TL;DR

This paper explores how the physical structure of quantum networks influences the complexity of entanglement graphs, revealing that simple physical arrangements can generate highly complex entanglement patterns.

Contribution

It demonstrates that classical physical constraints do not limit the complexity of entanglement graphs achievable in quantum networks.

Findings

1D quantum networks can simulate various entanglement graph types

Physical structure does not restrict entanglement graph complexity

Complex entanglement graphs can be generated in simple quantum networks

Abstract

Quantum network is a set of nodes connected with channels, through which the nodes communicate photons and classical information. Classical structural complexity of a quantum network may be defined through its physical structure, i.e. mutual position of nodes and channels connecting them. We show here that the classical structural complexity of a quantum network does not restrict the structural complexity of entanglement graphs, which may be created in the quantum network with local operations and classical communication. We show, in particular, that 1D quantum network can simulate both simple entanglement graphs such as lattices and random graphs and complex small-world graphs.