New Implementation of Complete Symbolic Substitution Logic for Digital Optical Computing

Frank A. P. Tooley

C. H. Wu

The fundamental flaws of qubit concept for general-purpose quantum computing are elaborated here. We show that from implementing of the addition operation of two bits, only four symbolic substitution rules are needed. Superposition of four states from the two qub its is then irrelevant for the addition operation of two bits. The fundamental quantum processor needed is further described here against the quib it concept. The quantum Turing Machine is thus settled in the cellular automata architecture. Therefore, quantum computing must be rule-based, rather than logic-gate based.

변영태, 김재헌, Nam‐Gyu Park +2 more

Ahmed Louri, Arthur David Post

Optical computing has been suggested as a means of achieving a high degree of parallelism for both scientific and symbolic applications. While a number of implementations of logic operations have been forwarded, all have some characteristic that prevents their direct extension to functions of a large number of input bits. We analyze several of these implementations and demonstrate that all these implementations require that some measure of the system (area, space-bandwidth product, or time) grow exponentially with the number of inputs. We then suggest an implementation whose complexity is no greater than the best theoretical realization of a Boolean function. We demonstrate the optimality of that realization, to within a constant multiple, for digital optical-computing systems realized by bulk spatially variant elements.

Arthur David Post

Optical computing has been suggested as a means of achieving a high degree of parallelism for both scientific and symbolic applications. While a number of implementations of logic operations have been forwarded, all have some characteristic which prevents their direct extension to functions of a large number of input bits. This paper will analyze several of these implementations and demonstrate that all these implementations require some measure of the system (area, space-bandwidth product, or time) to grow exponentially with the number of inputs. We will then suggest an implementation whose complexity is not greater than the best theoretical realization of a boolean function. We will demonstrate the optimality of the realization, to within a constant multiple, for digital optical computing systems realized by bulk space-variant elements.

Ankur Saharia, Ravi Kumar Maddila, Jalil Ali +2 more