A benchmark of instantaneous noise-based logic claims O(1) time for operations on exponentially large sets, but the speedup depends on free input encoding and fails against the authors' own classical algorithm.
Computation using Noise-based Logic: Efficient String Verification over a Slow Communication Channel
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Utilizing the hyperspace of noise-based logic, we show two string verification methods with low communication complexity. One of them is based on continuum noise-based logic. The other one utilizes noise-based logic with random telegraph signals where a mathematical analysis of the error probability is also given. The last operation can also be interpreted as computing universal hash functions with noise-based logic and using them for string comparison. To find out with 10^-25 error probability that two strings with arbitrary length are different (this value is similar to the error probability of an idealistic gate in today's computer) Alice and Bob need to compare only 83 bits of the noise-based hyperspace.
citation-role summary
method 1
citation-polarity summary
fields
physics.gen-ph 1years
2025 1verdicts
REJECT 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
"Quantum supremacy" challenged. Instantaneous noise-based logic with benchmark demonstrations
A benchmark of instantaneous noise-based logic claims O(1) time for operations on exponentially large sets, but the speedup depends on free input encoding and fails against the authors' own classical algorithm.