A quantum algorithm for finding minimum exclusive-or expressions

Sampson, M; Voudouris, D; Papakonstantinou, G

dc.contributor.author	Sampson, M	en
dc.contributor.author	Voudouris, D	en
dc.contributor.author	Papakonstantinou, G	en
dc.date.accessioned	2014-03-01T02:44:24Z
dc.date.available	2014-03-01T02:44:24Z
dc.date.issued	2007	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/31801
dc.subject	Quantum Algorithm	en
dc.subject	Quantum Circuits	en
dc.subject	Sum of Products	en
dc.subject.other	Computer architecture	en
dc.subject.other	Optimization	en
dc.subject.other	Quantum theory	en
dc.subject.other	VLSI circuits	en
dc.subject.other	Exlusive-or Sum of Complex Terms (ESCT)	en
dc.subject.other	Exlusive-or Sum of Products (ESOP)	en
dc.subject.other	QMin	en
dc.subject.other	Quantum algorithms	en
dc.subject.other	Algorithms	en
dc.title	A quantum algorithm for finding minimum exclusive-or expressions	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/ISVLSI.2007.17	en
heal.identifier.secondary	http://dx.doi.org/10.1109/ISVLSI.2007.17	en
heal.identifier.secondary	4208949	en
heal.publicationDate	2007	en
heal.abstract	Abstract This paper presents a quantum,algorithm for minimiz- ing both Exlusive-or Sum of Complex Terms (ESCT) and Exlusive-or Sum of Products (ESOP) expressions. The pro- posed algorithm, QMin, takes advantage of the inherrent massive parallelism of quantum,circuits. The ESCT expres- sions produced by QMin are presented in the related bibli- ography as an attractive architecture for implementing,re- versible and quantum,circuits.	en
heal.journalName	Proceedings - IEEE Computer Society Annual Symposium on VLSI: Emerging VLSI Technologies and Architectures	en
dc.identifier.doi	10.1109/ISVLSI.2007.17	en
dc.identifier.spage	416	en
dc.identifier.epage	421	en