prime factorization - PowerPoint PPT Presentation

1 / 13
About This Presentation
Title:

prime factorization

Description:

Lieven Vandersypen, PhD thesis: http://arxiv.org/abs/quant-ph/0205193 ... Lieven Vandersypen, PhD thesis: http://arxiv.org/abs/quant-ph/0205193 |1 |1. y=3 ... – PowerPoint PPT presentation

Number of Views:47
Avg rating:3.0/5.0
Slides: 14
Provided by: cme19
Category:

less

Transcript and Presenter's Notes

Title: prime factorization


1
prime factorization
algorithm found by Peter Shor 1994
generalized to an algorithm for order finding
key step is the quantum Fourier transform (QFT)
2
discrete Fourier transform (DFT)
Lieven Vandersypen, PhD thesis
http//arxiv.org/abs/quant-ph/0205193
DFT
unitary transform that converts a string of N
complex numbers xj to a string of N complex
numbers yj
inverts periodicity (input string period r,
output string N/r)
1 0 0 0 1 0 0 0
1 0 1 0 1 0 1 0
converts off-sets into phase factors
0 1 0 0 0 1 0 0
1 0 -i 0 -1 0 i 0
3
quantum Fourier transform
Lieven Vandersypen, PhD thesis
http//arxiv.org/abs/quant-ph/0205193
number of qubits n log2 N (for N8, three
qubits)
amplitude of 000? represents first complex
number, 001? the 2nd
states 000?, 001?, ... , 111? are labelled
0?, 1? , ... , 7?
0 1 0 0 0 1 0 0
1 0 -i 0 -1 0 i 0
(1? 5?)v2
(0? - i2? - 4? i6?)/2
4
quantum Fourier transform
0.j1j2j3 j1/2 j2/4 j3/8
reverse order of output qubits j1in j3out,
j3in j1out
j3
j2j3
j1j2j3
j1
j2j1
j3j2j1
H
H
5
QFT quantum circuit
Weinstein et al. quant-ph/99060059v1 (1999)
H
H
H
R1

Rjk
6
QFT implementation
Weinstein et al. Phys. Rev. Lett. 86,1889 (2001)
7
Order finding
Lieven Vandersypen, PhD thesis
http//arxiv.org/abs/quant-ph/0205193
p1(5)4, p2(5)2,
0
6
y2,4,5
7
r3
y0,1,3,7
4
r4
y6
r1
5
2
3
1
8
Order finding quantum circuit
Lieven Vandersypen, PhD thesis
http//arxiv.org/abs/quant-ph/0205193
M4, y1y0? y?, y ? M-1
x? x2x1x0?, x4x22x1x0
y3
p1(3)1, p2(3)3,
QFT
y1?(0?1?2?3?4?5?6?7?)11?
y2?(0?2?4?6?)1?(1?3?5?7?)3?
y3?(0?4?)1?(0?-4?)3?
y0?000?11?
measurement yields multiple of 2n/r gt r2
9
Order finding for n qubits
Lieven Vandersypen, PhD thesis
http//arxiv.org/abs/quant-ph/0205193
1) 0?0?
(large for kcN/r)
10
Shors algorithm
L. Vandersypen et al. Nature 414, 883 (2001)
number to factorize N (e.g. N15)
integer a does NOT divide N (a2,4,7,8,11,13,14)
f(x,y)px(y)axy mod N
a2 mod 15 1, a ? 4,11,14
f(x) needs x0 only
f(x) needs x0 and x1
11
Implementation of Shors algorithm
12
Measurement
a11
x10
x20?1?
x00
gcd(112/2?1,15)3,5
x000?100?
0?4?
gtr2n/42
13
Pulse sequence
total 300 pulses
-x
x
Write a Comment
User Comments (0)
About PowerShow.com