Quantum‐Inspired Fourier Transforms Based on Circuits

Abstract Fourier transform (FT) is ubiquitous in modern society due to their broad applications in many branches of science and engineering. Improving the speed of FT is a common interest in the fields of signal processing. The quantum FT is generally believed to be superior to classical algorithms, but it requires a special quantum environment to perform, which has not yet been widely used. Inspired by quantum FT, here a new FT scheme is demonstrated based on circuits. In the circuit scheme, a new type of classical correlation, which its mathematical form corresponds to those of quantum entanglement, has been constructed. The calculation speed using the designed circuit scheme is equivalent to those based on the quantum FT algorithms, which is faster than those based on the classical fast FT algorithms. Furthermore, some basic gates have been designed and experimentally fabricated using classical circuit networks, which can emulate the functions of quantum gates. Fast calculation efficiencies for the FT based on the designed classical circuit networks have been demonstrated. Extensive applications of the FT scheme in the signal processing are anticipated.