Paper Info
Title
A Quantum Algorithm for Finding Minimum Exclusive-Or Expressions for Multi-Output Incompletely Specified Boolean Functions
Abstract
Abstract— This paper,presents,a,quantum,algorithm,for finding minimal,ESCT (Exclusive-or Sum,of Complex,Terms) or ESOP (Exclusive-or Sum Of Products) expressions,for any arbitrary multi-output switching,function that is not necessarily completely,specified. The proposed,algorithm,takes advantage,of the inherent,massive,parallelism,of quantum,circuits in order to achieve,better complexity,than,the conventional,ones. The proposed,Exclusive-Or (xor) expressions,such as ESCT can be used to implement,an arbitrary Boolean function into a reversible or even a quantum,circuit. keywords: quantum computing, logic design ,
Year
Venue
Keywords
2008
CDES
sum of products,quantum computer,quantum algorithm,boolean function,logic design
Field
DocType
Citations 
Boolean function,Discrete mathematics,Combinatorics,Boolean circuit,Quantum phase estimation algorithm,Parity function,Product term,Quantum algorithm,Boolean expression,Circuit minimization for Boolean functions,Mathematics
Conference
0
PageRank 
References 
Authors
0.34
10
3
Name
Order
Citations
PageRank
Marinos Sampson1112.22
Dimitrios Voudouris2213.66
George K. Papakonstantinou315961.88