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

• URL: http://arxiv.org/abs/2501.11640v2
• Date: Fri, 28 Mar 2025 18:41:15 GMT
• Title: Two fundamental solutions to the rigid Kochen-Specker set problem and the solution to the minimal Kochen-Specker set problem under one assumption
• Authors: Stefan Trandafir, Adán Cabello,
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• QuCOOP: A Versatile Framework for Solving Composite and Binary-Parametrised Problems on Quantum Annealers [25.711225064444296]
  QuCOOP is an optimisation framework extending the scope of AQC to composite and binary-parametrised, possibly non-quadratic problems. We experiment with quadratic assignment problems, shape matching and point set registration without knowing the correspondences in advance.
  arXiv  Detail & Related papers  (2025-03-25T14:45:19Z)
• Reply to Pavičić's 'Comment on "Optimal conversion of Kochen-Specker sets into bipartite perfect quantum strategies"' (arXiv:2502.13787) [0.0]
  Pavivci'c claims that 10 statements in our paper are wrong. We respond to other claims made by Pavivci'c about our work.
  arXiv  Detail & Related papers  (2025-03-04T20:00:06Z)
• On lower bounds of the density of planar periodic sets without unit distances [55.2480439325792]
  We introduce a novel approach to estimating $m_1(mathbbR2)$ by reformulating the problem as a Maximal Independent Set (MIS) problem on graphs constructed from flat torus. Our experimental results supported by theoretical justifications of proposed method demonstrate that for a sufficiently wide range of parameters this approach does not improve the known lower bound.
  arXiv  Detail & Related papers  (2024-11-20T12:07:19Z)
• Maximal Non-Kochen-Specker Sets and a Lower Bound on the Size of Kochen-Specker Sets [1.5163329671980246]
  A Kochen-Specker (KS) set is a finite collection of vectors on the two-sphere containing no antipodal pairs. The existence of KS sets lies at the heart of Kochen and Specker's argument against non-contextual hidden variable theories.
  arXiv  Detail & Related papers  (2024-03-08T11:38:16Z)
• The Power of Unentangled Quantum Proofs with Non-negative Amplitudes [55.90795112399611]
  We study the power of unentangled quantum proofs with non-negative amplitudes, a class which we denote $textQMA+(2)$. In particular, we design global protocols for small set expansion, unique games, and PCP verification. We show that QMA(2) is equal to $textQMA+(2)$ provided the gap of the latter is a sufficiently large constant.
  arXiv  Detail & Related papers  (2024-02-29T01:35:46Z)
• 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)
• Escaping limit cycles: Global convergence for constrained nonconvex-nonconcave minimax problems [46.71914490521821]
  This paper introduces a new extragradient-type algorithm for a class of non-nonconcave minimax problems. The proposed algorithm is applicable to constrained and regularized problems.
  arXiv  Detail & Related papers  (2023-02-20T08:37:08Z)
• Constrained mixers for the quantum approximate optimization algorithm [55.41644538483948]
  We present a framework for constructing mixing operators that restrict the evolution to a subspace of the full Hilbert space. We generalize the "XY"-mixer designed to preserve the subspace of "one-hot" states to the general case of subspaces given by a number of computational basis states. Our analysis also leads to valid Trotterizations for "XY"-mixer with fewer CX gates than is known to date.
  arXiv  Detail & Related papers  (2022-03-11T17:19:26Z)
• Annihilating Entanglement Between Cones [77.34726150561087]
  We show that Lorentz cones are the only cones with a symmetric base for which a certain stronger version of the resilience property is satisfied. Our proof exploits the symmetries of the Lorentz cones and applies two constructions resembling protocols for entanglement distillation.
  arXiv  Detail & Related papers  (2021-10-22T15:02:39Z)
• Straddling-gates problem in multipartite quantum systems [20.428960719376164]
  We study a variant of quantum circuit complexity, the binding complexity. We show that any $m$partite Schmidt decomposable state has binding complexity linear in $m$, which hints its multi-separable property.
  arXiv  Detail & Related papers  (2021-10-13T16:28:12Z)
• 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)
• Exposing minimal composition of Kohn-Sham theory and its extendability [0.0]
  The Kohn-Sham (KS) theory has provided a practical tool to implement calculations of ground-state energies and densities in many-electron systems. There have been attempts to extend the KS theory so that it could describe other physical quantities, or it could be applied to other many-fermion systems. By generalizing and reformulating the KS theory in terms of the 1-body density matrix, we expose the minimal composition of the theory that enables the reduction of the many-fermion problem to the s.p. equations.
  arXiv  Detail & Related papers  (2021-08-03T01:20:45Z)
• Large violations in Kochen Specker contextuality and their applications [4.398712854913047]
  We show Kochen-Specker proofs in Hilbert spaces of dimension $d geq 217$ with the ratio of quantum value to classical bias being $O(sqrtd/log d)$. We show a one-to-one connection between $01$-gadgets in $mathbbCd$ and Hardy paradoxes for the maximally entangled state in $mathbbCd otimes mathbbCd$.
  arXiv  Detail & Related papers  (2021-06-30T10:07:29Z)

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.