Experimental Realization of Shor’s Quantum Factoring Algorithm.ppt
立即下载
甲基蓝
2025-04-10
Quantum
Factoring
Computation
Stanford
bits
M.
Shor
quantum
量子
digits
6.1 MB
Experimental Realization of Shor’s Quantum Factoring Algorithm‡
‡Vandersypen L.M.K, et al, Nature, v.414, pp. 883 – 887 (2001)
M. Steffen1,2,3, L.M.K. Vandersypen1,2, G. Breyta1,
C.S. Yannoni1, M. Sherwood1, I.L.Chuang1,3
1 IBM Almaden Research Center, San Jose, CA 95120
2 Stanford University, Stanford, CA 94305
3 MIT Media Laboratory, Cambridge, MA 02139
© http://www.spectrum.ieee.org/WEBONLY/resource/mar02/nquant.html
©
Outline
Background
Introduction to Quantum Computation
Classical bits vs. Quantum bits
Quantum Algorithms
NMR Quantum Computation
Shor’s algorithm and Factoring 15
Shor’s Quantum circuit
Molecule
Results (spectra, innovations)
Conclusions
The quantum limit
1bit = 1 atom ?
Can we exploit quantum mechanics for ultra-fast computation?
The promise of Quantum Computation
Searching databases1
unsorted list of N entries
how many queries?
1 month
27 minutes
Factoring Integers2
N = pq
N has L digits
given N, what are p and q?
10 billion years
3 years
400 digits
Quantum/Factoring/Computation/Stanford/bits/M./Shor/quantum/量子/digits/
Quantum/Factoring/Computation/Stanford/bits/M./Shor/quantum/量子/digits/
