Quantum Boolean circuit approach for searching an unordered database

I. Ming Tsai, Sy Yen Kuo, D. S.L. Wei

研究成果: 圖書/報告稿件的類型會議稿件同行評審

9 引文 斯高帕斯(Scopus)

摘要

The discovery of polynomial time prime factorization, secure key distribution, and fast database search algorithm have recently made quantum computing the most rapidly expanding research field. For a quantum algorithm to be useful, it is essential that the algorithm can be implemented using quantum circuits. Nanotechnology, in particular quantum mechanics based devices, can be used to realize such an algorithm. In this paper, we show how quantum Boolean circuits can be used to implement the oracle circuit and the inversion-about-average function in Grover's search algorithm. We also show that a slight modification of the oracle circuit can be used to search multiple targets.

原文英語
主出版物標題Proceedings of the 2002 2nd IEEE Conference on Nanotechnology, IEEE-NANO 2002
發行者IEEE Computer Society
頁面315-318
頁數4
ISBN(電子)0780375386
DOIs
出版狀態已出版 - 2002
對外發佈
事件2nd IEEE Conference on Nanotechnology, IEEE-NANO 2002 - Washington, 美國
持續時間: 26 08 200228 08 2002

出版系列

名字Proceedings of the IEEE Conference on Nanotechnology
2002-January
ISSN(列印)1944-9399
ISSN(電子)1944-9380

Conference

Conference2nd IEEE Conference on Nanotechnology, IEEE-NANO 2002
國家/地區美國
城市Washington
期間26/08/0228/08/02

文獻附註

Publisher Copyright:
© 2002 IEEE.

指紋

深入研究「Quantum Boolean circuit approach for searching an unordered database」主題。共同形成了獨特的指紋。

引用此