On the Digraph of a Unitary Matrix

DOI10.1137/S0895479802410293zbMath1055.05073arXivmath/0205187MaRDI QIDQ4443827

Simone Severini

Publication date: 19 January 2004

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0205187

zbMATH Keywords

digraphsunitary matricesquantum random walks

Mathematics Subject Classification ID

Quantum computation (81P68) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Related Items

Quantum Walks, Hamilton cycles in digraphs of unitary matrices, On the zero entries in a unitary matrix, Orthogonal symmetric matrices and joins of graphs, On the relationship between continuous- and discrete-time quantum walk, Quantum encoding of dynamic directed graphs, Quantum walks defined by digraphs and generalized Hermitian adjacency matrices, The minimum semidefinite rank of a triangle-free graph, Quantum walks induced by Dirichlet random walks on infinite trees, Unnamed Item, Graphs of unitary matrices and positive semidefinite zero forcing, Zero forcing in iterated line digraphs, Computation in finitary stochastic and quantum processes, Periodicity of the Discrete-time Quantum Walk on a Finite Graph, On the minimum semidefinite rank of a simple graph, Unnamed Item, Unitary matrix digraphs and minimum semidefinite rank, Connection between continuous and discrete time quantum walks. From \(D\)-dimensional lattices to general graphs, Decoherence in quantum walks – a review, QUANTUM WALKS ON GENERAL GRAPHS, Directed graph encoding in quantum computing supporting edge-failures