ATIL SAMANCIOGLU

QUANTUM COMPUTING
QUANTUM COMPUTING

Bit vs Qubit
COMPUTER SCIENCE

MACHINE LANGUAGE

ASSEMBLY

HIGH LEVEL LANGUAGE

COMPUTER SCIENCE

ADD (R2, R3, R4)

A = B + C;
DECIMAL

215 = 5 * 10 ^ 0 + 1 * 10 ^ 1 + 2 * 10 ^ 2

514
5 * 10 ^ 2 4 * 10 ^ 0

1 * 10 ^ 1
BINARY

1101101

1 * 2 ^ 6 + 1 * 2 ^ 5 + 0 * 2 ^ 4 + 1 * 2^ 3 +

1*2^2+0*2^1+1*2^0

64 + 32 + 0 + 8 + 4 + 0 + 1

109

HEXADECIMAL

0123456789A B C D E F
10 11 12 13 14 15
HEXADECIMAL

A4F6

10 * 16 ^ 3 + 4 * 16 ^ 2 + 15 * 16 ^ 1 + 6 * 16 ^ 0

40960 + 1024 + 240 + 6

42230
ASCII

Source: https://bournetocode.com/projects/GCSE_Computing_Fundamentals/pages/3-3-5-ascii.html
PIXEL

Source: https://towardsdatascience.com/steganography-hiding-an-image-inside-another-77ca66b2acb1?gi=6ec8b36cd70
BIT VS QUBIT

00000000
11111111
PREREQUISITES

|0>
v=d/t
python
PROBABILITY & BINARY

P(A)
P(A AND B)
P((A AND B) OR C )
PROBABILITY & BINARY

P(A AND B) = 0Mutually Exclusive

P(A AND B) = P(A) x P(B)

Independent
PROBABILITY & BINARY

P(A OR B) = P(A) + P(B)

Mutually Exclusive

P(A OR B) = P(A) + P(B) - P( A AND B)

Independent
PROBABILITY & BINARY

P(A) = 30%
P(B) = 40%
P(A OR B) = P(A) + P(B) - P( A AND B)
= 0.3 + 0.4 - (0.3 * 0.4)
= 0.58

STATISTICS

15, 22, 33, 40, 55, 61, 79

Mean -> 43.57~
Median -> 40
Min -> 15
Max -> 79

 STATISTICS

15, 22, 33, 40, 55, 61, 79

(15 - 43,57) 2
(22 - 43,57) 2
(33 - 43,57) 2 515.95 = 22.71
(40 - 43,57) 2
Standard
(55 - 43,57) 2 Variance
(61 - 43,57) 2 Deviation
(79 - 43,57) 2

 COMPLEX NUMBERS

i -> -1 (Imaginary number)

a + bi (Complex number)

-9 = 9 * -1
= 3i

 COMPLEX NUMBERS

i = (1+i)
2

 COMPLEX NUMBERS

(3+2i) + (5+4i) = (8+6i)

(3-2i) + (-5+4i) = (-2+2i)

(3+2i) - (5+4i) = (-2-2i)

5 * (3+2i) = (15+10i)

(3+2i) / 3 = (1 + 2i)
3

 COMPLEX NUMBERS
i * (3+2i) = (3i+i2) = (-1+3i)

(5 + 3i) * (3+2i)

COMPLEX NUMBERS
(3+2i) -> (3-2i)
Complex Conjugate
(5-4i) -> (5+4i)

|3+2i|2 -> 32 + 22

Squared Magnitude

 COMPLEX NUMBERS

Complex No * Complex Conjugate =

Squared Magnitude

(3+2i) * (3-2i)

COMPLEX NUMBERS

(6+4i) (6+4i) (3-2i)

= *
(3+2i) (3+2i) (3-2i)

(6+4i) * (3-2i)
=
(32+22)
(18 -12i + 12i - 8i2)
=
13
= 2
MATRIX

[ ] 0
3
2
1 [ ] 0 2 3
3 1 4

[ ]
0 2 3
3 1 4
9 8 0
[ 1
3 - 4i
2 + 3i
2 ]

