Structural Complexity Of Quantum Networks
arXiv:1602.06154 · doi:10.1063/1.4953138
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.
arXiv comment5 pages, 1 figure
References in corpus (9)
- The Quantum Internet
- Epidemic processes in complex networks
- Long-distance quantum communication with atomic ensembles and linear optics
- Quantum Computing
- Free-Space distribution of entanglement and single photons over 144 km
- Distributed Quantum Computation over Noisy Channels
- Purification via entanglement swapping and conserved entanglement
- Entanglement Distribution in Pure-State Quantum Networks
- Small-World Bonds and Patchy Percolation on the Hanoi Network
Cited by in corpus (6)
- Any Quantum Network is Structurally Controllable by a Single Driving Signal
- Information geometric methods for complexity
- Complex Quantum Networks: a Topical Review
- Multipartite entanglement, quantum coherence, and quantum criticality in triangular and Sierpiński fractal lattices
- Quantum Entanglement Percolation
- Percolation Transition Control in Quantum Networks