Drawing from hats by noise-based logic
Reads0
Chats0
TLDR
It is shown 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.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 2N 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.read more
Citations
More filters
Journal ArticleDOI
Entanglement, and unsorted database search in noise-based logic
TL;DR: The collapse of "wavefunction" and the measurement of entanglement in the superpositions of hyperspace vectors in classical physical instantaneous-noise-based logic (INBL) is explored and both similarities with and major differences from the related properties of quantum systems are found.
Journal ArticleDOI
‘Quantum supremacy’ revisited: low-complexity, deterministic solutions of the original Deutsch–Jozsa problem in classical physical systems
TL;DR: In this paper , it was shown that the Deutsch-Jozsa problem can be solved on a classical computer with O[log(N)] complexity, even without a random coin.
Journal ArticleDOI
Noise-based logic gates by operations on the reference system
TL;DR: In this paper, a low-complexity solution to realize multi-input-bit gates acting on exponentially large superpositions in noise-based logic processors is proposed, which can be executed and repeated with polynomial time and hardware complexity.
Journal ArticleDOI
Noise-Based Logic Gates by Operations on the Reference System
TL;DR: In this paper, a low-complexity solution to realize multi-input-bit gates acting on exponentially large superpositions in noise-based logic processors is proposed, and two examples are shown, the NOT gate and the...
Journal ArticleDOI
XOR and XNOR gates in instantaneous noise based logic
TL;DR: In this paper , a new method of applying the XOR and XNOR gates on exponentially large superpositions in Instantaneous Noise-Based Logic was proposed, which can achieve an exponential speed up in computation with a polynomial requirement in hardware complexity.
References
More filters
Journal ArticleDOI
Noise-based logic: Binary, multi-valued, or fuzzy, with optional superposition of logic states
TL;DR: A new type of deterministic (non-probabilistic) computer logic system inspired by the stochasticity of brain signals is shown, which has reduced energy dissipation and leakage current problems, and robustness against circuit noise and background noises.
Journal ArticleDOI
Noise-based logic hyperspace with the superposition of 2N states in a single wire
TL;DR: It is shown that the logic hyperspace (product) vectors defined in the introductory paper can be generalized to provide the discrete superposition of 2 N orthogonal system states, equivalent to a multi-valued logic system with 2 2 N logic values per wire.
Journal ArticleDOI
Computation using noise-based logic: efficient string verification over a slow communication channel
TL;DR: In this paper, two string verification methods with low communication complexity are presented, one based on continuum noise-based logic and the other based on random telegraph signals where a mathematical analysis of the error probability is also given.
Journal ArticleDOI
New noise-based logic representations to avoid some problems with time complexity
TL;DR: In this article, the amplitudes of the signals of L and H states were modified to achieve an exponential speedup compared to the old situation and the identification of a single product-string (hyperspace vector).
Journal ArticleDOI
Instantaneous, non-squeezed, noise-based logic
Ferdinand Peper,Laszlo B. Kish +1 more
TL;DR: In this paper, the authors proposed Boolean universal logic gates for non-squeezed logic values where both the high and low values are encoded into nonzero, bipolar, independent random telegraph waves.