MATRIX

2*2 2*2 2*2

[ ] [ ] [ ]
0
3
2
1
+
2 4
5 3
=
2 6
8 4

[ 1+2i
3
2
2 - 5i ][ ] [
+
2 4
5 3
=
3+2i
8
6
5-5i ]

MATRIX

2*2 2*2 2*2

[ ] [ ] [ ]
0
3
2
1
-
2 4
5 3
=
-2 -2
-2 -2

[ 1+2i
3
2
2 - 5i ][ ] [
-
2 4
5 3
=
-1+2i
-2
-2
-1-5i ]

 MATRIX

2*2 2*2

4 *
[ ] [ ]
2 4
5 3
=
8 16
20 12

2*1 2*1

(1+2i) *
[] [ ]
2
5
=
2 + 4i
5 + 10i

MATRIX

2*2 2*2 2*2

[ ] [ ] [ ]
0
3
2
1
*
2 4
5 3
=
10 6
11 15

0 * 2 + 2 * 5 = 10
0*4+2*3=6
3 * 2 + 1 * 5 = 11
3 * 4 + 1 * 3 = 15

MATRIX

[ ] [ ]
0 2 3 1 -3 4

*
3 1 4 0 -1 2
9 8 0 3 1 0

[ ]
9 1 4

= 15 -6
9
14
-35 52

MATRIX
3*2

[]
2*2
0 2
3 1
9 8
* [ ]
2 4
5 3

3*2

[ ]
10 6

= 11
58
15
60

 MATRIX
3*2

[]
2*1

[]
0 2
2
3 1
* 5
9 8

[]
3*1
10

= 11
58

 MATRIX
3*2

[]
2*1

[]
0 2
2
3 1
5
9 8

X * Y != Y * X

(X+Y) * (Q+Z) = XQ + XZ + YQ + YZ

 MATRIX

[]
xz

[] []
x
y
x
z
q
=
xq

yz

yq

[]
Tensor Product
2

[]
5
2

[]
1 7

x 5 = 6
3 15
7
21

MATRIX

[ ] [ ] [ ]
0
3
2
1
*
1 0
0 1
=
0
3
2
1

Identity Matrix (I)

XI = X

[ ]
1 0 0
0 1 0
0 0 1

MATRIX

Inverse (Real Number)

1 1 1
A-1 = 5-1 = 10-1 =
A 5 10

Inverse (Matrix)

AA-1 = I
A-1A = I
MATRIX

X X-1 I

[ ] [
0
3
2
1
*
-1/6
1/2 0][ ]
1/3
=
1
0
0
1

Matrix Inverse

MATRIX
T

[ ] [ ]
0
3
2
1
=
0
2
3
1

Transpose

[ ][ ]
T
0 1 2 0 3 6

3 4 5 = 1 4 7

6 7 8 2 5 8

MATRIX

(XY)T = YT XT

[ ] [ ] [ ]
0
3
2
1
*
2 4
5 3
=
10 6
11 15

MATRIX
*

[ 2+5i
3 3-4i
i
] [ =
2-5i
3 ]
-i
3+4i

Complex Conjugate

] [ ]
+

