完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | 劉穎駿 | en_US |
dc.contributor.author | Ying-Chun Liu | en_US |
dc.contributor.author | 蔡錫鈞 | en_US |
dc.contributor.author | 陳榮傑 | en_US |
dc.contributor.author | Shi-Chun Tsai | en_US |
dc.contributor.author | Rong-Jaye Chen | en_US |
dc.date.accessioned | 2014-12-12T02:30:12Z | - |
dc.date.available | 2014-12-12T02:30:12Z | - |
dc.date.issued | 2002 | en_US |
dc.identifier.uri | http://140.113.39.130/cdrfb3/record/nctu/#NT910392024 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/70094 | - |
dc.description.abstract | 我們將會在這篇論文中提出量子群組測試的演算法。 群組測試這個問題已有五十年的歷史。 Clementi et al. 於 2001 年提出了 k-selective family。 而 Indyk 則在 2002 年提出了一個較簡單的 k-selective family 造法。 這個 k-selective family 正好可以用來解決群組測試問題。 這篇論文中我們先介紹 Grover 的量子搜尋演算法, 然後我們將合併 $k$-selective family 及量子搜尋演算法, 來解決群組測試問題。 這樣可以得到更好的時間複雜度。 | zh_TW |
dc.description.abstract | We describe the quantum group testing algorithm. Group testing problem has a history of research in the early days of computer science. In 2001, Clementi et al. introduce the k-selective family which can be used to solve this problem. Indyk provides a explicit construction method for the k-selective family in 2002. In this thesis, we first explain Grover's quantum search algorithm. Then we involve the k-selective system with quantum computation to solve the group testing problem with a better time complexity. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | 量子計算 | zh_TW |
dc.subject | 群組測試 | zh_TW |
dc.subject | selective family | zh_TW |
dc.subject | 量子搜尋演算法 | zh_TW |
dc.subject | quantum computation | en_US |
dc.subject | group testing | en_US |
dc.subject | selective family | en_US |
dc.subject | Grover's algorithm | en_US |
dc.title | 量子群組測試 | zh_TW |
dc.title | Quantum Group Testing with k-selective Families | en_US |
dc.type | Thesis | en_US |
dc.contributor.department | 資訊科學與工程研究所 | zh_TW |
顯示於類別: | 畢業論文 |