Isospectral reductions and quantum walks on graphs

DOI10.5802/alco.333arXiv2212.00172MaRDI QIDQ6122145

Mark Kempton, John Tolbert

Publication date: 28 February 2024

Published in: Algebraic Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

quantum walkequitable partitionperfect state transferisospectral reduction

Mathematics Subject Classification ID

Quantum computation (81P68) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Random walks on graphs (05C81)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• State transfer on graphs
• Cospectrality preserving graph modifications and eigenvector properties via walk equivalence of vertices
• Fundamentals of fractional revival in graphs
• Characterizing cospectral vertices via isospectral reduction
• Quantum fractional revival on graphs
• Eigenvectors of isospectral graph transformations
• Limits for the characteristic roots of a matrix. II
• Pretty good quantum fractional revival in paths and cycles
• Restrictions and stability of time-delayed dynamical networks
• Pseudospectra of isospectrally reduced matrices
• Isospectral graph transformations, spectral equivalence, and global stability of dynamical networks
• PERFECT, EFFICIENT, STATE TRANSFER AND ITS APPLICATION AS A CONSTRUCTIVE TOOL
• Matrices eigenvalues, and directed graphs
• Intrinsic stability: stability of dynamical networks and switched systems with any type of time-delays
• Improved Estimates of Survival Probabilities via Isospectral Transformations
• Isospectral Transformations

This page was built for publication: Isospectral reductions and quantum walks on graphs