Complex Hadamard diagonalisable graphs

DOI10.1016/J.LAA.2020.07.018zbMATH Open1446.05055arXiv2001.00251OpenAlexW3042833497MaRDI QIDQ2197273FDOQ2197273

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)

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.

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

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

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)

Cites Work

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

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)