Drawing from hats by noise-based logic

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.

arXiv commentAccepted for Publication in the International Journal of Parallel, Emergent and Distributed Systems. December 17, 2015

References in corpus (5)

• Noise-based logic: Binary, multi-valued, or fuzzy, with optional superposition of logic states
• Noise-based logic hyperspace with the superposition of 2^N states in a single wire
• Instantaneous noise-based logic
• Instantaneous, non-squeezed, noise-based logic
• Computation using Noise-based Logic: Efficient String Verification over a Slow Communication Channel

Cited by in corpus (3)

• "Quantum supremacy" revisited: Low-complexity, deterministic solutions of the original Deutsch-Jozsa problem in classical physical systems
• Noise-based logic gates by operations on the reference system
• Entanglement, and unsorted database search in noise-based logic