Publication View

of Quantum Automata and Quantum Computers with n-Lukasiewicz VLSI boards; Generalized (M,R)- (2008)

Abstract
Universal decomposition, performance and categorical properties will be presented for quantum automata in the form of three new theorems for the category of quantum automata [1][1], quantum computers [2] , Qa,c, and their related quantum logics based on an extension of n-Lukasiewicz algebra [3] as well as their applications [4]. The category of quantum automata and quantum computers is first defined, and then a complete proof is provided

Publication details
Download http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.3657
Source http://fs512.fshn.uiuc.edu/QAuto.pdf
Contributors CiteSeerX
Repository CiteSeerX - Scientific Literature Digital Library and Search Engine (United States)
Keywords for the existence of unique limits and colimits in this category. Both the new category of quantum a
Type text
Language English