[理學(xué)]量子 計(jì)算研究進(jìn)展-文庫吧
2025-01-03 11:26 本頁面
【正文】 uantum search algorithm ? Implementations ? 1995 Monroe, Meekhof, King, Itano, Wineland: CNOT gate implemented in ion trap by NIST ? 1997 Gershenfeld, Chuang, Cory, Fahmy, Havel: NMR quantum puting ? 2022 Vandersypen et al. : Experimental realization of Shor’s algorithm ? 2022: Negrevergne et al. Benchmarking quantum control on a 12qubit system ? ……. 2022/2/13 21 量子比特 s Natural qubits: Spin 1/2 2022/2/13 22 量子態(tài)疊加原理 2022/2/13 23 可逆邏輯們 ? 可逆邏輯們 – 克服熱耗散問題 ? 封閉的量子系統(tǒng)按照哈密頓量做幺正演化，本身就是可逆操作。 Classical Gate In Out Gate In Out Quantum 2022/2/13 24 Classical vs. Quantum Classical bits ? transistors ? 0 or 1 Quantum bits ? quantum systems ? 0 or 1or inbetween NAND, NOT, AND … NAND, NOT, CNOT … Sqrt(NOT) … These quantum gates allow operations that are impossible on classical puters! 2022/2/13 25 量子信息特點(diǎn) ?高速計(jì)算 ?大容量信息 存儲(chǔ)、傳輸 ?保密通信 量子態(tài)疊加原理 量子糾纏性 量子態(tài)不可克隆定理 量子物理 原理支配下 的信息處理 1 0 Bit 0 or 1 in puter now 2022/2/13 26 大數(shù)質(zhì)因子分解 ? Problem: Given a lbit integer N=pxq， to find its nontrivial prime factors p and q？ N = ? x ? Bestknown classical Algorithms: in subexponential time! Shor’s algorithm: In polynomial time! The presumed difficulty of this problem is at the heart of certain algorithms in cryptography such as RSA. 2. , in Proc. 35th Annu. Symp. on the Foundations of Computer Science, (IEEE Computer Society Press, Los Alamitos, California, 1994), p. 124134. 1. . Nielsen and . Chuang, Quantum Computation and Quantum Information. Cambridge University Press, Cambridge, 2022. 2022/2/13 27 Time required: Classical vs. quantum days 42 days 19000 years Half a year Age of universe 2022/2/13 28 The promise of Quantum Computation Searching databases1 ? unsorted list of N entries ? how many queries? ? ?NO ? ?NO1 month 27 minutes Factoring Integers2
教學(xué)課件相關(guān)推薦
鄂ICP備17016276號(hào)-1