Quantum

Question 1

Answer 1

Question 2

Answer 2

Question 3

Explain the EPR paradox

Answer 3

Question 4

Write a super position over n qubits

Answer 4

Question 5

What are qunatum gates?

Answer 5

Unitarian matrices

Question 6

Define Unitarian matrix

Answer 6

Question 7

Answer 7

Question 8

Answer 8

Question 9

Write Not, Z, Cnot, C-U

Answer 9

Question 10

How can we apply H on the first cubit?

Answer 10

Question 11

What important property does quantum gates have?

Answer 11

Question 12

Answer 12

Question 13

Answer 13

Question 14

Describe how, by sending two classical bit and an EPR pair, we can teleportize a state.

Answer 14

Question 15

Answer 15

Question 16

Answer 16

Question 17

Answer 17

Question 18

Answer 18

Question 19

Describe deutch-Jozsa

Answer 19

Question 20

define Simon’s algorithm

Answer 20

Question 21

Describe Simon’s algorithm

Answer 21

Question 22

What is the conclusion?

Answer 22

Question 23

So, how can we find a

Answer 23

Question 24

Answer 24

Question 25

Why must be such r?

Answer 25

Question 26

what is the relation of the cyclic r to factorization`

Answer 26

Question 27

Prove

Answer 27

Question 28

Explain the chinese remainder theorem

Answer 28

Question 29

Answer 29

Question 30

Answer 30

Question 31

Describe the superposition given after applying QFT to a super position on m qubits.

Answer 31

Question 32

Answer 32

Question 33

How does it help us with the QFT?

Answer 33

Question 34

Describe the factorization algorithm

Answer 34

Question 35

define periodic, period and offset.

Answer 35

Question 36

?What does it tell us if the input vector is periodic?

Answer 36

Question 37

Answer 37

Question 38

What’s the problem with the period algorithm?

Answer 38

In step 4 we find the cyclic pattern which enables to use the method for finding the order k, and then to reach r.

Think is, r may not be a power of 2, and thus k won’t be an integer.

Question 39

Assume r divides M. what is the chance of hitting a good s, an arbitrary s, and what is the change of the gcd of all s’s we picked to be different than k.

Answer 39

hitting good s - 1 - certain

hitting specific s - 1/sqrt(k)

different than k gcd of all j’s for s tries - k/2^s

Question 40

What if r does not divide M?

Answer 40

Question 41

Answer 41