Graphs of unitary matrices

Abstract

The support of a matrix M is the (0,1)-matrix with ij-th entry equal to 1 if the ij-th entry of M is non-zero, and equal to 0, otherwise. The digraph whose adjacency matrix is the support of M is said to be the digraph of M. This paper observes some structural properties of digraphs of unitary matrices.

19 pages. Accepted for publication in Ars Combinatoria

References in corpus (3)

• A Quantum Random Walk Search Algorithm
• Exponential algorithmic speedup by quantum walk
• Regular quantum graphs

Cited by in corpus (1)

• Quantum walks on directed graphs