Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
121 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Two fundamental solutions to the rigid Kochen-Specker set problem and the solution to the minimal Kochen-Specker set problem under one assumption (2501.11640v2)

Published 20 Jan 2025 in quant-ph

Abstract: Recent results show that Kochen-Specker (KS) sets of observables are fundamental to quantum information, computation, and foundations beyond previous expectations. Among KS sets, those that are unique up to unitary transformations (i.e., "rigid") are especially important. The problem is that we do not know any rigid KS set in $\mathbb{C}3$, the smallest quantum system that allows for KS sets. Moreover, none of the existing methods for constructing KS sets leads to rigid KS sets in $\mathbb{C}3$. Here, we show that two fundamental structures of quantum theory define two rigid KS sets. One of these structures is the super-symmetric informationally complete positive-operator-valued measure. The other is the minimal state-independent contextuality set. The second construction provides a clue to solve the minimal KS problem, the most important open problem in this field. We prove that there is no KS set of 30 elements that can be obtained from the minimal state-independent contextuality set by completing bases and adding elements that are orthogonal to two previous elements. We conjecture that 31 is the solution to the minimal KS set problem.

Summary

We haven't generated a summary for this paper yet.