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