首页> 外文期刊>Journal of Combinatorial Theory, Series B >Quantum and non-signalling graph isomorphisms
【24h】

Quantum and non-signalling graph isomorphisms

机译:量子和非信号图同构

获取原文
获取原文并翻译 | 示例
           

摘要

We introduce the (G, H) isomorphism game, a new two-player non-local game that classical players can win with certainty iff the graphs G and H are isomorphic. We then define quantum and non-signalling isomorphisms by considering perfect quantum and non-signalling strategies for this game. We prove that non-signalling isomorphism coincides with fractional isomorphism, giving the latter an operational interpretation. We show that quantum isomorphism is equivalent to the feasibility of two polynomial systems obtained by relaxing standard integer programs for graph isomorphism to Hermitian variables. Finally, we provide a reduction from linear binary constraint system games to isomorphism games. This reduction provides examples of quantum isomorphic graphs that are not isomorphic, implies that the tensor product and commuting operator frameworks result in different notions of quantum isomorphism, and proves that both relations are undecidable. (C) 2018 Elsevier Inc. All rights reserved.
机译:我们介绍了(G,H)同构游戏,一个新的双球员非本地游戏,古典球员可以用Cerlainty IFF赢得图表G和H是同义的。 然后,我们通过考虑本游戏的完美量子和非信令策略来定义量子和非信令同构。 我们证明了非信令同构与分数同构吻合,给出后者的操作解释。 我们表明量子同构相当于通过对隐藏群岛变量的图形同构释放标准整数程序而获得的两个多项式系统的可行性。 最后,我们提供从线性二元约束系统游戏减少到同构游戏。 这种减少提供了不同态的量子正像图的实例,意味着张量产品和通勤操作员框架导致量子同构的不同概念,并证明这两个关系都是不可判定的。 (c)2018年Elsevier Inc.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号