完整后设资料纪录
DC 栏位 | 值 | 语言 |
---|---|---|
dc.contributor.author | 黎世杰 | en_US |
dc.contributor.author | Shyh-Jye Li | en_US |
dc.contributor.author | 刘晋良 | en_US |
dc.contributor.author | Jinn-Liang Liu | en_US |
dc.date.accessioned | 2014-12-12T02:29:04Z | - |
dc.date.available | 2014-12-12T02:29:04Z | - |
dc.date.issued | 2001 | en_US |
dc.identifier.uri | http://140.113.39.130/cdrfb3/record/nctu/#NT900507010 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/69305 | - |
dc.description.abstract | 陈巩与刁子健二人近来提出了新的量子运算演算法。此演算法能百分之百从随意储存的资料中搜寻到单一目标。这篇论文中,我们将此演算法推广到多重目标物的搜寻。我们的演算法先搜寻那些储存在资料列下半部的目标物,然后再搜寻那些储存在资料列上半部的目标物。新的演算法建立在“AND”及“OR”这两种逻辑运算上。利用此两种逻辑运算,我们可以产生两种辅助的oracle函数。在我们的演算法中,这两种辅助的oracle函数所扮演的角色与陈、刁二人演算法中的辅助的oracle函数类似,而且能正确地让动态叠代法运作。如果储存在后半部的目标物的数目(数目假设是 )是四的指数次,那么新的演算法同样能百分之百从 笔资料中找出目标物之中的一个,而且呼叫了 次的oracle。如果目标物的数目不是四的指数次,那么此演算法能以大于或等于二分之一的机率从 笔资料中找出目标物之中的一个,总共呼叫了 次的oracle,其中 为大于或等于 的四的指数次方的数之中最小的。这里,我们提出的演算法是比传统演算法快,但是却比Grover的演算法慢。 | zh_TW |
dc.description.abstract | Chen and Diao presented a quantum algorithm for searching an unsorted database capable of finding a single target item with certainty. In this paper, we generalize it to multiobject search. Our algorithm firstly searches for the target items residing in the lower portion of the database list and then for those in the upper portion. The new algorithm is based on the logic “AND” and “OR” operations that lead to two types of auxiliary oracle functions whose role in the algorithm is similar to that of Chen and Diao’s algorithm in terms of dynamical iteration properly. If the number of targets in the lower part, , is a power of four, the new algorithm will with certainty find one of the targets in a database of items using oracle calls. If is not a power of four, the algorithm will, with a probability of at least one-half, find one of the targets using no more than oracle calls, where is the smallest positive integer of power of four greater than or equal to . The algorithm we present here is faster than the classical one, but slower than Grover’s. | en_US |
dc.language.iso | zh_TW | en_US |
dc.subject | 量子演算法 | zh_TW |
dc.subject | quantum algorithm | en_US |
dc.title | 量子运算上之多重目标搜寻演算法 | zh_TW |
dc.title | A Quantum Algorithm for Multiobject Search | en_US |
dc.type | Thesis | en_US |
dc.contributor.department | 应用数学系所 | zh_TW |
显示于类别: | Thesis |