Kvantové algoritmy Flashcards

1
Q

Sú kvantové komunikačné algoritmy bezpečné?

A

Áno, ako sme videli pri BB84

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Sú kvantové komunikačné algoritmy efektívne?

A

Nie vždy

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Ekvivalent koľko bitov vieme poslať cez n qbitov?

A

2n

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Čo je to monogamia previazania?

A

In quantum physics, the “monogamy” of quantum entanglement refers to the fundamental property that it cannot be freely shared between arbitrarily many parties.

In order for two qubits A and B to be maximally entangled, they must not be entangled with any third qubit C whatsoever. Even if A and B are not maximally entangled, the degree of entanglement between them constrains the degree to which either can be entangled with C

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Koľko bitov potrebujeme na poslanie 1qbitu bez kvantovej mechaniky?

A

2 bity

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Čo je to kvantová teleportácia?

A

TODO

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Na čo sú dobré kvantové algoritmy?

A

Na problémy, kde sa ťažko dostaneme k výsledku, ale ľahko ho overíme, napr. faktorizácia veľkých prvočísel

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Opíš unitárnu operáciu a na koľkých qbitoch musí pracovať

A

19 hore

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Aké operácie teda sú v knižnici kvantových algoritmov?

A

CNOT - kontrolovaný not
U - operácia na 2qbitoch
SWAP - vymení ich

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Čo robí CNOT?

A

00->00, 01->01, 10->11, 11->10

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Čo robí SWAP?

A

00->00, 01->10, 10->01, 11->11

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Ako vieme kresliť kvantové algoritmy?

A

19 dole

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Opíš, čo sa deje na strane 20

A

strana 20

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Čo robí Deutschov algoritmus?

A

https://en.wikipedia.org/wiki/Deutsch–Jozsa_algorithm

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Opíš algoritmus “Hľadanie telefónneho čísla v telefónnom zozname”

A

Pozri Groverov algoritmus
str. 21
https://neuro.bstu.by/ai/To-dom/My_research/Paper-0-again/For-research/Needle/2-Quantom-c/Searching%20A%20Quantum%20Phone%20Book.htm
youtube

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Čo sa deje na strane 22?

A

str. 22

17
Q

Opíš no cloning theorem

A

str. 23
https://en.wikipedia.org/wiki/No-cloning_theorem

18
Q

Opíš RSA, fungovanie a ako by sa to dalo riešiť (cracknúť)

A

str. 24

19
Q

Definuj Schorov algoritmus

A

str. 26
pozri aj youtube a tak