Quantum Boolean circuit approach for searching an unordered database

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

doi:10.1109/NANO.2002.1032254

Quantum Boolean circuit approach for searching an unordered database

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

9 Scopus citations

Abstract

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.

Original language	English
Title of host publication	Proceedings of the 2002 2nd IEEE Conference on Nanotechnology, IEEE-NANO 2002
Publisher	IEEE Computer Society
Pages	315-318
Number of pages	4
ISBN (Electronic)	0780375386
DOIs	https://doi.org/10.1109/NANO.2002.1032254
State	Published - 2002
Externally published	Yes
Event	2nd IEEE Conference on Nanotechnology, IEEE-NANO 2002 - Washington, United States Duration: 26 08 2002 → 28 08 2002

Publication series

Name	Proceedings of the IEEE Conference on Nanotechnology
Volume	2002-January
ISSN (Print)	1944-9399
ISSN (Electronic)	1944-9380

Conference

Conference	2nd IEEE Conference on Nanotechnology, IEEE-NANO 2002
Country/Territory	United States
City	Washington
Period	26/08/02 → 28/08/02

Bibliographical note

Publisher Copyright:
© 2002 IEEE.

Keywords

Circuits
Data engineering
Databases
Distributed computing
Information science
Linearity
Nanotechnology
Polynomials
Quantum computing
Sequential analysis

Access to Document

10.1109/NANO.2002.1032254

Cite this

Tsai, I. M., Kuo, S. Y., & Wei, D. S. L. (2002). Quantum Boolean circuit approach for searching an unordered database. In Proceedings of the 2002 2nd IEEE Conference on Nanotechnology, IEEE-NANO 2002 (pp. 315-318). Article 1032254 (Proceedings of the IEEE Conference on Nanotechnology; Vol. 2002-January). IEEE Computer Society. https://doi.org/10.1109/NANO.2002.1032254

@inproceedings{d9e2a4b9ccd1497297360f64c5392d0b,

title = "Quantum Boolean circuit approach for searching an unordered database",

abstract = "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.",

keywords = "Circuits, Data engineering, Databases, Distributed computing, Information science, Linearity, Nanotechnology, Polynomials, Quantum computing, Sequential analysis",

author = "Tsai, {I. Ming} and Kuo, {Sy Yen} and Wei, {D. S.L.}",

note = "Publisher Copyright: {\textcopyright} 2002 IEEE.; 2nd IEEE Conference on Nanotechnology, IEEE-NANO 2002 ; Conference date: 26-08-2002 Through 28-08-2002",

year = "2002",

doi = "10.1109/NANO.2002.1032254",

language = "英语",

series = "Proceedings of the IEEE Conference on Nanotechnology",

publisher = "IEEE Computer Society",

pages = "315--318",

booktitle = "Proceedings of the 2002 2nd IEEE Conference on Nanotechnology, IEEE-NANO 2002",

address = "美国",

}

Tsai, IM, Kuo, SY & Wei, DSL 2002, Quantum Boolean circuit approach for searching an unordered database. in Proceedings of the 2002 2nd IEEE Conference on Nanotechnology, IEEE-NANO 2002., 1032254, Proceedings of the IEEE Conference on Nanotechnology, vol. 2002-January, IEEE Computer Society, pp. 315-318, 2nd IEEE Conference on Nanotechnology, IEEE-NANO 2002, Washington, United States, 26/08/02. https://doi.org/10.1109/NANO.2002.1032254

Quantum Boolean circuit approach for searching an unordered database. / Tsai, I. Ming; Kuo, Sy Yen; Wei, D. S.L.
Proceedings of the 2002 2nd IEEE Conference on Nanotechnology, IEEE-NANO 2002. IEEE Computer Society, 2002. p. 315-318 1032254 (Proceedings of the IEEE Conference on Nanotechnology; Vol. 2002-January).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Quantum Boolean circuit approach for searching an unordered database

AU - Tsai, I. Ming

AU - Kuo, Sy Yen

AU - Wei, D. S.L.

PY - 2002

Y1 - 2002

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

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

KW - Circuits

KW - Data engineering

KW - Databases

KW - Distributed computing

KW - Information science

KW - Linearity

KW - Nanotechnology

KW - Polynomials

KW - Quantum computing

KW - Sequential analysis

UR - http://www.scopus.com/inward/record.url?scp=84948955330&partnerID=8YFLogxK

U2 - 10.1109/NANO.2002.1032254

DO - 10.1109/NANO.2002.1032254

M3 - 会议稿件

AN - SCOPUS:84948955330

T3 - Proceedings of the IEEE Conference on Nanotechnology

SP - 315

EP - 318

BT - Proceedings of the 2002 2nd IEEE Conference on Nanotechnology, IEEE-NANO 2002

PB - IEEE Computer Society

T2 - 2nd IEEE Conference on Nanotechnology, IEEE-NANO 2002

Y2 - 26 August 2002 through 28 August 2002

ER -

Quantum Boolean circuit approach for searching an unordered database

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this