Electric-Circuit Realization of Fast Quantum Search

Quantum search algorithm, which can search an unsorted database quadratically faster than any known classical algorithms, has become one of the most impressive showcases of quantum computation. It has been implemented using various quantum schemes. Here, we demonstrate both theoretically and experimentally that such a fast search algorithm can also be realized using classical electric circuits. The classical circuit networks to perform such a fast search have been designed. It has been shown that the evolution of electric signals in the circuit networks is analogies of quantum particles randomly walking on graphs described by quantum theory. The searching efficiencies in our designed classical circuits are the same to the quantum schemes. Because classical circuit networks possess good scalability and stability, the present scheme is expected to avoid some problems faced by the quantum schemes. Thus, our findings are advantageous for information processing in the era of big data.

Clustering Using Chaotic Circuit Networks with Weighted Couplings

In this paper, we focus on clustering phenomena in a network composed of coupled chaotic circuits. In this investigation, the coupling strength is reflected by the distance information when the chaotic circuits are placed in a two-dimensional grid. We observe various clustering phenomena in the network of coupled chaotic circuits when we vary the scaling parameters, including the coupling strength, the distance between coupled chaotic circuits and the density of the chaotic circuits.