DocumentCode :
2618037
Title :
A Quantum Algorithm for Finding Minimum Exclusive-Or Expressions
Author :
Sampson, M. ; Voudouris, D. ; Papakonstantinou, G.
Author_Institution :
Dept. of Electr. & Comput. Eng., Athens Nat. Tech. Univ.
fYear :
2007
fDate :
9-11 March 2007
Firstpage :
416
Lastpage :
421
Abstract :
This paper presents a quantum algorithm for minimizing both exclusive-or sum of complex terms (ESCT) and exclusive-or sum of products (ESOP) expressions. The proposed algorithm, QMin, takes advantage of the inherent massive parallelism of quantum circuits. The ESCT expressions produced by QMin are presented in the related bibliography as an attractive architecture for implementing reversible and quantum circuits.
Keywords :
quantum gates; exclusive-or sum of complex terms expressions; exclusive-or sum of products expressions; quantum algorithm; quantum circuits; Boolean functions; Circuits; Computer architecture; Computer science; Input variables; Laboratories; Minimization methods; Parallel processing; Quantum computing; Quantum mechanics;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
VLSI, 2007. ISVLSI '07. IEEE Computer Society Annual Symposium on
Conference_Location :
Porto Alegre
Print_ISBN :
0-7695-2896-1
Type :
conf
DOI :
10.1109/ISVLSI.2007.17
Filename :
4208949
Link To Document :
بازگشت