XOR and XNOR gates in instantaneous noise based logic
Mohammad B. Khreishah, Walter C. Daugherity, Laszlo B. Kish

TL;DR
This paper introduces a novel method for implementing XOR and XNOR gates within Instantaneous Noise-Based Logic, enabling exponential speed-up in computation while maintaining polynomial hardware complexity.
Contribution
The paper presents a new approach to applying XOR and XNOR gates on large superpositions in Instantaneous Noise-Based Logic, achieving significant computational speed improvements.
Findings
Gates are repeatable and can operate on exponentially large superpositions.
The method achieves exponential speed-up with polynomial hardware complexity.
The approach enhances the efficiency of Instantaneous Noise-Based Logic systems.
Abstract
In this paper, we propose a new method of applying the XOR and XNOR gates on exponentially large superpositions in Instantaneous Noise-Based Logic. These new gates are repeatable, and they can achieve an exponential speed up in computation with a polynomial requirement in hardware complexity.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLow-power high-performance VLSI design · Quantum Computing Algorithms and Architecture · Cellular Automata and Applications
