arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2001.00251math.COquant-ph
收藏

复Hadamard可对角化图

Complex Hadamard Diagonalisable Graphs

Ada Chan, Shaun Fallat, Steve Kirkland, Jephian C. -H. Lin, Shahla Nasserasr, Sarah Plosker

摘要:

鉴于最近的兴趣在阿达玛diagonalisable图(图的拉普拉斯矩阵是diagonalisable的阿达玛矩阵),我们概括了这一概念,从真正的复阿达玛矩阵。给出了这类图的一些基本性质和构造方法。我们证明了一大类复杂的Hadamard可对角化图的顶点集形成一个公平的分区,拉普拉斯特征值必须是偶数。我们提供了一些复杂的Hadamard可对角化图的例子和结构,包括两类特殊的图:$\mathbb{Z}_r^d$上的Cayley图和非完全扩展的$p$ -和(NEPS)。讨论了由复Hadamard对角化图描述的连续时间量子游走中$(α, β)$ -Laplacian分数回复和完全态转移的充要条件,并给出了这种量子态转移的例子.

英文摘要:

In light of recent interest in Hadamard diagonalisable graphs (graphs whose Laplacian matrix is diagonalisable by a Hadamard matrix), we generalise this notion from real to complex Hadamard matrices. We give some basic properties and methods of constructing such graphs. We show that a large class of complex Hadamard diagonalisable graphs have vertex sets forming an equitable partition, and that the Laplacian eigenvalues must be even integers. We provide a number of examples and constructions of complex Hadamard diagonalisable graphs, including two special classes of graphs: the Cayley graphs over $\mathbb{Z}_r^d$, and the non--complete extended $p$--sum (NEPS). We discuss necessary and sufficient conditions for $(α, β)$--Laplacian fractional revival and perfect state transfer on continuous--time quantum walks described by complex Hadamard diagonalisable graphs and provide examples of such quantum state transfer.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