[ 2+5i i 2-5i 3
=
3 3-4i -i 3+4i

Adjoint (Transpose - Complex Conjugate)

X+ = (X*)T = (XT)*

MATRIX
if
X+ = X-1
Unitary Matrix

XX+ = XX-1 = I

[ ][ ]
1 1 1 1

2
2

-1

2
*
2

2
2

-1

2
=
[ ]
1
0
0
1

Reversible Operation

MATRIX
if

X+ = X
Hermitian Matrix

[ ] [ ]
+
3 2+i 3 2+i
=
2-i 5 2-i 5

Irreversible Operation

 MATRIX

[] 0
1

[] []
-4 0
3+i 3
-5i 6

Vector = Column Matrix (Quantum Computing)

MATRIX

*(x1,y1) x2 = Ax1+By1
y2 = Cx1+Dy1
*(x2,y2)

[] [ ] []
x2
y2
=
A B
C D
*
x1
y1

Linear Transformation

 MATRIX

x2 = Ax1+By1
*(0.7,0.7) y2 = Cx1+Dy1
45
0

45
0

*(1,0)

[] [0.7
0.7
=
cos(45)
+sin(45)
-sin(45)
cos(45) ] []
*
1
0

Rotation

 DOUBLE SLIT / YOUNG

By !Original: NekoJaNekoJaVector: Johannes Kalliauer - File:Double-slit.PNG, CC BY-SA 4.0, https://commons.wikimedia.org/w/index.php?curid=61496401

 DOUBLE SLIT / YOUNG

Collapse of the Wave Function

By Lookang many thanks to Fu-Kwun Hwang and author of Easy Java Simulation = Francisco Esquembre - Own work, CC BY-SA 3.0, https://
commons.wikimedia.org/w/index.php?curid=17014507
ENTANGLEMENT

n,l,ml,ms Principal
Orbital Angular Momentum
Magnetic
Electron Spin
ENTANGLEMENT

Spin Up Spin Down

Superposition
 QUBIT

[] 1
0 [] 0
1

Spin Down Spin Up

Qubit Down State Qubit Up State

Classical Bit 0 Classical Bit 1

 QUBIT

[]
1 P(Spin Down) = 1

0 P(Spin Up) = 0

[]
p = a + bi
p
|p|2 = a2 + b2
q
|p|2 + |q|2 = 1

SPIN

[]
1 1 1
P(Spin Down) = =
2 2 2
1
1 2
1 1
2 P(Spin Up) = =
2 2
Vector in
Superposition

SPIN

P(Spin Down) = 0
P(Spin Up) = 1

P(Spin Down) = 0.2

P(Spin Up) = 0.8
SPIN

P(Spin Down) = 0.5

P(Spin Up) = 0.5

P(Spin Down) = 0
P(Spin Up) = 1
 SPIN

P(Spin Down) = 0
P(Spin Up) = 1

A=
[] []
0
1
E=
0
1

Inner Product
A+ * E

 SPIN

A=
[] []0
1
E=
0
1

A+ * E

[ 0 1 ] *
[] 0
1
= 1

12 = 1

 BRA-KET

A=
[] []
0
1
E=
0
1

<A|E> <A| * |E>

Bra Ket A+ E

|1>
[] 0
1
|0>
[] 1
0

 BRA-KET

[] [] []
1

2 1 1 1 0
= +
1 2 0 2 1
2

1
= ( |0> + |1>)
2

 MULTI QUBIT

[][][][]
00 1 0 0 0

01 0 1 0 0

10 0 0 1 0

11 0 0 0 1

|00> |01> |10> |11>

|0> x |0> |0> x |1> |1> x |0> |1> x |1>

 []
MULTI QUBIT
1

0
1

1
( |00> + |11> )
2

Superposition + Entanglement
 CLASSICAL GATES

Buffer A Q
0 0
1 1

NOT A Q
0 1
1 0

By Inductiveload - Own work, Public Domain, https://commons.wikimedia.org/w/index.php?curid=5729014

By Inductiveload - Own work, Public Domain, https://commons.wikimedia.org/w/index.php?curid=5729018
 CLASSICAL GATES

A B Q
AND 0 0 0
0 1 0
1 0 0
1 1 1

By Inductiveload - Own work, Public Domain, https://commons.wikimedia.org/w/index.php?curid=5729013

 CLASSICAL GATES

A B Q
OR 0 0 0
0 1 1
1 0 1
1 1 1

By Inductiveload - Own work, Public Domain, https://commons.wikimedia.org/w/index.php?curid=5729019

 CLASSICAL GATES

A B Q
NAND 0 0 1
0 1 1
1 0 1
1 1 0

By Inductiveload - Own work, Public Domain, https://commons.wikimedia.org/w/index.php?curid=5729019

 CLASSICAL GATES

A B Q
NOR 0 0 1
0 1 0
1 0 0
1 1 0

By Inductiveload - Own work, Public Domain, https://commons.wikimedia.org/w/index.php?curid=5729017

 CLASSICAL GATES

A B Q
XOR 0 0 0
0 1 1
1 0 1
1 1 0

By Inductiveload - Own work, Public Domain, https://commons.wikimedia.org/w/index.php?curid=5729022

 CLASSICAL GATES

A B Q
XNOR 0 0 1
0 1 0
1 0 0
1 1 1

By Inductiveload - Own work, Public Domain, https://commons.wikimedia.org/w/index.php?curid=5729020

 QUANTUM GATES

[ ]
X (NOT)
0 1
1 0

X|1> =
[ ][ ] [ ]
0 1
1 0
0
1
=
1
0
= |0>

X|0> =
[ ][ ] [ ]
0 1
1 0
1
0
=
0
1
= |1>

QUANTUM GATES

Y (Pauli Y)
[ ]
0 -i
i 0

Z (Pauli Z)
[ ]
1
0
0
-1

QUANTUM GATES

H (Hadamard)
1

2 [ ] 1
1
1
-1

1
H | 0> ( |0> + |1>)
2

1
H | 1> ( |0> - |1>)
2

QUANTUM GATES

[]
1 0 0 0
0 0 0 1
CNOT
0 0 1 0
0 1 0 0

q1

q1 XOR q2
q2

 []
QUANTUM GATES

1 0 0 0
0 1 0 0
CNOT
0 0 0 1
0 0 1 0
Alternative

q1

q1 XOR q2
q2

 QUANTUM GATES
CNOT | 00> = |00>
CNOT | 01> = |11>
CNOT | 10> = |10>
CNOT | 11> = |01>

[ ] [] []
1 0 0 0 0 0
0 0 0 1 1 0
* =
0 0 1 0 0 0
0 1 0 0 0 1

 QUANTUM GATES
Hadamard & CNOT
q1 H

q1 XOR q2
q2

[]
1

2 [ ] []
1
1
1
-1
*
1
0
=
2

 QUANTUM GATES
Hadamard & CNOT
q1 H

[]
q1 XOR q2
q2

[]
1
1 2

[] 1
0
x
2

2
= 1

0
|0> x |+> = |0+>
0

 QUANTUM GATES
Hadamard & CNOT
q1 H

[ ][] []
q1 XOR q2
q2
1 1
1 0 0 0 2 2

0 0 0 1 1 0
2
=
0 0 1 0 0
0 1
0 1 0 0
0 2

 Z GATE
Z |0> = |0> 1 1
Z |00>+|11> = |00>-|11>

[ ] [] []
Z |1> = -|1> 2 2

1 1
1 0 0 0
2 2
0 1 0 0 0 0
* =
0 0 1 0 0 0
1
0 0 0 -1 1 -
2
2

SUPERDENSE CODING

ALICE

00 : I |00> + |11>
10 : X |10> + |01>
01 : Z |00> - |11>
11 : XZ |10> - |01>

q0 H H
EVE
q1

1 BOB
|00>+|01> |00>
|00>+|11>
|10>+|11> |10>
2
|00>-|01> |01>
|10>-|11> |11>
QUANTUM TELEPORTATION

|ψ>=α|0>+β|1> ALICE
q0 TOTAL QUANTUM STATE
1
|ψ>=α|0>+β|1> x |00>+|11>
2

q1
=
H

q2
1 [α|000>+α|011> +
1 β|100> + β|111> ]
|00>+|11> BOB 2
2
QUANTUM TELEPORTATION

|ψ>=α|0>+β|1> ALICE
q0
TOTAL QUANTUM STATE

1 [α|000>+α|011> +
β|100> + β|111> ]
2
q1 H

q2
1 [α|000>+α|011> +
1 β|101> + β|110> ]
|00>+|11> BOB 2
2
QUANTUM TELEPORTATION

|ψ>=α|0>+β|1> ALICE
q0 H TOTAL QUANTUM STATE

1 [α|000>+α|011> +
β|101> + β|110> ]
2

q1 H

q2
[α|000>+α|011>
1 1
|00>+|11> BOB + α|100>+α|111>
2 2 + β|001> + β|010>
- β|101> - β|110> ]
QUANTUM TELEPORTATION

|ψ>=α|0>+β|1> ALICE
q0 H MEASUREMENT

1 [α|000>+α|011>
+ α|100>+α|111>
2
+ β|001> + β|010>
q1 H - β|101> - β|110> ]
q2

1
|00>+|11> BOB Q0,Q1 00 01 10 11
2
Q2 α|0>+β|1> α|1>+β|0> α|0>-β|1> α|1>-β|0>
QUANTUM TELEPORTATION

|ψ>=α|0>+β|1> ALICE
q0 H MEASUREMENT

1 [α|000>+α|011>
+ α|100>+α|111>
2
+ β|001> + β|010>
q1 H - β|101> - β|110> ]
q2

1
|00>+|11> BOB Q0,Q1 00 01 10 11
2
Q2 α|0>+β|1> α|1>+β|0> α|0>-β|1> α|1>-β|0>

I X Z XZ
QUANTUM TELEPORTATION

|ψ>=α|0>+β|1> ALICE
q0 H

q1 H

q2 |Ψ>
1
|00>+|11> BOB
2
BERNSTEIN - VAZIRANI ALGORITHM

1011001
AND
0000001
1

1011001
AND
0000010
0

N BITS
DEUTSCH ALGORITHM

f(0) f(1)

1 0 0 Constant

2 0 1 Balanced

3 1 0 Balanced

4 1 1 Constant

f : {0,1} -> {0,1}

f(0) = f(1) Constant
DEUTSCH ALGORITHM

Input Register |x> |x>

Uf
Output Register |y> |y + f(x)>

Uf Uf
|x> |y> > |x> |y + f(x)> > |x> |y + f(x)> + f(x)>
|x> |y + 0>
|x> |y>
DEUTSCH ALGORITHM
|+> |x> H |x>
Uf
|0> |y> |y + f(x)>

1
Uf (|+> x |0>) > Uf (|0>+|1>) x |0>)
2

