Quantum circuit design and analysis for database search applications

Yi Lin Ju*, I. Ming Tsai, Sy Yen Kuo

*此作品的通信作者

研究成果: 期刊稿件文章同行評審

20 引文 斯高帕斯(Scopus)

摘要

In this paper, we show how quantum Boolean circuits can be used to implement the oracle and the inversion-about-average function in Grover's search algorithm. Before illustrating how this can be done, we present the circuit design principle using the satisfiability (SAT) problem as an example. Then, based on this principle, we show the quantum circuits for two different kinds of applications. The first one is searching a phone book. Although this is a typical example of Grover's algorithm, we show that it is impractical as a real-world application. As the second application, we give the quantum circuits for a more practical application-breaking a symmetric cryptosystem. Although these two applications have quite different types of search criteria, they are both one-way functions and the proposed circuits can actually be generalized to any such problems. In this perspective, we conclude this paper by proposing a template of quantum circuits that is capable of searching the solution of a certain class of one-way functions.

原文英語
頁(從 - 到)2552-2563
頁數12
期刊IEEE Transactions on Circuits and Systems I: Regular Papers
54
發行號11 SPEC. ISS.
DOIs
出版狀態已出版 - 2007
對外發佈

指紋

深入研究「Quantum circuit design and analysis for database search applications」主題。共同形成了獨特的指紋。

引用此