Weakly Hadamard diagonalizable graphs and Quantum State Transfer

2023/07/04 by Darian McLaren, McLaren, Darian, Hermie Monterde +3 · 1 citation
Computer Science · Engineering · #05C50 #15A18 #81P45 #Combinatorics (math.CO) #FOS: Mathematics #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2307.01859

openalex publication_date 2023/07/04 · openalex created_date 2023/07/07 · openalex updated_date 2026/08/01

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\-matrix P such that PP^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.

Cited by

• Enumeration of Laplacian integral and -1,0,1-diagonalizable graphs

Related

• Complex Hadamard Diagonalisable Graphs
• Hadamard diagonalizable graphs of order at most 36
• Quantum state representation based on combinatorial Laplacian matrix of star-relevant graph
• Pretty Good State Transfer and Minimal Polynomials
• Complex Hadamard Matrices, Instantaneous Uniform Mixing and Cubes