Complex Hadamard diagonalisable graphs
DOI10.1016/j.laa.2020.07.018zbMath1446.05055arXiv2001.00251OpenAlexW3042833497MaRDI QIDQ2197273
Shahla Nasserasr, Ada Chan, Sarah Plosker, Jephian C.-H. Lin, Stephen J. Kirkland, Shaun M. Fallat
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
graph productsequitable partitionquantum state transferCheeger inequalitycomplex Hadamard matrixtype II matrix
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Graph operations (line graphs, products, etc.) (05C76) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Pretty good state transfer on some NEPS
- Type-II matrices and combinatorial structures
- Perfect state transfer in cubelike graphs
- On Hadamard diagonalizable graphs
- Perfect state transfer on NEPS of the path on three vertices
- Parametrizing complex Hadamard matrices
- Non-negative matrices and Markov chains. 2nd ed
- On graphs with algebraic connectivity equal to minimum edge density
- Balancedly splittable Hadamard matrices
- Perfect state transfer on abelian Cayley graphs
- Fractional revival and association schemes
- Quantum fractional revival on graphs
- Perfect quantum state transfer using Hadamard diagonalizable graphs
- Perfect state transfer in products and covers of graphs
- Generalized Hadamard Matrices
- Complex Hadamard matrices
- Lower Bounds for the Partitioning of Graphs
- Equivalence classes of inverse orthogonal and unit Hadamard matrices
This page was built for publication: Complex Hadamard diagonalisable graphs