arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1207.1111quant-phmath.CO
收藏

量子着色与纠缠辅助信道容量的Kochen-Specker集的推广

A Generalization of Kochen-Specker Sets Relates Quantum Coloring to Entanglement-Assisted Channel Capacity

Laura Mancinska, Giannicola Scarpa, Simone Severini

摘要:

本文介绍了Kochen-Specker(KS)集的两种推广:投影KS集和广义KS集。然后,我们使用投影KS集的特征色数严格大于量子色数的所有图。在这里,量子色数是通过基于图着色的非局部博弈定义的。我们进一步表明,从这两个量之间的分离的任何图,可以构建一个经典的通道,其中纠缠援助增加了一次性零错误容量。作为一个例子,我们展示了一个新的家庭的经典信道的指数增长。

英文摘要:

We introduce two generalizations of Kochen-Specker (KS) sets: projective KS sets and generalized KS sets. We then use projective KS sets to characterize all graphs for which the chromatic number is strictly larger than the quantum chromatic number. Here, the quantum chromatic number is defined via a nonlocal game based on graph coloring. We further show that from any graph with separation between these two quantities, one can construct a classical channel for which entanglement assistance increases the one-shot zero-error capacity. As an example, we exhibit a new family of classical channels with an exponential increase.

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

↑