Trapping of continuous-time quantum walks on Erdős-Rényi graphs

DOI10.1016/J.PHYSA.2011.01.021MaRDI QIDQ647812zbMATH OpenOpenAlexFDO

Authors Elena Agliari

Publication date 19 November 2011

Published in Physica A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1102.3994

Mathematics Subject Classification ID

Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Abstract: We consider the coherent exciton transport, modeled by continuous-time quantum walks, on Erd"{o}s-R'{e}ny graphs in the presence of a random distribution of traps. The role of trap concentration and of the substrate dilution is deepened showing that, at long times and for intermediate degree of dilution, the survival probability typically decays exponentially with a (average) decay rate which depends non monotonically on the graph connectivity; when the degree of dilution is either very low or very high, stationary states, not affected by traps, get more likely giving rise to a survival probability decaying to a finite value. Both these features constitute a qualitative difference with respect to the behavior found for classical walks.

Recommendations

• Continuous-time quantum walks on Erdős-Rényi networks
• Continuous-time quantum walks and trapping
• Quantum walks and trapping on regular hyperbranched fractals
• Percolation assisted excitation transport in discrete-time quantum walks
• Survival of classical and quantum particles in the presence of traps

Cites work

• A critical point for random graphs with a given degree sequence
• Characteristic vectors of bordered matrices with infinite dimensions
• Continuous-time quantum walks on Erdős-Rényi networks
• Dynamics of continuous-time quantum walks in restricted geometries
• Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
• Laplacian graph eigenvectors
• Laplacian matrices of graphs: A survey
• Quantum Transport: Atom to Transistor
• Quantum algorithms a decade after Shor
• Random graphs.
• Random walks on lattices. II

Cited in

(8)

• Enhanced quantum transport in multiplex networks
• Percolation assisted excitation transport in discrete-time quantum walks
• Survival of classical and quantum particles in the presence of traps
• Continuous-time quantum walks on Erdős-Rényi networks
• Continuous-time quantum walks and trapping
• Quantum walks: a comprehensive review
• Quantum walks and trapping on regular hyperbranched fractals
• Universally optimal noisy quantum walks on complex networks

This page was built for publication: Trapping of continuous-time quantum walks on Erdős-Rényi graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q647812)