A Quantum Algorithm for Finding Minimum Exclusive-Or Expressions

This paper presents a quantum algorithm for finding minimal ESCT (Exclusive-or Sum of Complex Terms) or ESOP (Exclusiveor Sum Of Products) expressions for any arbitrary incompletely specified switching function. 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.

• Type: Conference
• Year: 2007
• Where: ISVLSI
• Authors: Marinos Sampson, Dimitrios Voudouris, George K. Papakonstantinou
• Keywords: ISVLSI 2007, Minimal Esct, Quantum Circuit, Sum Of Products