## Quantum Machine Learning Based on Minimizing Kronecker-Reed-Muller Forms and Grover Search Algorithm with Hybrid Oracles

- Bryan Lee, Marek A. Perkowski
- 2016 Euromicro Conference on Digital System…
- 2016

5 Excerpts

- Published 2006 in ISMVL

1 This work was supported in part by the Advanced Technology Program (ATP) of Texas under grant 003613-0029-2003. 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 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.

@inproceedings{Li2006AQC,
title={A Quantum CAD Accelerator Based on Grover's Algorithm for Finding the Minimum Fixed Polarity Reed-Muller Form},
author={Lun Li and Mitchell A. Thornton and Marek A. Perkowski},
booktitle={ISMVL},
year={2006}
}