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

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 supersymmetric 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.

Authors

Institutions

Publication Details

Journal
Physical review. A/Physical review, A
Published
2025-05-02
DOI
https://doi.org/10.1103/physreva.111.052204
Citations
1
Primary Topic
Quantum chaos and dynamical systems
Type
article
Field-Weighted Citation Impact
1.32

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Adán Cabello, Stefan Trandafir
1 citations
Physical review. A/Physical review, A
Quantum chaos and dynamical systems
1.32
article

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

Adán Cabello, Stefan Trandafir
article en
1 citations

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 supersymmetric 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.

Physical review. A/Physical review, AVol. 111(5)
Universidad de Sevilla (ES)
Ministerio de Ciencia e Innovación, Agencia Estatal de Investigación, Wallenberg Center for Quantum Technology, Chalmers University of Technology
Openalex Percentile: Top 20%
Quantum chaos and dynamical systems
1.32
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.