Laplacian state transfer on graphs with an edge perturbation between twin vertices

DOI10.1016/J.DISC.2022.112872MaRDI QIDQ2138964zbMATH OpenOpenAlexFDO

Authors Hiranmoy Pal

Publication date 17 May 2022

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

circulant graphperfect state transferpretty good state transferspectra of graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random walks on graphs (05C81) Eigenvalues, singular values, and eigenvectors (15A18) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum computation (81P68)

Abstract: We consider quantum state transfer relative to the Laplacian matrix of a graph. Let $N(u)$ denote the set of all neighbors of a vertex $u$ in a graph $G$. A pair of vertices $u$ and $v$ are called twin vertices of $G$ provided $N(u)setminusv=N(v)setminusu$. We investigate the existence of quantum state transfer between a pair of twin vertices in a graph when the edge between the vertices is perturbed. We find that removal of any set of pairwise non-adjacent edges from a complete graph with a number of vertices divisible by $4$ results Laplacian perfect state transfer (or LPST) at $fracpi2$ between the end vertices of every edge removed. Further, we show that all Laplacian integral graphs with a pair of twin vertices exhibit LPST when the edge between the vertices is perturbed. In contrast, we conclude that LPST can be achieved in every complete graph between the end vertices of any number of suitably perturbed non-adjacent edges. The results are further generalized to obtain a family of edge perturbed circulant graphs exhibiting Laplacian pretty good state transfer (or LPGST) between twin vertices. A subfamily of which is also identified to admit LPST at $fracpi2$.

Recommendations

• Pair state transfer
• Laplacian state transfer in Q-graph
• Perfect state transfer in Laplacian quantum walk
• No Laplacian perfect state transfer in trees
• State transfer in strongly regular graphs with an edge perturbation

Cites work

• Characterization of quantum circulant networks having perfect state transfer
• COMMUNICATION IN XYZ ALL-TO-ALL QUANTUM NETWORKS WITH A MISSING LINK
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 45380 (Why is no real title available?)
• scientific article; zbMATH DE number 6125590 (Why is no real title available?)
• Integral circulant graphs
• Laplacian state transfer in Q-graph
• Laplacian state transfer in coronas
• Laplacian state transfer in edge complemented coronas
• Laplacian state transfer in total graphs
• More circulant graphs exhibiting pretty good state transfer
• No Laplacian perfect state transfer in trees
• Perfect state transfer in cubelike graphs
• Perfect state transfer in Laplacian quantum walk
• Perfect state transfer on distance-regular graphs and association schemes
• Periodic graphs
• Pretty good state transfer on circulant graphs
• Quantum state transfer and network engineering
• Quantum state transfer on a class of circulant graphs
• Rank one perturbation and its application to the laplacian spectrum of a graph^∗
• State transfer on graphs

Cited in

(7)

• Laplacian state transfer in total graphs
• State transfer in strongly regular graphs with an edge perturbation
• Pair state transfer
• Quantum state transfer between twins in weighted graphs
• Laplacian pair state transfer in vertex coronas
• Quantum walks on blow-up graphs
• Quantum state transfer on \(\mathcal{Q}\)-graphs

This page was built for publication: Laplacian state transfer on graphs with an edge perturbation between twin vertices

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