Pan Naiqiao, Chen Tian, Sun Houjun, Zhang Xiangdong
Key Laboratory of Advanced Optoelectronic Quantum Architecture and Measurements of Ministry of Education, Beijing Key Laboratory of Nanophotonics & Ultrafine Optoelectronic Systems, School of Physics, Beijing Institute of Technology, Beijing 100081, China.
Beijing Key Laboratory of Millimeter Wave and Terahertz Techniques, School of Information and Electronics, Beijing Institute of Technology, Beijing 100081, China.
Research (Wash D C). 2021 Jul 26;2021:9793071. doi: 10.34133/2021/9793071. eCollection 2021.
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.
量子搜索算法能够比任何已知的经典算法以二次方的速度更快地搜索未排序数据库，已成为量子计算最令人印象深刻的展示之一。它已通过各种量子方案得以实现。在此，我们通过理论和实验证明，这样一种快速搜索算法也可以使用经典电路来实现。已经设计出执行这种快速搜索的经典电路网络。结果表明，电路网络中电信号的演化类似于量子理论所描述的量子粒子在图上的随机游走。我们设计的经典电路中的搜索效率与量子方案相同。由于经典电路网络具有良好的可扩展性和稳定性，预计本方案能够避免量子方案所面临的一些问题。因此，我们的发现对于大数据时代的信息处理具有优势。
