Classical Combinatorial Sequential Machine Components Implemented with Quantum Devices

摘要

The majority of work today relating to quantum computing has provided results that are almost incomprehensible to even the most advanced computer architect. This paper uses the recent research results of quantum mechanical logic as building blocks to derive a computer architecture based on quantum devices that is consistent with existing system architectures. The new and admittedly exotic nature of quantum computing notwithstanding, this work presents a quantum mechanical analog of a finite state machine which may be realized from a present day architectural framework. Existing architectures are finite state sequential machines with binary data representations, asynchronous combinatorial Boolean logic and synchronous memory. Synchronous combinatorial logic with a binary data representation and implementations of D, T and JK flip- flops, which are the primary forms of synchronous memory, are presented using quantum and near quantum devices. Even the issue of reliable operation of quantum devices is addressed by suggesting that redundancy and quantum majority logic could perform single error correction at key points within the quantum system. Quantum devices can be a step in the evolution of advanced computer architectures.