Faithful orthogonal representations of graphs from partition logics

DOI10.1007/s00500-019-04425-1zbMath1492.81024arXiv1810.10423OpenAlexW2897063166MaRDI QIDQ2156425

Karl Svozil

Publication date: 18 July 2022

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.10423

zbMATH Keywords

quantum mechanicsGleason theoremBorn ruleKochen-Specker theorempartition logicGrötschel-Lovász-Schrijver set

Mathematics Subject Classification ID

Logical foundations of quantum mechanics; quantum logic (quantum-theoretic aspects) (81P10)

Related Items (6)

Special issue: Quantum structures and quantum information theory ⋮ Varieties of contextuality based on probability and structural nonembeddability ⋮ On the complete description of entangled systems. I: Exploring hidden variables and context communication cost in simulating quantum correlations ⋮ Quantum violation of the suppes-zanotti inequalities and ``contextuality ⋮ On extension of joint distribution functions on quantum logics ⋮ Generalized Greenberger-Horne-Zeilinger arguments from quantum logical analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The role of bounded memory in the foundations of quantum mechanics
• Non-contextual chocolate balls versus value indefinite quantum cryptography
• Vector representations of graphs
• Contextuality and nonlocality in `no signaling' theories
• Relaxations of vertex packing
• Über Funktionen von Funktionaloperatoren
• Physical (a)causality. Determinism, randomness and uncaused events
• Orthogonal representations and connectivity of graphs
• Automaton partition logic versus quantum logic
• Automaton logic
• Pentagrams and paradoxes
• Logical equivalence between generalized urn models and finite automata
• Orthomodular lattices admitting no states
• Generalized Event Structures and Probabilities
• Quantum Computation and Quantum Information
• Simple Test for Hidden Variables in Spin-1 Systems
• On the Shannon capacity of a graph
• On Some Problems of Lovász Concerning the Shannon Capacity of a Graph

This page was built for publication: Faithful orthogonal representations of graphs from partition logics