Kochen-Specker定理
集合(抽象数据类型)
背景(考古学)
概念证明
证明复杂性
数学
直接证明
离散数学
量子
计算机科学
数理经济学
物理
数学证明
量子力学
生物
操作系统
古生物学
程序设计语言
几何学
作者
Petr Lisoněk,Piotr Badzia̧g,José R. Portillo,Adán Cabello
摘要
Kochen-Specker (KS) sets are fundamental in physics. Every time nature produces bipartite correlations attaining the nonsignaling limit, or two parties always win a nonlocal game impossible to always win classically, is because the parties are measuring a KS set. The simplest quantum system in which all these phenomena occur is a pair of three-level systems. However, the simplest KS sets in dimension three known are asymmetrical and require a large number of bases (the current minimum is 16, set by Peres and Penrose). Here we present a KS set that is much more symmetrical and easier to prove than any previous example. It sets a new record for minimum number of bases, 14, and enables us to refute Conjecture 2 in Phys. Rev. Lett. 134, 010201 (2025), setting a new record for qutrit-qutrit perfect strategies with a minimum number of inputs: 5-9. We establish the fundamental nature of this set in quantum theory.
科研通智能强力驱动
Strongly Powered by AbleSci AI