| DC 欄位 |
值 |
語言 |
| DC.contributor | 資訊工程學系 | zh_TW |
| DC.creator | 王昱傑 | zh_TW |
| DC.creator | Yu-Jie Wang | en_US |
| dc.date.accessioned | 2023-7-25T07:39:07Z | |
| dc.date.available | 2023-7-25T07:39:07Z | |
| dc.date.issued | 2023 | |
| dc.identifier.uri | http://ir.lib.ncu.edu.tw:444/thesis/view_etd.asp?URN=110522140 | |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| DC.description | 國立中央大學 | zh_TW |
| DC.description | National Central University | en_US |
| dc.description.abstract | 近年來，量子計算(quantum computing)由於強大的計算能力在學術界和工業界都引起了廣泛的關注和研究。學術界的研究推動了理論和技術的發展，而工業界的參與加速了量子計算技術的實際應用和商業化進程。巨擘科技如IBM、Google、Microsoft，都已經投入了大量資源和人力進行量子計算的研究和開發，推出了自己的量子計算平台或套件，並開放給研究機構和開發者使用，以促進量子計算技術的應用和驗證。本論文聚焦於在 IBM 提供的量子電腦(quantum computer)及量子模擬器(quantum simulator)上，以格羅弗演算法(Grover’s algorithm)解決屬於 NPC 問題的精確覆蓋(exact cover)問題。其中使用 IBM Qiskit 套件建構量子線路(quantum circuit)，所提方法以受控量子計數器實現精確覆蓋問題的神諭(oracle)，計算宇集內的元素被集合收集(collection of sets)覆蓋的次數，及使用相位回擊(phase kickback)之機制反轉給定問題中可行解的相位，並藉由擴散器(diffuser)放大可行解的機率振幅。最後，以 IBM 公司提供的量子模擬器 ibmq_qasm_simulator 及量子電腦 ibmq_kolkata 執行量子線路並進行測量以得到問題解答，並與現存解決精確覆蓋的古典演算法進行比較。本文所提出之用於解決精確覆蓋問題之量子線路與古典電腦中的窮舉搜索法相比具有平方量級的加速，意即，古典電腦需以O(2^|S|)的時間複雜度計算，而所提出方法的量子線路僅需O(sqrt(2^|S|)) 即可解決相同的問題，其中 |S| 為精確覆蓋中集合收集 S 的大小。 | zh_TW |
| dc.description.abstract | In recent years, quantum computing has gained widespread attention and research in both the academic and industrial sectors. Academic research has driven the development of theories and technologies, while industrial involvement has accelerated the practical applications and commercialization of quantum computing. Big Tech such as IBM, Google, and Microsoft have invested significant resources and manpower into quantum computing research and development. They have introduced their own quantum computing platforms or packages and made them available to research institutions and developers to promote the application and validation of quantum computing technology.This article focuses on solving the Exact Cover problem using Grover′s algorithm on the quantum computer and quantum simulator provided by IBM. The approach utilizes the IBM Qiskit package to construct a quantum circuit. The proposed method employs a controlled quantum counter as an implicit oracle to calculate the number of times elements in a universal set are covered by a collection of sets. It utilizes the mechanism of phase kickback to flip the phase of feasible solutions in the given problem and amplifies the phase amplitudes of feasible solutions through a diffuser. Finally, measurements are performed using IBM′s quantum simulator, ibmq_qasm_simulator, and quantum computer, ibmq_kolkata, and compared with existing classical algorithms for Exact Cover.The quantum circuit proposed in this article for solving the Exact Cover problem is compared to the exhaustive search method in classical computers and demonstrates a quadratic speedup. In other words, while classical computers require a time complexity of O(2^|S|) for solving Exact Cover problem, the proposed method can solve the same problem in just O(sqrt(2^|S|)) time, where |S| represents the size of the collection of sets S in the Exact Cover problem. | en_US |
| DC.subject | 量子計算 | zh_TW |
| DC.subject | 量子線路 | zh_TW |
| DC.subject | 精確覆蓋 | zh_TW |
| DC.subject | 格羅弗演算法 | zh_TW |
| DC.subject | 量子計數 | zh_TW |
| DC.subject | 量子模擬器 | zh_TW |
| DC.subject | 量子電腦 | zh_TW |
| DC.subject | Quantum computing | en_US |
| DC.subject | Quantum circuit | en_US |
| DC.subject | Exact Cover | en_US |
| DC.subject | Grover’s algorithm | en_US |
| DC.subject | Quantum counting | en_US |
| DC.subject | Quantum simulator | en_US |
| DC.subject | Quantum computer | en_US |
| DC.title | 以基於格羅弗演算法的量子線路解決精確覆蓋問題 | zh_TW |
| dc.language.iso | zh-TW | zh-TW |
| DC.title | Quantum Circuit Based on Grover′s Algorithm to Solve Exact Cover Problem | en_US |
| DC.type | 博碩士論文 | zh_TW |
| DC.type | thesis | en_US |
| DC.publisher | National Central University | en_US |