A New Type of Classical Logic Circuit with Exponential Speedup

Compared with classical algorithms, quantum algorithms can show the advantage of exponential speedup in solving some problems. Solving NAND-Tree problem is a typical example, which be speed up exponentially by walk. This scheme groundbreaking due to universality negative-AND (NAND) gate. In fact, NAND gate also universal for computation, making it an important target development. Herein, onto circuit network mapped and new type logic that perform designed. These gates are designed have functions compared conventional ones. Because networks possess good scalability stability, present expected potential applications information processing era big data.