The simplest Kochen-Specker set

• URL: http://arxiv.org/abs/2508.07335v3
• Date: Fri, 07 Nov 2025 10:54:21 GMT
• Title: The simplest Kochen-Specker set
• Abstract summary: We present a new KS set that is much more symmetrical and easier to prove than any previous example.<n>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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Three-qubit nonlocality paradoxes: beyond GHZ [6.416017764863369]
  We completely classify all three-qubit nonlocality paradoxes established via a biconditional parity proof.<n>We find that the landscape of nonlocality paradoxes is far richer than previously understood conditions underlying all prior constructions.
  arXiv  Detail & Related papers  (2026-07-01T11:24:56Z)
• Average-case quantum complexity from glassiness [45.57609001239456]
  Glassiness -- a phenomenon in physics characterized by a rough free-energy landscape -- implies hardness for stable classical algorithms.<n>We prove that the standard notion of quantum glassiness based on replica symmetry breaking obstructs stable quantum algorithms for Gibbs sampling.
  arXiv  Detail & Related papers  (2025-10-09T17:37:33Z)
• Quantum Advantage in Identifying the Parity of Permutations with Certainty [0.0]
  We establish a sharp quantum advantage in determining parity of an unknown permutation applied to any number $n ge 3$ of particles.<n>We also assess the minimum entanglement these states need to carry, finding it to be close to maximal, and even maximal in some cases.
  arXiv  Detail & Related papers  (2025-08-06T10:55:32Z)
• Two fundamental solutions to the rigid Kochen-Specker set problem and the solution to the minimal Kochen-Specker set problem under one assumption [0.0]
  We show that two fundamental structures of quantum theory define two rigid KS sets.<n>The second construction provides a clue to solve the minimal KS problem.<n>We conjecture that 31 is the solution to the minimal KS set problem.
  arXiv  Detail & Related papers  (2025-01-20T18:13:28Z)
• Kochen-Specker for many qubits and the classical limit [55.2480439325792]
  It is shown that quantum and classical predictions converge as the number of qubits is increases to the macroscopic scale.<n>This way to explain the classical limit concurs with, and improves, a result previously reported for GHZ states.
  arXiv  Detail & Related papers  (2024-11-26T22:30:58Z)
• Unitary-invariant witnesses of quantum imaginarity [8.700842317740943]
  We show that simple pairwise overlap measurements suffice to witness imaginarity of sets of 4 states, but not for sets of 3. Our witnesses are experimentally friendly, opening up a new path for measuring and using imaginarity as a resource.
  arXiv  Detail & Related papers  (2024-03-22T09:46:58Z)
• Taming Quantum Time Complexity [45.867051459785976]
  We show how to achieve both exactness and thriftiness in the setting of time complexity. We employ a novel approach to the design of quantum algorithms based on what we call transducers.
  arXiv  Detail & Related papers  (2023-11-27T14:45:19Z)
• Minimal Equational Theories for Quantum Circuits [44.99833362998488]
  We show that any true equation on quantum circuits can be derived from simple rules. One of our main contributions is to prove the minimality of the equational theory.
  arXiv  Detail & Related papers  (2023-11-13T17:11:25Z)
• A SAT Solver and Computer Algebra Attack on the Minimum Kochen-Specker Problem [14.693394941317843]
  We present a new verifiable proof-producing method based on a combination of a Boolean satisfiability solver and a computer algebra system. Our method shows that a KS system in 3D must contain at least 24 vectors. We also provide the first computer-verifiable proof certificate of a lower bound to the KS problem with a size of 40.3 TiB in order 23.
  arXiv  Detail & Related papers  (2023-06-23T06:42:59Z)
• Quantum Circuit Completeness: Extensions and Simplifications [44.99833362998488]
  The first complete equational theory for quantum circuits has only recently been introduced. We simplify the equational theory by proving that several rules can be derived from the remaining ones. The complete equational theory can be extended to quantum circuits with ancillae or qubit discarding.
  arXiv  Detail & Related papers  (2023-03-06T13:31:27Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Contextuality in composite systems: the role of entanglement in the Kochen-Specker theorem [0.0]
  The Kochen--Specker (KS) theorem reveals the nonclassicality of single quantum systems. Bell's theorem and entanglement concern the nonclassicality of composite quantum systems.
  arXiv  Detail & Related papers  (2021-09-28T10:10:53Z)
• The principle of majorization: application to random quantum circuits [68.8204255655161]
  Three classes of circuits were considered: (i) universal, (ii) classically simulatable, and (iii) neither universal nor classically simulatable. We verified that all the families of circuits satisfy on average the principle of majorization. Clear differences appear in the fluctuations of the Lorenz curves associated to states.
  arXiv  Detail & Related papers  (2021-02-19T16:07:09Z)
• Operational Resource Theory of Imaginarity [48.7576911714538]
  We show that quantum states are easier to create and manipulate if they only have real elements. As an application, we show that imaginarity plays a crucial role for state discrimination.
  arXiv  Detail & Related papers  (2020-07-29T14:03:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.