2013 IEEE 43rd International Symposium on Multiple-Valued Logic (2006)

Singapore

May 17, 2006 to May 20, 2006

ISSN: 0195-623X

ISBN: 0-7695-2532-6

pp: 33

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISMVL.2006.8

Mitch Thornton , Southern Methodist University, Dallas, TX

Marek Perkowski , Portland State University, Portland, OR

Lun Li , Southern Methodist University, Dallas, TX

ABSTRACT

We describe the use of Grover?s algorithm as implemented in a quantum logic circuit that produces a solution for a classical switching circuit design problem. The particular application described here is to determine a Fixed Polarity Reed-Muller (FPRM) form that satisfies a threshold value constraint, thus we find a particular FPRM form among all 2^n FPRM forms that has a number of terms less than or equal to the threshold value. Grover?s algorithm is implemented in a quantum logic circuit that also contains a subcircuit that expresses all possible FPRM solutions of a given function. This approach illustrates how fast transforms as known from spectral theory can be combined with quantum computing as a part of an oracle.

INDEX TERMS

null

CITATION

Mitch Thornton,
Marek Perkowski,
Lun Li,
"A Quantum CAD Accelerator Based on Grover?s Algorithm for Finding the Minimum Fixed Polarity Reed-Muller Form",

*2013 IEEE 43rd International Symposium on Multiple-Valued Logic*, vol. 00, no. , pp. 33, 2006, doi:10.1109/ISMVL.2006.8