论文信息 - The underlying digraph of a coined quantum random walk

The underlying digraph of a coined quantum random walk

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.

Simone Severini

[1] Miquel Àngel Fiol Mora,et al. When the arc-colored line digraph of a cayley colored digraph is again a cayley colored digraph , 1992 .

[2] R. Z. Norman,et al. Some properties of line digraphs , 1960 .

[3] Andris Ambainis,et al. One-dimensional quantum walks , 2001, STOC '01.

[4] Sheldon B. Akers,et al. A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

[5] Maciej M. Syslo. A Graph-Theoretic Approach to the Jump-Number Problem , 1985 .

[6] Simone Severini. On the Digraph of a Unitary Matrix , 2003, SIAM J. Matrix Anal. Appl..

[7] D. Cvetkovic,et al. Spectra of Graphs: Theory and Applications , 1997 .

[8] Douglas Lind,et al. An Introduction to Symbolic Dynamics and Coding , 1995 .

[9] Erich Prisner. Eulerian iterated line graphs and digraphs , 2001, Discret. Math..

[10] Vasek Chvátal,et al. A note on line digraphs and the directed max-cut problem , 1990, Discret. Appl. Math..

[11] Gregor Tanner,et al. Families of Line-Graphs and Their Quantization , 2001, nlin/0110043.

[12] Line digraphs and the Moore-Penrose inverse , 1981 .

[13] Andris Ambainis,et al. Quantum walks on graphs , 2000, STOC '01.

[14] Julia Kempe,et al. Quantum random walks: An introductory overview , 2003, quant-ph/0303081.