|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
36th International Symposium on Multiple-Valued Logic (ISMVL'06)
A Quantum CAD Accelerator Based on Grover?s Algorithm for Finding the Minimum Fixed Polarity Reed-Muller Form
Singapore
May 17-May 20
ISBN: 0-7695-2532-6
| ASCII Text | x | ||
| Lun Li, Mitch Thornton, Marek Perkowski, "A Quantum CAD Accelerator Based on Grover?s Algorithm for Finding the Minimum Fixed Polarity Reed-Muller Form," Multiple-Valued Logic, IEEE International Symposium on, pp. 33, 36th International Symposium on Multiple-Valued Logic (ISMVL'06), 2006. | |||
| BibTex | x | ||
| @article{ 10.1109/ISMVL.2006.8, author = {Lun Li and Mitch Thornton and Marek Perkowski}, title = {A Quantum CAD Accelerator Based on Grover?s Algorithm for Finding the Minimum Fixed Polarity Reed-Muller Form}, journal ={Multiple-Valued Logic, IEEE International Symposium on}, volume = {0}, year = {2006}, issn = {0195-623X}, pages = {33}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISMVL.2006.8}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Multiple-Valued Logic, IEEE International Symposium on TI - A Quantum CAD Accelerator Based on Grover?s Algorithm for Finding the Minimum Fixed Polarity Reed-Muller Form SN - 0195-623X SP EP A1 - Lun Li, A1 - Mitch Thornton, A1 - Marek Perkowski, PY - 2006 KW - null VL - 0 JA - Multiple-Valued Logic, IEEE International Symposium on ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISMVL.2006.8
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.
Citation:
Lun Li, Mitch Thornton, Marek Perkowski, "A Quantum CAD Accelerator Based on Grover?s Algorithm for Finding the Minimum Fixed Polarity Reed-Muller Form," ismvl, pp.33, 36th International Symposium on Multiple-Valued Logic (ISMVL'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.