Complex Hadamard diagonalisable graphs

DOI10.1016/J.LAA.2020.07.018MaRDI QIDQ2197273zbMATH OpenOpenAlexFDO

Authors Ada Chan, Jephian Chin-Hung Lin, S. Nasserasr, Sarah Plosker, Shaun M. Fallat, S. J. Kirkland

Publication date 31 August 2020

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

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

zbMATH Keywords

graph productsequitable partitionquantum state transferCheeger inequalitycomplex Hadamard matrixtype II matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph operations (line graphs, products, etc.) (05C76) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Abstract: In light of recent interest in Hadamard diagonalisable graphs (graphs whose Laplacian matrix is diagonalisable by a Hadamard matrix), we generalise this notion from real to complex Hadamard matrices. We give some basic properties and methods of constructing such graphs. We show that a large class of complex Hadamard diagonalisable graphs have vertex sets forming an equitable partition, and that the Laplacian eigenvalues must be even integers. We provide a number of examples and constructions of complex Hadamard diagonalisable graphs, including two special classes of graphs: the Cayley graphs over $mathbb{Z}_r^d$, and the non--complete extended $p$--sum (NEPS). We discuss necessary and sufficient conditions for $$--Laplacian fractional revival and perfect state transfer on continuous--time quantum walks described by complex Hadamard diagonalisable graphs and provide examples of such quantum state transfer.

Recommendations

• On Hadamard diagonalizable graphs
• Hadamard diagonalizable graphs of order at most 36
• Perfect quantum state transfer using Hadamard diagonalizable graphs
• Weakly Hadamard diagonalizable graphs
• Complex Hadamard matrices, instantaneous uniform mixing and cubes

Cites work

• scientific article; zbMATH DE number 3409368 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• Balancedly splittable Hadamard matrices
• Complex Hadamard matrices
• Equivalence classes of inverse orthogonal and unit Hadamard matrices
• Fractional revival and association schemes
• Generalized Hadamard Matrices
• Lower Bounds for the Partitioning of Graphs
• Non-negative matrices and Markov chains. 2nd ed
• On Hadamard diagonalizable graphs
• On graphs with algebraic connectivity equal to minimum edge density
• Parametrizing complex Hadamard matrices
• Perfect quantum state transfer using Hadamard diagonalizable graphs
• Perfect state transfer in cubelike graphs
• Perfect state transfer in products and covers of graphs
• Perfect state transfer on NEPS of the path on three vertices
• Perfect state transfer on abelian Cayley graphs
• Pretty good state transfer on some NEPS
• Quantum fractional revival on graphs
• Type-II matrices and combinatorial structures

Cited in

(5)

• On Hadamard diagonalizable graphs
• Hadamard diagonalizable graphs of order at most 36
• Weakly Hadamard diagonalizable graphs
• Laplacian \(\{-1,0,1\}\)- and \(\{-1,1\}\)-diagonalizable graphs
• Bordered Complex Hadamard Matrices and Strongly Regular Graphs

This page was built for publication: Complex Hadamard diagonalisable graphs

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