Sedentary quantum walks
From MaRDI portal
Abstract: Let be a graph with adjacency matrix . The extsl{continuous quantum walk} on is determined by the unitary matrices . If is the complete graph and , then [1-|U(t)_{a,a}|le2/n. ] In a sense, this means that a quantum walk on a complete graph stay home with high probability. In this paper we consider quantum walks on cones over an -regular graph on vertices. We prove that if as increases, than a quantum walk that starts on the apex of the cone will remain on it with probability tending to as increases. On the other hand, if we prove that there is a time such that local uniform mixing occurs, i.e., all vertices are equally likely. We investigate when a quantum walk on strongly regular graph has a high probability of "staying at home", producing large families of examples with the stay-at-home property where the valency is small compared to the number of vertices.
Recommendations
Cites work
- Average mixing of continuous quantum walks
- Discrete-time quantum walks and graph structures
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- Problems in algebraic combinatorics
- Spectra of graphs
- Universal mixing of quantum walk on graphs
- When can perfect state transfer occur?
Cited in
(9)- Pretty good state transfer on 1-sum of star graphs
- Quantum walks on embeddings
- Swift chiral quantum walks
- Sedentariness in quantum walks
- One-dimensional continuous-time quantum Markov chains: qubit probabilities and measures
- Unexpected averages of mixing matrices
- New results in vertex sedentariness
- Quantum state transfer in graphs with tails
- Quantum pair state transfer on isomorphic branches
This page was built for publication: Sedentary quantum walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229498)