Drawing from hats by noise-based logic. Issue 3 (4th May 2017)

• Record Type: Journal Article
• Authors: Zhang, Bruce; Kish, Laszlo Bela; Granqvist, Claes-Göran
• Is Part Of: International journal of parallel, emergent and distributed systems. Volume 32:Issue 3(2017)
• Page Start: 244
• Page End: 251
• Publication Date: 2017-05-04
• Subjects: Noise-based logic -- random algorithms -- superposition -- computational complexity; Parallel computers -- Periodicals; Electronic data processing -- Distributed processing -- Periodicals; Computer algorithms -- Periodicals; 004.35
• DOI: 10.1080/17445760.2016.1140168
• Languages: English
• ISSNs: 1744-5760

Abstract

Abstract: We utilize the asymmetric random telegraph wave-based instantaneous noise-base logic scheme to represent the problem of drawing numbers from a hat, and we consider two identical hats with the first 2 N integer numbers. In the first problem, Alice secretly draws an arbitrary number from one of the hats, and Bob must find out which hat is missing a number. In the second problem, Alice removes a known number from one of the hats and another known number from the other hat, and Bob must identify these hats. We show that, when the preparation of the hats with the numbers is accounted for, the noise-based logic scheme always provides an exponential speed-up and/or it requires exponentially smaller computational complexity than deterministic alternatives. Both the stochasticity and the ability to superpose numbers are essential components of the exponential improvement.