Noise-based logic gates by operations on the reference system

TL;DR

This paper introduces a low-complexity method for implementing multi-input logic gates in noise-based logic systems, enabling efficient quantum algorithm simulation on classical computers.

Contribution

It presents a novel approach to realize multi-input gates like NOT and CNOT with polynomial complexity, addressing a key challenge in noise-based logic processors.

Findings

Implemented NOT and CNOT gates using the proposed method

Achieved polynomial time and hardware complexity for gate operations

Advances the potential for classical simulation of quantum algorithms

Abstract

We propose a new, low-complexity solution to realize multi-input-bit gates acting on exponentially large superpositions in noise-based logic processors. Two examples are shown, the NOT gate and the CNOT gate. The operations can be executed and repeated with polynomial time and hardware complexity. The lack of a solution of this problem had been one of the major issues prohibiting the efficient realization of Shor's algorithm by Instantaneous Noise-Based Logic, which runs on a classical Turing computer with a true random number generator. With the method described in this paper, we are one step closer to this goal.