Localization of quantum walks on a deterministic recursive tree

zbMATH Open1237.81042MaRDI QIDQ3171712FDOQ3171712

Authors: Xin-Ping Xu 

Publication date: 5 October 2011

Recommendations

• A limit law of the return probability for a quantum walk on a hexagonal lattice
• Local subgraph structure can cause localization in continuous-time quantum walk
• Continuous-time quantum walk on integer lattices and homogeneous trees
• The localization of quantum random walks on Sierpinski gaskets
• Localization in quantum walks with periodically arranged coin matrices

zbMATH Keywords

localizationquantum walksdeterministic recursive tree

Mathematics Subject Classification ID

Trees (05C05) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Cited In (8)

• Lower bounds on the localisation length of balanced random quantum walks
• Local subgraph structure can cause localization in continuous-time quantum walk
• The localization of quantum random walks on Sierpinski gaskets
• A limit law of the return probability for a quantum walk on a hexagonal lattice
• Localization of a multi-dimensional quantum walk with one defect
• Almost sure quasilocality fails for the random-cluster model on a tree.
• Dynamical localization for \(d\)-dimensional random quantum walks
• Laplacian spectrum of a family of recursive trees and its applications in network coherence

This page was built for publication: Localization of quantum walks on a deterministic recursive tree

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