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.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
physics.gen-ph 1years
2025 1verdicts
REJECT 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.