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.