Complex quantum networks: From universal breakdown to optimal transport

Oliver Mülken, Maxim Dolgushev, and Mircea Galiceanu
Phys. Rev. E 93, 022304 – Published 16 February 2016

Abstract

We study the transport efficiency of excitations on complex quantum networks with loops. For this we consider sequentially growing networks with different topologies of the sequential subgraphs. This can lead either to a universal complete breakdown of transport for complete-graph-like sequential subgraphs or to optimal transport for ringlike sequential subgraphs. The transition to optimal transport can be triggered by systematically reducing the number of loops of complete-graph-like sequential subgraphs in a small-world procedure. These effects are explained on the basis of the spectral properties of the network's Hamiltonian. Our theoretical considerations are supported by numerical Monte Carlo simulations for complex quantum networks with a scale-free size distribution of sequential subgraphs and a small-world-type transition to optimal transport.

  • Figure
  • Figure
  • Figure
  • Received 3 November 2015

DOI:https://doi.org/10.1103/PhysRevE.93.022304

©2016 American Physical Society

Physics Subject Headings (PhySH)

Networks

Authors & Affiliations

Oliver Mülken1,*, Maxim Dolgushev1, and Mircea Galiceanu2,3

  • 1Physikalisches Institut, Universität Freiburg, Hermann-Herder-Strasse 3, D-79104 Freiburg, Germany
  • 2Departamento de Física, Universidade Federal do Amazonas, 3000 Japiim, 69077-000 Manaus-AM, Brazil
  • 3Institut für Theoretische Physik, Technische Universtät Dresden, 01062 Dresden, Germany

  • *muelken@physik.uni-freiburg.de

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 93, Iss. 2 — February 2016

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×