Title	Hadamard Diagonalizability and Cubelike Graphs
Creator	Plosker, Sarah
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2017-07-09T09:02
Description	Quantum state transfer within a quantum computer can be achieved by using a network of qubits, and such a network can be modelled mathematically by a graph. Here, we focus on the corresponding Laplacian matrix, and those graphs for which the Laplacian can be diagonalized by a Hadamard matrix. We characterize the graphs that are diagonalizable by the standard Hadamard matrix, showing a direct relationship to cubelike graphs. We give some example constructions illustrating our results. ${\bf Co-author(s):}$ N. Johnston (Mount Allison University), S. Kirkland (University of Manitoba), R. Storey (Brandon University), and X. Zhang (University of Manitoba)
Extent	28 minutes
Subject	Mathematics; Linear and multilinear algebra; matrix theory; Combinatorics
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: Brandon University
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2018-01-06
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0362884
URI	http://hdl.handle.net/2429/64298
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Faculty
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos