arXiv subjects

Arthur Powalka

Publications and source records attributed to Arthur Powalka.

3 recordsLinked to original sources

arXiv2026

Pairwise XOR and XNOR Gates in Squeezed Instantaneous Noise Based Logic

Instantaneous noise-based logic (INBL) is a novel computing approach that encodes binary information using stochastic processes. It uses 2M orthogonal stochastic reference noises for M noise-bits to construct an exponentially large Hilbert space (hyperspace) of dimension 2^M. INBL offers a classical alternative to quantum-style parallelism for specific problems with exponential speedup compared to classical algorithms. Building on recent work that introduced pairwise XOR and XNOR operations defined for a symmetric INBL scheme, this paper implements these gates for a squeezed INBL scheme. Hyperspace vectors are product strings corresponding to M-bit long binary numbers. The proposed operations can apply pairwise on hyperspace vectors and their superpositions, while remaining compatible with the squeezed reference system. We validate that the squeezed-scheme XOR/XNOR gate operations have correct Boolean behavior over both bitwise and targeted M-bit strings and demonstrate that the operations preserve instantaneous evaluation. The results show that the XOR/XNOR toolkit, previously developed for symmetric INBL, can be tailored for the squeezed scheme. This development is a key part of the gate set needed for more complex INBL algorithms in the squeezed INBL scheme and advances the objective of gate universality in INBL. It further strengthens the case for INBL as a flexible, classical computing framework that can emulate some structural advantages of quantum computation.

cs.ET↗

arXiv2025

New XOR & XNOR Operations in Instantaneous Noise-Based Logic

Instantaneous Noise-Based Logic (INBL) presents a classical noise-based computing framework as an alternative to quantum computation, though some logic gates remain unimplemented for achieving universality over superpositions. INBL encodes M noise-bits using 2M orthogonal stochastic reference noises to construct a 2^M-dimensional product-based Hilbert space (hyperspace). Vectors in this hyperspace correspond to products of reference noises representing bit values in M-bit binary strings. This work introduces INBL implementations of XOR and XNOR operations targeting specific bits, facilitating pairwise operations directly between strings of equal length or hyperspace vectors, which are the longest strings. These operations naturally extend to superpositions, potentially delivering significant improvements in computational speed and hardware complexity. Diverging from previous methods by Khreishah et al., our approach avoids direct manipulation of the reference noise system, enabling more flexible and general-purpose implementations. We validate INBL operations-including NOT, XOR, and XNOR-through simulation using random telegraph waves, demonstrating practical feasibility without explicit reference noise manipulation.

physics.gen-ph↗

arXiv2025

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

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.

physics.gen-ph↗