More on the Reference-Grounding-Based Search in Noise-Based Logic

Abstract

We point out that the exponentially fast, grounding-based search scheme in noise-based logic works mostly on core superpositions. When the superposition contains elements that are outputs of logic gate operations, the search result can be erroneous, because grounding of a reference bit can change a logic function too. Adding superpositions with a search bit of inverted signal amplitude sign (sign inversion instead of grounding) can fix the problem in special cases, but a general solution is yet to be found. Note that because phonebooks are core superpositions, the original search algorithm remains valid for phonebook lookups, for both name and number search, including fractions of names or numbers.