Weakly Hadamard diagonalizable graphs and quantum state transfer

DOI10.1080/03081087.2025.2562064MaRDI QIDQ6898830zbMATH OpenFDO

Authors Darian McLaren, Hermie Monterde, Sarah Plosker

Publication date 17 November 2025

Published in Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03081087.2025.2562064

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Boolean and Hadamard matrices (15B34) Quantum state spaces, operational and probabilistic concepts (81P16) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Cites work

• Complex Hadamard diagonalisable graphs
• Construction of Williamson type matrices
• Hadamard diagonalizable graphs of order at most 36
• Laplacian \(\{-1,0,1\}\)- and \(\{-1,1\}\)-diagonalizable graphs
• On graph Laplacian eigenvectors with components in \(\{- 1, 0, 1 \}\)
• On Hadamard diagonalizable graphs
• Perfect quantum state transfer using Hadamard diagonalizable graphs
• Quantum state transfer between twins in weighted graphs
• State transfer on graphs
• Strong Cospectrality and Twin Vertices in Weighted Graphs
• Strongly cospectral vertices
• Weakly Hadamard diagonalizable graphs

This page was built for publication: Weakly Hadamard diagonalizable graphs and quantum state transfer

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