Data Structures and Algorithms


Complex Noise-Bits and Large-Scale Instantaneous Parallel Operations with Low Complexity

Authors: He Wen, Laszlo B. Kish, Andreas Klappenecker

We introduce the complex noise-bit as information carrier, which requires noise signals in two parallel wires instead of the single-wire representations of noise-based logic discussed so far. The immediate advantage of this new scheme is that, when we use random telegraph waves as noise carrier, the superposition of the first 2^N integer numbers (obtained by the Achilles heel operation) yields non-zero values. We introduce basic instantaneous operations, with O(2^0) time and hardware complexity, including bit-value measurements in product states, single-bit and two-bit noise gates (universality exists) that can instantaneously operate over large superpositions with full parallelism. We envision the possibility of implementing instantaneously running quantum algorithms on classical computers while using similar number of classical bits as the number of quantum bits emulated without the necessity of error corrections. Mathematical analysis and proofs are given.

Comments: 10 Pages. In press at Fluctuation and Noise Letters

Download: PDF

Submission history

[v1] 2012-08-28 09:40:25
[v2] 2012-09-06 17:25:19
[v3] 2012-12-04 09:25:42

Unique-IP document downloads: 147 times

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus