Computer Science – Computational Complexity
Scientific paper
2009-04-21
Computer Science
Computational Complexity
Version 2 eliminates two erroneous figures (4 and 5 in version 1) and adds a new section containing circuit examples of how to
Scientific paper
This paper discusses how to implement certain classes of quantum computer algorithms using classical discrete switching networks that are amenable to implementation in main stream CMOS transistor IC technology. The methods differ from other classical approaches in that asynchronous feedback is exploited in classical transistor reversible logic circuits to implement the Hadamard transform in one simultaneous step over all qubits as in a true quantum computer. The Simon problem is used as an example. The method is used to provide an order n execution speed method for the Gaussian elimination step in the Simon problem. The approach is referred to as a Thermodynamic Turing Machine in that it behaves like an artificial molecule where solutions to a problem are found by evolving the classical circuits from one thermodynamic equilibrium state to another.
No associations
LandOfFree
A Thermodynamic Turing Machine: Artificial Molecular Computing Using Classical Reversible Logic Switching Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Thermodynamic Turing Machine: Artificial Molecular Computing Using Classical Reversible Logic Switching Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Thermodynamic Turing Machine: Artificial Molecular Computing Using Classical Reversible Logic Switching Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-371728