Electric-Circuit Realization of Fast Quantum Search

Naiqiao Pan,Houjun Sun,Tian Chen,Xiangdong Zhang

doi:10.34133/2021/9793071

Abstract

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.

Highlights

Quantum computation has been the focus of numerous studies and is expected to play an important role in future information processing, since it outperforms classical computation at many tasks
Some investigations [3,4,5,6,7] have shown that the continuous-time quantum walk (CTQW) search algorithm on the graph can display the quadratic speedup, which is similar to that of Grover’s algorithm
Spatial search by quantum walk is optimal for almost all graphs [7], which helps to make a flexible design for the search algorithm

Summary

Introduction

Quantum computation has been the focus of numerous studies and is expected to play an important role in future information processing, since it outperforms classical computation at many tasks One such task is quantum searching, introduced by Grover [1]. It shows quadratic speedup to the fastest classical algorithm in searching unsorted databases. Such an algorithm is extremely important, both from fundamental and practical standpoints, because it is a basis of many other quantum algorithms [2]. Some investigations [3,4,5,6,7] have shown that the continuous-time quantum walk (CTQW) search algorithm on the graph can display the quadratic speedup, which is similar to that of Grover’s algorithm.

Objectives

Methods

Conclusion