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

结合概型图的量子同构

Quantum isomorphism of graphs from association schemes

Ada Chan, William J. Martin

摘要:

我们证明了任意两个顶点数相同的Hadamard图是量子同构的。这是从一个更一般的配方显示量子同构的图形所产生的某些协会计划。主要结果是由三个工具构建的。Mančinska和Roberson最近的一个显著结果表明,图$G$和$H$是量子同构的当且仅当对任何可平面图$F$,从$F$到$G$的图同态的个数等于从$F$到$H$的图同态的个数.一种被称为“支架”的分拆函数的推广提供了一些基本的归约规则,如串并行归约,并可应用于计算同态。最后的工具是经典的Epifanov定理,表明任何平面图可以减少到一个单一的顶点,没有边的扩展系列平行减少和Delta-Wye变换。最后一种变换在恰好三重正则结合概型的情况下是可用的。本文包括开放的问题和未来的研究方向。

英文摘要:

We show that any two Hadamard graphs on the same number of vertices are quantum isomorphic. This follows from a more general recipe for showing quantum isomorphism of graphs arising from certain association schemes. The main result is built from three tools. A remarkable recent result of Mančinska and Roberson shows that graphs $G$ and $H$ are quantum isomorphic if and only if, for any planar graph $F$, the number of graph homomorphisms from $F$ to $G$ is equal to the number of graph homomorphisms from $F$ to $H$. A generalization of partition functions called "scaffolds" affords some basic reduction rules such as series-parallel reduction and can be applied to counting homomorphisms. The final tool is the classical theorem of Epifanov showing that any plane graph can be reduced to a single vertex and no edges by extended series-parallel reductions and Delta-Wye transformations. This last sort of transformation is available to us in the case of exactly triply regular association schemes. The paper includes open problems and directions for future research.

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

↑