"Quantum supremacy" challenged. Instantaneous noise-based logic with benchmark demonstrations

TL;DR

This paper introduces Instantaneous Noise-Based Logic (INBL), a deterministic classical computing paradigm that mimics quantum exponential speedup without quantum hardware, demonstrated through benchmark applications like search and Deutsch-Jozsa algorithm.

Contribution

The paper presents INBL as a novel noise-based logic system capable of exponential speedup, challenging quantum supremacy claims with hardware-efficient, deterministic classical computations.

Findings

INBL achieves exponential speedup in search tasks.

Experimental results show INBL outperforms classical algorithms in speed.

INBL operates without decoherence or error correction.

Abstract

Instantaneous Noise-Based Logic (INBL) represents a computational paradigm that offers a deterministic alternative to quantum computing, potentially challenging the notion of quantum supremacy without relying on quantum hardware. INBL encodes logical information in orthogonal stochastic processes ("noise-bits") and exploits their superpositions and nonlinear interactions to achieve an exponentially large computational space of dimension 2^M, where M corresponds to the number of noise-bits analogous to qubits in quantum computing. This approach enables an exponential increase in computational throughput, with a computational speedup scaling on the order of O(2^M), while maintaining hardware complexity comparable to quantum systems. Unlike quantum computers, INBL operates without decoherence, error correction, or probabilistic measurement, yielding deterministic outputs with low error probability. Demonstrated applications include exponential speed-gain compared to classical computers, such as INBL phonebook searches (for number or name lookup) and the implementation of the Deutsch-Jozsa algorithm, illustrating INBL's capability to perform special-purpose computations with quantum-like exponential speedup using classical-physical noise-based hardware. We present an experimental comparison between the execution speeds of a Classical Turing machine algorithm - which changes the values of odd numbers in an exponentially large set to their next lower even numbers - and its INBL counterpart. Another experimental demonstration of the exponential speedup in finding and removing a given number from an exponentially large, unsorted set of integers.