Comments:

10 pages, PDF, June 30th 2009

Abstract:

Quantum automata were defined in refs.[2] and [3] as generalized, probabilistic automata with quantum state spaces [1]. Their next-state functions operate through transitions between quantum states defined by the quantum equations of motions in the Schroedinger representation, with both initial and boundary conditions in space-time. A new theorem is proven which states that the category of quantum automata and automata--homomorphisms has both limits and colimits. Therefore, both categories of quantum automata and classical automata (sequential machines) are bicomplete. A second new theorem establishes that the standard automata category is a subcategory of the quantum automata category. The quantum automata category has a faithful representation in the category of generalized (M,R)--systems which are open, dynamic biosystem networks [4] with defined biological relations that represent physiological functions of primordial(s), single cells and the simpler organisms. A new category of quantum computers is also defined in terms of reversible quantum automata with quantum state spaces represented by topological groupoids that admit a local characterization through unique, quantum Lie algebroids

Rights:

Open access: http://www.easychair.org/conferences/

Download:

login.cgi
uics3b.pdf
uics3dh.pdf

Links:

No messages.