Searcharxiv⌕ Search

arXiv subjects

Yoshihiko Ohzawa

Publications and source records attributed to Yoshihiko Ohzawa.

2 recordsLinked to original sources

Contextuality as a Left Adjoint: A Categorical Generation of Orthomodular Structure

Contextuality is widely regarded as a hallmark of quantum information, yet its structural origin is often obscured by probabilistic or operational formulations. In this work, we show that non-distributive orthomodular structure need not be postulated, but arises canonically as a left adjoint from classical Boolean contexts. We introduce a gluing functor that takes pairs of Boolean algebras and identifies only their minimal and maximal elements via a categorical pushout. The resulting lattice is orthomodular but generically non-distributive. We prove that this construction is left adjoint to a forgetful functor selecting Boolean subalgebras, thereby providing a free but constrained generation of quantum-logical structure from classical contexts. Furthermore, we demonstrate that the failure of this pushout to remain Boolean is equivalent to the absence of global sections in the sheaf-theoretic framework of Abramsky and Brandenburger. This establishes a precise correspondence between contextuality as a sheaf obstruction and non-distributivity as a colimit failure. Our results offer a categorical and lattice-theoretic reconstruction of contextuality that precedes probabilistic notions and clarifies the structural necessity of quantum logic in information-theoretic settings.

quant-ph↗

Probabilistic Logic Gate in Asynchronous Game of Life with Critical Property

Metaheuristic and self-organizing criticality (SOC) could contribute to robust computation under perturbed environments. Implementing a logic gate in a computing system in a critical state is one of the intriguing ways to study the role of metaheuristics and SOCs. Here, we study the behavior of cellular automaton, game of life (GL), in asynchronous updating and implement probabilistic logic gates by using asynchronous GL. We find that asynchronous GL shows a phase transition, that the density of the state of 1 decays with the power law at the critical point, and that systems at the critical point have the most computability in asynchronous GL. We implement AND and OR gates in asynchronous GL with criticality, which shows good performance. Since tuning perturbations play an essential role in operating logic gates, our study reveals the interference between manipulation and perturbation in probabilistic logic gates.

cs.AI↗