论文标题
上下文应用的最佳测量结构
Optimal Measurement Structures for Contextuality Applications
论文作者
论文摘要
Kochen-Specker(KS)定理是描述量子理论与经典非上下文理论之间基本差异的量子力学基础的拐角结。最近,被称为$ 01 $ - 件的特定子结构显示在KS证明中存在,以捕获定理的基本矛盾。 Here, we show these gadgets and their generalizations provide an optimal toolbox for contextuality applications including (i) constructing classical channels exhibiting entanglement-assisted advantage in zero-error communication, (ii) identifying large separations between quantum theory and binary generalised probabilistic theories, and (iii) finding optimal tests for contextuality-based semi-device-independent randomness generation.此外,我们介绍并研究了对更一般逻辑命题的确定预测集的概括,我们将其称为高阶小工具。我们通过将这些高级小工具在KS图中识别为诱发的子图,并显示如何使用高阶小工具作为构建块来构建如何构建与状态无关的上下文性证明,以确定这些高阶小工具在KS证明中的作用。这里开发的结构可能有助于解决有关Kochen-Specker定理最小证明的剩余一些开放问题。
The Kochen-Specker (KS) theorem is a corner-stone result in the foundations of quantum mechanics describing the fundamental difference between quantum theory and classical non-contextual theories. Recently specific substructures termed $01$-gadgets were shown to exist within KS proofs that capture the essential contradiction of the theorem. Here, we show these gadgets and their generalizations provide an optimal toolbox for contextuality applications including (i) constructing classical channels exhibiting entanglement-assisted advantage in zero-error communication, (ii) identifying large separations between quantum theory and binary generalised probabilistic theories, and (iii) finding optimal tests for contextuality-based semi-device-independent randomness generation. Furthermore, we introduce and study a generalisation to definite prediction sets for more general logical propositions, that we term higher-order gadgets. We pinpoint the role these higher-order gadgets play in KS proofs by identifying these as induced subgraphs within KS graphs and showing how to construct proofs of state-independent contextuality using higher-order gadgets as building blocks. The constructions developed here may help in solving some of the remaining open problems regarding minimal proofs of the Kochen-Specker theorem.