On a family of quantum search algorithms robust against phase imperfections

dc.citation.epage	642	en_US
dc.citation.issue	6	en_US
dc.citation.spage	637	en_US
dc.citation.volume	45	en_US
dc.citation.woscount	0
dc.contributor.author	Li, Che-Ming	en_US
dc.contributor.author	Hsieh, Jin-Yuan	en_US
dc.contributor.author	Chuu, Der-San	en_US
dc.contributor.department	電子物理學系	zh_TW
dc.contributor.department	Department of Electrophysics	en_US
dc.date.accessioned	2014-12-08T15:13:05Z
dc.date.available	2014-12-08T15:13:05Z
dc.date.issued	2007-12-01	en_US
dc.description.abstract	A family of algorithms has been recently considered for sure-success quantum search problems. When the phase inversion operations of these algorithms are identical to those of the standard Grover algorithm, it is found that this family of algorithms is robust against the inevitable phase imperfections.	en_US
dc.identifier.issn	0577-9073	en_US
dc.identifier.journal	CHINESE JOURNAL OF PHYSICS	en_US
dc.identifier.uri	https://ir.lib.nycu.edu.tw/handle/11536/10086
dc.identifier.wosnumber	WOS:000251996600007
dc.language.iso	en_US	en_US
dc.title	On a family of quantum search algorithms robust against phase imperfections	en_US
dc.type	Article	en_US

Files

Now showing 1 - 1 of 1