Cargando…

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 experim...

Descripción completa

Detalles Bibliográficos
Autores principales: Pan, Naiqiao, Chen, Tian, Sun, Houjun, Zhang, Xiangdong
Formato: Online Artículo Texto
Lenguaje:English
Publicado: AAAS 2021
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8335527/
https://www.ncbi.nlm.nih.gov/pubmed/34396137
http://dx.doi.org/10.34133/2021/9793071
Descripción
Sumario: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.