Noncontextual coloring of orthogonality hypergraphs

• URL: http://arxiv.org/abs/2105.08520v2
• Date: Wed, 30 Mar 2022 16:26:36 GMT
• Title: Noncontextual coloring of orthogonality hypergraphs
• Authors: Mohammad H. Shekarriz and Karl Svozil
• Abstract summary: We discuss representations and colorings of hypergraphs in terms of their two-valued states interpretable as classical truth assignments. Reconstruction is possible for the class of perfectly separable hypergraphs.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We discuss representations and colorings of orthogonality hypergraphs in terms of their two-valued states interpretable as classical truth assignments. Such hypergraphs, if they allow for a faithful orthogonal representation, have quantum mechanical realizations in terms of intertwined contexts or maximal observables that are widely discussed as empirically testable criteria for contextuality. Reconstruction is possible for the class of perfectly separable hypergraphs. Colorings can be constructed from a minimal set of two-valued states. Some examples from exempt categories are presented that either cannot be reconstructed by two-valued states or whose two-valued states cannot yield a chromatic number that is equal to the maximal clique number.

Related papers

• Chromatic Quantum Contextuality [0.0]
  We show that the Yu-Oh hypergraph exhibits chromatic contextuality even when separable two-valued states exist. Our findings underscore hypergraph coloring as a powerful framework for identifying quantum signatures.
  arXiv  Detail & Related papers  (2025-01-25T16:10:15Z)
• Compositional Entailment Learning for Hyperbolic Vision-Language Models [54.41927525264365]
  We show how to fully leverage the innate hierarchical nature of hyperbolic embeddings by looking beyond individual image-text pairs. We propose Compositional Entailment Learning for hyperbolic vision-language models. Empirical evaluation on a hyperbolic vision-language model trained with millions of image-text pairs shows that the proposed compositional learning approach outperforms conventional Euclidean CLIP learning.
  arXiv  Detail & Related papers  (2024-10-09T14:12:50Z)
• Closed-Form Expressions for Two- and Three-Colorable States [0.0]
  We present closed-form expressions for all two-colorable graph states. We explore a broad family of three-colorable graph states constructed from two two-colorable graph states. Our findings have broad implications for characterizing the LU/SLOCC equivalence of graph state classes.
  arXiv  Detail & Related papers  (2024-08-18T15:41:37Z)
• Quantum multigraph states and multihypergraph states [1.3124312213244904]
  We propose two classes of multiparticle entangled states, the multigraph states and multihypergraph states. A key discovery is the one-to-one correspondence between the proposed multihypergraph states and the generalized real equally weighted states when d is prime.
  arXiv  Detail & Related papers  (2023-12-22T03:01:34Z)
• Transitivity Recovering Decompositions: Interpretable and Robust Fine-Grained Relationships [69.04014445666142]
  Transitivity Recovering Decompositions (TRD) is a graph-space search algorithm that identifies interpretable equivalents of abstract emergent relationships. We show that TRD is provably robust to noisy views, with empirical evidence also supporting this finding.
  arXiv  Detail & Related papers  (2023-10-24T16:48:56Z)
• Hyperbolic vs Euclidean Embeddings in Few-Shot Learning: Two Sides of the Same Coin [49.12496652756007]
  We show that the best few-shot results are attained for hyperbolic embeddings at a common hyperbolic radius. In contrast to prior benchmark results, we demonstrate that better performance can be achieved by a fixed-radius encoder equipped with the Euclidean metric.
  arXiv  Detail & Related papers  (2023-09-18T14:51:46Z)
• Unextendibility, uncompletability, and many-copy indistinguishable ensembles [77.34726150561087]
  We study unextendibility, uncompletability and analyze their connections to many-copy indistinguishable ensembles. We report a class of multipartite many-copy indistinguishable ensembles for which local indistinguishability property increases with decreasing mixedness.
  arXiv  Detail & Related papers  (2023-03-30T16:16:41Z)
• HyperMiner: Topic Taxonomy Mining with Hyperbolic Embedding [54.52651110749165]
  We present a novel framework that introduces hyperbolic embeddings to represent words and topics. With the tree-likeness property of hyperbolic space, the underlying semantic hierarchy can be better exploited to mine more interpretable topics.
  arXiv  Detail & Related papers  (2022-10-16T02:54:17Z)
• Bosonic fields in states with undefined particle numbers possess detectable non-contextuality features, plus more [0.0]
  Is it possible to formulate a contextuality proof for situation in which the numbers of particles are fundamentally undefined? We introduce a representation of the $mathfraksu(2)$ algebra in terms of boson number states in two modes. We show that the introduced observables are handy and efficient to reveal violation of local realism, and to formulate entanglement indicators.
  arXiv  Detail & Related papers  (2022-05-19T09:56:08Z)
• Quantum indistinguishability through exchangeable desirable gambles [69.62715388742298]
  Two particles are identical if all their intrinsic properties, such as spin and charge, are the same. Quantum mechanics is seen as a normative and algorithmic theory guiding an agent to assess her subjective beliefs represented as (coherent) sets of gambles. We show how sets of exchangeable observables (gambles) may be updated after a measurement and discuss the issue of defining entanglement for indistinguishable particle systems.
  arXiv  Detail & Related papers  (2021-05-10T13:11:59Z)
• Varieties of contextuality based on probability and structural nonembeddability [0.0]
  Kochen and Specker's Theorem0 is a demarcation criterion for differentiating between those groups. Probability contextuality still allows classical models, albeit with nonclassical probabilities. The logico-algebraic "strong" form of contextuality characterizes collections of quantum observables that have no faithfully embedding into (extended) Boolean algebras.
  arXiv  Detail & Related papers  (2021-03-10T15:04:34Z)

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.