Quantum computational structures: Categorical equivalence for square root \(\mathrm{qMV}\)-algebras (Q609641)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Quantum computational structures: Categorical equivalence for square root qMV-algebras |
scientific article; zbMATH DE number 5822058
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Quantum computational structures: Categorical equivalence for square root \(\mathrm{qMV}\)-algebras |
scientific article; zbMATH DE number 5822058 |
Statements
Quantum computational structures: Categorical equivalence for square root \(\mathrm{qMV}\)-algebras (English)
0 references
1 December 2010
0 references
Quantum computing is based on quantum systems with finite-dimensional Hilbert spaces. The logical foundations of quantum computing uses quasi MV-algebras (qMV-algebras) and \(\sqrt{\mathrm{qMV}}\)-algebras. The main aim of the paper under review is to show a categorical equivalence between square root qMV-algebras and a category of preordered semigroups.
0 references
quantum computation
0 references
\(\sqrt{\mathrm{qMV}}\)-algebra
0 references
preordered semigroup
0 references
orthomodular lattice
0 references
finitely additive state
0 references
\(\sigma\)-additive state
0 references
filtering state
0 references
semi-exposed face
0 references
0.7989755868911743
0 references
0.7974594831466675
0 references
0.7948698401451111
0 references
0.7888826727867126
0 references
0.7786515951156616
0 references
