Publication:2015084

DOI10.1016/J.LAA.2014.05.004zbMATH Open1291.05118arXiv1310.3885OpenAlexW2962823796MaRDI QIDQ2015084FDOQ2015084

Stephen P. Cameron, C. Tamon, Leah Granger, Sunrose Shrestha, Oliver Hennigh, Shannon Fehrenbach

Publication date: 18 June 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: A continuous-time quantum walk on a graph $G$ is given by the unitary matrix $U(t)=exp(-itA)$, where $A$ is the Hermitian adjacency matrix of $G$. We say $G$ has pretty good state transfer between vertices $a$ and $b$ if for any $epsilon>0$, there is a time $t$, where the $(a,b)$-entry of $U(t)$ satisfies $|U(t{)}_{a,b}|ge1-epsilon$. This notion was introduced by Godsil (2011). The state transfer is perfect if the above holds for $epsilon=0$. In this work, we study a natural extension of this notion called universal state transfer. Here, state transfer exists between every pair of vertices of the graph. We prove the following results about graphs with this stronger property: (1) Graphs with universal state transfer have distinct eigenvalues and flat eigenbasis (where each eigenvector has entries which are equal in magnitude). (2) The switching automorphism group of a graph with universal state transfer is abelian and its order divides the size of the graph. Moreover, if the state transfer is perfect, then the switching automorphism group is cyclic. (3) There is a family of prime-length cycles with complex weights which has universal pretty good state transfer. This provides a concrete example of an infinite family of graphs with the universal property. (4) There exists a class of graphs with real symmetric adjacency matrices which has universal pretty good state transfer. In contrast, Kay (2011) proved that no graph with real-valued adjacency matrix can have universal perfect state transfer. We also provide a spectral characterization of universal perfect state transfer graphs that are switching equivalent to circulants.

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

zbMATH Keywords

quantum walkcirculantsgain graphsswitching automorphisms

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Matrix exponential and similar functions of matrices (15A16)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Exponential algorithmic speedup by a quantum walk
• State transfer on graphs
• Periodic graphs
• Type-II matrices and combinatorial structures
• Pretty good state transfer on double stars
• The Minimal Polynomials of sin () and cos ()

Cited In (17)

• Controlled transport in chiral quantum walks on graphs
• Pretty good state transfer on Cayley graphs over dihedral groups
• State transfer and star complements in graphs
• Quantum walks on simplexes and multiple perfect state transfer
• Complex quantum networks: a topical review
• Swift chiral quantum walks
• Pretty good state transfer of entangled states through quantum spin chains
• Perfect state transfer on oriented graphs
• Laplacian state transfer in total graphs
• Quantum state transfer on a class of circulant graphs
• Hamiltonians of bipartite walks
• Quantum state transfer on integral oriented circulant graphs
• Topological classification of time-asymmetry in unitary quantum processes
• Entanglement transfer via chiral and continuous-time quantum walks on a triangular chain
• Why and how to add direction to a quantum walk
• Oriented gain graphs, line graphs and eigenvalues
• Universality in perfect state transfer

This page was built for publication: Universal state transfer on graphs

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