Unified Quantum Parallel Computing Theory and Discrete Time Crystals

Quantum computing from general-purpose and birth-and-death biological types of computing, executed by a man-made quantum processor, to atom-as-processor type are formulated in a four-computational-state cellular automata architecture. When a chain of entangled atoms are employed as a computing machine in cellular automata, the computation results are the discrete time crystals with subharmonics value limited between ½ and ¼. The four orthogonal states of each atom in the entangled environment requires that the transition rules for the four computational states be of equal probability and cyclic. Superposition of two transition rules in one cellular automaton is shown to exist and the quantum computing irreversibility will be presented.