Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1604.01087

The Quantum Logic of Direct-Sum Decompositions

David Ellerman

Published Jan 1, 2016• 3 citations
arXivHTMLPDF
DOI
10.2139/ssrn.2770163

Related papers

The quantum logic of direct-sumdecompositions: the dual to the quantum logic of subspaces

David Ellerman

Since the pioneering work of Birkhoff and von Neumann, quantum logic has been interpreted as the logic of (closed) subspaces of a Hilbert space. There is a progression from the usual Boolean logic of subsets to the ‘quantum logic’ of subspaces of a general vector space—which is then specialized to the closed subspaces of a Hilbert space. But there is a ‘dual’ progression. The set notion of a partition (or quotient set or equivalence relation) is dual (in a category-theoretic sense) to the notion of a subset. Hence the Boolean logic of subsets has a dual logic of partitions. Then the dual progression is from that logic of set partitions to the quantum logic of direct-sum decompositions (i.e. the vector space version of a set partition) of a general vector space—which can then be specialized to the direct-sum decompositions of a Hilbert space. This allows the quantum logic of direct-sum decompositions to express measurement by any self-adjoint operators. The quantum logic of direct-sum decompositions is dual to the usual quantum logic of subspaces in the same sense that the logic of partitions is dual to the usual Boolean logic of subsets.

Logic Journal of IGPL•Jun 27, 2017•14 citations

The Logic of Partitions and Partition Logics: Ore's Correspondence, Contextual Pasting, and Direct-Sum Decompositions

Karl Svozil

The term ``partition logic'' denotes two constructions at different levels. In automaton and generalized-urn models, selected partitions generate Boolean event algebras whose contextwise union forms a concrete pasted event structure; in Ellerman's framework, whole partitions are classifications governed by refinement and partition operations. For a finite set $U$, Ore's correspondence maps each generator $π$ to its Boolean algebra $\BA(π)$, but it neither identifies the pasted carrier with $\Part(U)$ nor makes pasting a partition operation. It yields $\BA(π\wedgeσ)=\BA(π)\cap\BA(σ)$ and $\BA(π\veeσ)=\langle\BA(π)\cup\BA(σ)\rangle_{\rm BA}$, where $\langle\cdot\rangle_{\rm BA}$ denotes Boolean-algebra generation. Thus meet captures the common event algebra, whereas join gives the ambient Boolean closure. Chinese-lantern, Firefly, and triangular examples distinguish shared events, atomic intertwining, and inherited concrete order. Ellerman's direct-sum decompositions (DSDs) provide a vector-space analogue: component projections of an orthogonal DSD resolve the identity and encode exclusive outcomes, but its components are not equivalence classes of vectors. Gleason and Kochen--Specker applications require globally context-consistent valuations on those projections.

quant-pharXiv:2608.08931•Aug 11, 2026•0 citations

On quantum logic

Thomas A. Brody

Foundations of Physics•May 1, 1984•5 citations

On Quantum Logic

Thomas A. Brody

Springer eBooks•Jan 1, 1993•5 citations

Quantum logic as a sum over classical logic gates

Bruno Nachtergaele, Vipul Periwal

It is shown that certain natural quantum logic gates, {\it i.e.} unitary time evolution matrices for spin-\frac{1}{2} quantum spins, can be represented as sums, with appropriate phases, over classical logic gates, in a direct analogy with the Feynman path integral representation of quantum mechanics. On the other hand, it is shown that a natural quantum gate obtained by analytically continuing the transfer matrix of the anisotropic nearest-neighbour Ising model to imaginary time, does not admit such a representation.

arXiv:quant-ph/9606018•Jun 16, 1996•1 citation

A New Approach to Quantum Logic

Dov M. Gabbay, Kurt Engesser, Daniel J. Lehmann

•Jan 1, 2008•10 citations
Since the pioneering work of Birkhoff and von Neumann, quantum logic has been interpreted as the logic of (closed) subspaces of a Hilbert space. There is a progression from the usual Boolean logic of subsets to the ‘quantum logic’ of subspaces of a general vector space—which is then specialized to the closed subspaces of a Hilbert space. But there is a ‘dual’ progression. The set notion of a partition (or quotient set or equivalence relation) is dual (in a category-theoretic sense) to the notion of a subset. Hence the Boolean logic of subsets has a dual logic of partitions. Then the dual progression is from that logic of set partitions to the quantum logic of direct-sum decompositions (i.e. the vector space version of a set partition) of a general vector space—which can then be specialized to the direct-sum decompositions of a Hilbert space. This allows the quantum logic of direct-sum decompositions to express measurement by any self-adjoint operators. The quantum logic of direct-sum decompositions is dual to the usual quantum logic of subspaces in the same sense that the logic of partitions is dual to the usual Boolean logic of subsets.
The term ``partition logic'' denotes two constructions at different levels. In automaton and generalized-urn models, selected partitions generate Boolean event algebras whose contextwise union forms a concrete pasted event structure; in Ellerman's framework, whole partitions are classifications governed by refinement and partition operations. For a finite set UUU, Ore's correspondence maps each generator πππ to its Boolean algebra $\BA(π)$, but it neither identifies the pasted carrier with $\Part(U)$ nor makes pasting a partition operation. It yields $\BA(π\wedgeσ)=\BA(π)\cap\BA(σ)$ and $\BA(π\veeσ)=\langle\BA(π)\cup\BA(σ)\rangle_{\rm BA}$, where ⟨⋅⟩BA\langle\cdot\rangle_{\rm BA}⟨⋅⟩BA​ denotes Boolean-algebra generation. Thus meet captures the common event algebra, whereas join gives the ambient Boolean closure. Chinese-lantern, Firefly, and triangular examples distinguish shared events, atomic intertwining, and inherited concrete order. Ellerman's direct-sum decompositions (DSDs) provide a vector-space analogue: component projections of an orthogonal DSD resolve the identity and encode exclusive outcomes, but its components are not equivalence classes of vectors. Gleason and Kochen--Specker applications require globally context-consistent valuations on those projections.
It is shown that certain natural quantum logic gates, {\it i.e.} unitary time evolution matrices for spin-\frac{1}{2} quantum spins, can be represented as sums, with appropriate phases, over classical logic gates, in a direct analogy with the Feynman path integral representation of quantum mechanics. On the other hand, it is shown that a natural quantum gate obtained by analytically continuing the transfer matrix of the anisotropic nearest-neighbour Ising model to imaginary time, does not admit such a representation.