English

Weakly Hadamard diagonalizable graphs and Quantum State Transfer

Combinatorics 2024-07-11 v2 Quantum Physics

Abstract

Hadamard diagonalizable graphs are undirected graphs for which the corresponding Laplacian is diagonalizable by a Hadamard matrix. Such graphs have been studied in the context of quantum state transfer. Recently, the concept of a weak Hadamard matrix was introduced: a {1,0,1}\{-1,0, 1\}-matrix PP such that PPTPP^T is tridiagonal, as well as the concept of weakly Hadamard diagonalizable graphs. We therefore naturally explore quantum state transfer in these generalized Hadamards. Given the infancy of the topic, we provide numerous properties and constructions of weak Hadamard matrices and weakly Hadamard diagonalizable graphs in order to better understand them.

Cite

@article{arxiv.2307.01859,
  title  = {Weakly Hadamard diagonalizable graphs and Quantum State Transfer},
  author = {Darian McLaren and Hermie Monterde and Sarah Plosker},
  journal= {arXiv preprint arXiv:2307.01859},
  year   = {2024}
}

Comments

23 pages, 1 figure, 1 table

R2 v1 2026-06-28T11:22:07.160Z