The underlying digraph of a coined quantum random walk
classification
🪐 quant-ph
keywords
digraphlinecharacterizationcoinedquantumrandomunderlyingwalk
read the original abstract
We give a characterization of the line digraph of a regular digraph. We make use of the characterization, to show that the underlying digraph of a coined quantum random walk is a line digraph. We remark the connection between line digraphs and in-split graphs in symbolic dynamics.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.