On the digraph of a unitary matrix

dc.creatorSeverini, Simone
dc.date2002-05-16
dc.date2003-07-17
dc.date.accessioned2026-07-07T07:53:38Z
dc.date.available2026-07-07T07:53:38Z
dc.descriptionGiven a matrix M of size n, a digraph D on n vertices is said to be the digraph of M, when M_{ij} is different from 0 if and only if (v_{i},v_{j}) is an arc of D. We give a necessary condition, called strong quadrangularity, for a digraph to be the digraph of a unitary matrix. With the use of such a condition, we show that a line digraph, LD, is the digraph of a unitary matrix if and only if D is Eulerian. It follows that, if D is strongly connected and LD is the digraph of a unitary matrix then LD is Hamiltonian. We conclude with some elementary observations. Among the motivations of this paper are coined quantum random walks, and, more generally, discrete quantum evolution on digraphs.
dc.description6 pages
dc.identifierhttps://arxiv.org/abs/math/0205187
dc.identifierhttp://arxiv.org/abs/math/0205187
dc.identifierSIAM Journal on Matrix Analysis and Applications, Volume 25, Number 1, pp. 295-300, July 2003
dc.identifierdoi:10.1137/S0895479802410293
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/126293
dc.subjectCombinatorics
dc.subjectQuantum Physics
dc.subject05C20; 51F25; 81P68
dc.titleOn the digraph of a unitary matrix
dc.typetext

Files

Collections