Quantum Boolean circuit construction and layout under locality constraint
Resource
Nanotechnology, 2001. IEEE-NANO 2001. Proceedings of the 2001 1st IEEE Conference on
Journal
1st IEEE Conference on Nanotechnology, IEEE-NANO 2001
Pages
-
Date Issued
2001-10
Date
2001-10
Author(s)
Tsai, I-Ming
DOI
N/A
Abstract
The discovery of Shor's prime factorization and Grover's fast database search algorithm have made quantum computing the most rapidly expanding research field recently. Nanotechnology, in particular silicon-based nanoscale device, has been proposed as one of the candidates that can be used to implement a quantum computer. In this paper, we have derived a systematic procedure to realize any general m-to-n bit combinational boolean logic using elementary quantum gates. The quantum circuit layout under the locality constraint is then formulated, together with the gate count evaluation function, to reduce the total number of quantum gates required to implement the circuit. © 2001 IEEE.
Other Subjects
Algorithms; Computation theory; Logic circuits; Logic gates; Quantum computers; Quantum electronics; Quantum optics; Quantum theory; Search engines; Database search algorithms; Evaluation function; Nanoscale device; Prime factorization; Quantum Boolean circuits; Quantum circuit; Quantum Computing; Research fields; Nanotechnology
Type
conference paper
File(s)![Thumbnail Image]()
Loading...
Name
00966403.pdf
Size
362.62 KB
Format
Adobe PDF
Checksum
(MD5):46497aac81d51d3a608cc3383c7f31bb