Author_Institution :
Dept. of Comput. Sci., Univ. of Oxford, Oxford, UK
Abstract :
Operator algebras provide uniform semantics for deterministic, reversible, probabilistic, and quantum computing, where intermediate results of partial computations are given by commutative sub algebras. We study this setting using domain theory, and show that a given operator algebra is scattered if and only if its associated partial order is, equivalently: continuous (a domain), algebraic, atomistic, quasi-continuous, or quasialgebraic. In that case, conversely, we prove that the Lawson topology, modelling information approximation, allows one to associate an operator algebra to the domain.
Keywords :
algebra; approximation theory; quantum computing; Lawson topology; commutative C*-subalgebras; deterministic computing; domain theory; modelling information approximation; operator algebras; probabilistic computing; quantum computing; reversible computing; uniform semantics; Algebra; Approximation methods; Computational modeling; Probabilistic logic; Quantum computing; Semantics; Topology; C-algebra; Domain; quantum computing;