三维立方体是唯一具有完美状态转移的周期连通立方体图
The 3-dimensional cube is the only periodic, connected cubic graph with perfect state transfer
摘要:
如果一个单激发能在图的两个顶点之间保真度地传播,那么在图的两个顶点之间就存在完美的态转移。当激励回到初始位置时,对于所有位置同时,该图被称为周期性的。一个图是立方的,如果它的每个顶点都有一个大小正好为3的邻域。我们证明了三维立方体是唯一具有完美状态转移的周期连通立方体图。我们猜想这也是唯一一个具有完美状态转移的连通三次图。
英文摘要:
There is perfect state transfer between two vertices of a graph, if a single excitation can travel with fidelity one between the corresponding sites of a spin system modeled by the graph. When the excitation is back at the initial site, for all sites at the same time, the graph is said to be periodic. A graph is cubic if each of its vertices has a neighbourhood of size exactly three. We prove that the 3-dimensional cube is the only periodic, connected cubic graph with perfect state transfer. We conjecture that this is also the only connected cubic graph with perfect state transfer.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。