A Quantum CAD Accelerator Based on Grover's Algorithm for Finding the Minimum Fixed Polarity Reed-Muller Form

Lun Li, M. Thornton, M. Perkowski
2006 36th International Symposium on Multiple-Valued Logic (ISMVL'06)  
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
more » ... 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. FPRM and Quantum Logic Background This section contains preliminary background discussion of two basic topics; the theory of FPRM forms and the basics of quantum logic circuits.
doi:10.1109/ismvl.2006.8 dblp:conf/ismvl/LiTP06 fatcat:urmrf4pifrbtdigxsd4xpslcei