1 1
= Uf |0> x |0>) + Uf |1> x |0>)
2 2

1 1
= |0> f(0) + |0> + |1> f(1) + |0>
2 2
|0> f(0) |1> f(1)
DEUTSCH ALGORITHM
Ψ2

|+> |x> H H |x>

Uf
|-> |y> X H |y + f(x)>
Ψ1 Ψ3
|+> |->
1
= (|0>+|1>) x (|0>-|1>)
2
Ψ1
1
= (|00> - |01> + |10> - |11> )
2
1
-> (|0> |0 + f(0)> - |0 |1 + f(0)> + |1> |0 + f(1)> - |1> |1 + f(1) >)
2
1
Ψ2 = (|0> |f(0)> - |0 |1 + f(0)> + |1> | f(1)> - |1> |1 + f(1) >)
2
DEUTSCH ALGORITHM
Ψ2

|+> |x> H H |x>

Uf
|-> |y> X H |y + f(x)>
Ψ1 Ψ3
1
Ψ2 = (|0> |f(0)> - |0 |1 + f(0)> + |1> | f(1)> - |1> |1 + f(1) >)
2

-> IF F(0) = F(1) (CONSTANT)

1
= (|0> |f(0)> - |0 |1 + f(0)> + |1> | f(0)> - |1> |1 + f(0) >)
2
1
= ((|0>+|1>) |f(0)>) + (-|0>-|1>) |1+ f(0)>
2
= 1 (|0>+|1>) (|f(0)>- |1 + f(0)>
2
DEUTSCH ALGORITHM
Ψ2

|+> |x> H H |x>

Uf
|-> |y> X H |y + f(x)>
Ψ1 Ψ3

Ψ2 = 1 (|0>+|1>) (|f(0)>- |1 + f(0)>

2
1
= (|+>) (|f(0)>- |1+ f(0)>
2

Ψ3 H (|+>) = |0>
DEUTSCH ALGORITHM
Ψ2

|+> |x> H H |x>

Uf
|-> |y> X H |y + f(x)>
Ψ1 Ψ3
1
Ψ2 = (|0> |f(0)> - |0 |1 + f(0)> + |1> | f(1)> - |1> |1 + f(1) >)
2

-> IF F(0) != F(1) (BALANCED) F(0) = F(1) XOR 1

1
= (|0> |f(0)> - |0> |f(1)> + |1> | f(1)> - |1> |f(0) >)
2
1
= (|0> x (|f(0)> - |f(1)>) - |1> x ( |f(0)> - |f(1)>)
2
1
= (|0>- |1>) x ( |f(0)> - |f(1)>)
2
DEUTSCH ALGORITHM
Ψ2

|+> |x> H H |x>

Uf
|-> |y> X H |y + f(x)>
Ψ1 Ψ3
1
Ψ2 = (|0>- |1>) x ( |f(0)> - |f(1)>)
2
1
= (|->) x ( |f(0)> - |f(1)>)
2

Ψ3 H (|->) = |1>
 [] []
GROVERS ALGORITHM
0 1

|W>
0 1 1
|W’>
3
0 1
|W> |S3>

[] []
1 0 |S1>

1 1 |W’>

|S1> 1 1 |S2> 1 1 |S2>

2 2
1 1
1 -1

DINNER PARTY

JAMES AND LARS

OR

KIRK AND ROB

AND NOT

LARS AND ROB

DINNER PARTY
SHOR’S ALGORITHM
PRIME FACTORS
N = 60 = 22 * 3 * 5 n = len(N)
N=P*Q O(2n)

MODULAR ARITHMETIC 3 = 26 (mod 23)

20 = 43 (mod 23)
1 = 24 (mod 23)
22 = -1 (mod 23)

46 + 18 (mod 23) 46 * 18 (mod 23)

= 0 + 18 (mod 23) = 0 * 18 (mod 23)

SHOR’S ALGORITHM
GCD
gcd(15,21) = 3

3*5 3*7

FIND PRIME FACTORS OF 21 N = 21

x2 = 1 (mod 21)

x ? 1, -1, 8, -8, 13, 20, -20

82 - 12 = 0 (mod 21)

(8 - 1) * (8 + 1)
SHOR’S ALGORITHM
(8 - 1) * (8 + 1)

gcd (21,8+1) = 3

gcd (21,8-1) = 7

GENERAL RULE

x != +- 1 (mod N)

x2 = 1 (mod N)

gcd (N, x+1)

SHOR’S ALGORITHM
N = 21 21 = 2 (mod 21)
x = 2 (random #)
22 = 4 (mod 21)

23 = 8 (mod 21)
x6 = (x3)2 = 1 ( mod 21 ) 24 = 16 (mod 21)

50% PROBABILITY 25 = 11 (mod 21)

26 = 1 (mod 21)

27 = 2 (mod 21)

28 = 4 (mod 21)

SHOR’S ALGORITHM
Quantum Fourier Transform (QFT)

Modular Exponentiation - Quantum Phase Estimation

QUANTUM FOURIER TRANSFORM: Computational Basis -> Fourier Basis

1 QUBIT {|0>, |1>} {|+>, |->}

|0> |1>

|+> |->
 SHOR’S ALGORITHM
QUANTUM FOURIER TRANSFORM: Computational Basis -> Fourier Basis
2 QUBIT {|00>, |10>, |01>, |11>}

N-1
1 2*pi*i*x*y
~
QFT |x> = |x> = e |y>
N
N
y=0

pi*i
Note: e = -1

N = 2n
n = # Qubits

https://www.youtube.com/watch?v=v0YEaeIClKY
SHOR’S ALGORITHM
N-1
1 2*pi*i*x*y
~ =
QFT |x> = |x> e |y>
N
N
y=0

QUANTUM FOURIER TRANSFORM: N = 21

1 QUBIT
2 -1
1 2*pi*i*x*y
= e 2 |y>
2
y=0

2*pi*i*x*0 2*pi*i*x*1
1 1
= e 2 |0> + e 2 |1>
2 2
SHOR’S ALGORITHM
2*pi*i*x*0 2*pi*i*x*1
1 1
= e 2 |0> + e 2 |1>
2 2

1 1 pi*i*x
= |0> + e |1>
2 2

if ( x = 0): if ( x = 1):

1 1
|0> + |1> |0> - |1>
2 2

|+> |->
SHOR’S ALGORITHM
N-1
1 2*pi*i*x*y
~ = N = 2n
QFT |x> = |x> e N |y>
N
y=0

y = [y1, y2, y3, …, yn]

|0>, |1>, |2>,|3> ?

|2> = |10>

= 2n-1 * y1 + 2n-2 * y2 + …. + 20 * yn

n
n-k
y= yk 2
k=0
SHOR’S ALGORITHM
N-1
1 2*pi*i*x*y
~ = N = 2n
QFT |x> = |x> e N |y>
N
y=0

n
n-k
y= yk 2
k=0
n
N-1 yk
~ = 1 2*pi*i*x*
QFT |x> = |x> e 2 k
|y1, y2, y3, …, yn>
N k=0
y=0
N-1 n
1 2*pi*i*x*yk
= e |y1, y2, y3, …, yn>
2k
N
y=0k=1
SHOR’S ALGORITHM
N-1 n
1 2*pi*i*x*yk
= e |y1, y2, y3, …, yn>
2k
N
y=0k=1

2*pi*i*x 2*pi*i*x
1
= ( |0>+ e 21 |1>) x ( |0>+ e 22 |1>) x
N
2*pi*i*x 2*pi*i*x

[ ]
( |0>+e 23 |1>) x ……… x ( |0>+e 2n |1>)

1 0
2*pi*i
0 e
2k
SHOR’S ALGORITHM
x1 H UROT UROT UROT UROT

x2 H UROT UROT UROT

x3
.
.
.
xn

= |x1x2x3x4x5x6….xn>
2*pi*i*x1
= ( |0>+ e 2 |1>) x |x2x3x4x5x6….xn>
2*pi*i*x2 2*pi*i*x1
= ( |0>+ e 22 e 21 |1>) x |x2x3x4x5x6….xn>
2*pi*i*x3 2*pi*i*x2 2*pi*i*x1
= ( |0>+ e 23 e 22 e 21 |1>) x |x2x3x4x5x6….xn>
{

Reverse Order
SHOR’S ALGORITHM
QUANTUM PHASE ESTIMATION:

iϴ
U |ψ> = e |ψ>

1 P(1) = 50%
(|0>+ |1>)
2 P(0) = 50%
2
1
|e |
i * pi i * pi
1 P(1) = 2 * = 50%
2
e (|0>+ |1>) 2
2 P(0) = 50%
SHOR’S ALGORITHM
QUANTUM PHASE ESTIMATION:
|0> |ψ>
|0> H H
1 1
(|0>+|1>) |ψ> = (|0> |ψ>)+(|1> |ψ>)
2 2
|ψ> CU

1 iϴ
(|0> |ψ>)+(|1> e |ψ>)
2

1 iϴ
(|0>+|1>) |ψ>)+e (|0> - |1>) |ψ>)
2
2 2
iϴ iϴ
1 [|0>( 1+e ) + |1>( 1- e ) ] |ψ>
=
2
SHOR’S ALGORITHM
QUANTUM PHASE ESTIMATION:

|0> iϴ iϴ
1
H H

[|0>( 1+e ) + |1>( 1- e ) ] |ψ>

2
|ψ> CU 2
1
P(1) = | 1-e iϴ
*
2
|
2
1
P(0) = | 1+e iϴ
*
2
|

ϴ=1 P(0) = 0.9999..

ϴ = 10 P(0) = 0.9924..
SHOR’S ALGORITHM
QUANTUM PHASE ESTIMATION: *n
|0> |ψ>
n
|0> *n
H
1 (|0> +|1>) |ψ>
|0>
.
. 2

n
iϴ 2n-1 iϴ 2n-2
|ψ> U 2N-1 U 2N-2 U 2N-3
1 (|0> + e |1>) x (|0> + e |1>)
2 iϴ 20
x ……… x (|0> + e |1>)

|2nϴ>
|0>
|0>
H QFT+
. ϴ * 2pi
. QFT VS QPE:
n
2
|ψ> U 2N-1 U 2N-2 U 2N-3
SHOR’S ALGORITHM
0 1 2 3 4 5
|0> H

|0> H N = pq
|x> QFT+
|0> H
|0> H N = 15
Ufa,N
|0> 15 = [1111]
|w> |0>
|0> fa,N (x) = ax mod(N)
|0>

|x> |w> -> |x> |w + fa,N (x)>

*4 *4
0 |0> |0>
1 *4
1 [ |0000> + |0001> + …… + |1111>] |0>
4
0 1
1 [ |0000> |0 + (13 mod15)> + |0001> |0 + (13 mod15)> + …
2
4
….. ]

SHOR’S ALGORITHM
0 1
1 [ |0000> |0 + (13 mod15)> + |0001> |0 + (13 mod15)> + …
2
4
….. ]

1 0 1
[ |0000> |(13 mod15)> + |0001> |(13 mod15)> + … ]
4
|x> |w>

[ ]
|0> |1> + |1> |13> + |2>|4> + |3>|7> +

1 |4> |1> + |5> |13> + |6>|4> + |7>|7> +

4 |8> |1> + |9> |13> + |10>|4> + |11>|7> +

|12> |1> + |13> |13> + |14>|4> + |15>|7>

if measure (|w>) = 7:
3
1
x= [|3> + |7> + |11> + |15>]
4

SHOR’S ALGORITHM
1
3 |x> |w> = [|3> + |7> + |11> + |15>] x |7>
2

N-1
1 2*pi*i*x*y
~
QFT |x> = |x> = e |y>
4 N
N
y=0

N-1
+~ 1 -2*pi*i*x*y
QFT |x> = |x> = e N |y>
N
y=0
15
1 -2*pi*i*3*y
QFT |3> = e 16 |y>
16
y=0
SHOR’S ALGORITHM
15
+ 1 -3*pi/8 * y -7*pi/8 * y -11*pi/8 * y -15*pi/8 * y
4 QFT |x> = [e +e +e +e ] |y>
8
y=0

1
= [4 |0000> + 4i |0100> -4 |1000> -4i |1100>]
8
|0> |4> |8> |12>

5 Measure: 0, 4 , 8 , 12
r/2 4/2
x = 13 = 4 (mod 15)
x+1, x-1 gcd (x+1, N) = gcd (5,15) = 5
5 3 gcd (x-1, N) = gcd (3,15) = 3
SHOR’S ALGORITHM
fa,N (x) = ax mod(N)

x = [x1, x2, x3 ….. xn] = 2n-1x1 + 2n-2x2 + ….. + 20 xn

fa,N (x) = ax mod(N)

2n-1x1 + 2n-2x2 + ……+ 20 xn
=a mod(N)
2n-1x1 2n-2x2 2n0xn
= a a …… a

|0>
|0>
.
.

|ψ> A 2N-1 A 2N-2 A 2N-3

 QUANTUM HARDWARE
SUPERCONDUCTING QUBITS

By Jay M. Gambetta, Jerry M. Chow &amp; Matthias Steffen - https://www.nature.com/articles/s41534-016-0004-0, CC BY 4.0, https://commons.wikimedia.org/w/
index.php?curid=61462110
 QUANTUM HARDWARE
PHOTONIC QUANTUM COMPUTER

https://engineersforum.com.ng/2021/03/08/in-the-quest-to-hundreds-of-qubits-photons-may-have-quantum-advantage/
 QUANTUM HARDWARE
ION TRAPS

By National Institute of Standards and Technology - Quantum Computing; Ion Trapping, Public Domain, https://commons.wikimedia.org/w/index.php?curid=51195437
 QUANTUM HARDWARE
DWAVE

https://www.datacenterdynamics.com/en/news/d-wave-announces-2000-qubit-quantum-computer-sells- rst-unit/
fi