what do quantum computers do daniel j bernstein quantum
play

What do quantum computers do? Daniel J. Bernstein Quantum algorithm - PDF document

Dec 31, 2022 •169 likes •1.5k views

1 What do quantum computers do? Daniel J. Bernstein Quantum algorithm means an algorithm that a quantum computer can run. i.e. a sequence of instructions, where each instruction is in a quantum computers supported instruction set.

  1. 9 e.g.: Say 3 qubits have state (1 ; 1 ; 1 ; 1 ; 1 ; 1 ; 1 ; 1). Measurement produces 000 = 0 with probability 1 = 8; 001 = 1 with probability 1 = 8; 010 = 2 with probability 1 = 8; 011 = 3 with probability 1 = 8; 100 = 4 with probability 1 = 8; 101 = 5 with probability 1 = 8; 110 = 6 with probability 1 = 8; 111 = 7 with probability 1 = 8. “Quantum RNG.”

  2. 9 e.g.: Say 3 qubits have state (1 ; 1 ; 1 ; 1 ; 1 ; 1 ; 1 ; 1). Measurement produces 000 = 0 with probability 1 = 8; 001 = 1 with probability 1 = 8; 010 = 2 with probability 1 = 8; 011 = 3 with probability 1 = 8; 100 = 4 with probability 1 = 8; 101 = 5 with probability 1 = 8; 110 = 6 with probability 1 = 8; 111 = 7 with probability 1 = 8. “Quantum RNG.” Warning: Quantum RNGs sold today are measurably biased.

  3. 10 e.g.: Say 3 qubits have state (3 ; 1 ; 4 ; 1 ; 5 ; 9 ; 2 ; 6).

  4. 10 e.g.: Say 3 qubits have state (3 ; 1 ; 4 ; 1 ; 5 ; 9 ; 2 ; 6). Measurement produces 000 = 0 with probability 9 = 173; 001 = 1 with probability 1 = 173; 010 = 2 with probability 16 = 173; 011 = 3 with probability 1 = 173; 100 = 4 with probability 25 = 173; 101 = 5 with probability 81 = 173; 110 = 6 with probability 4 = 173; 111 = 7 with probability 36 = 173.

  5. 10 e.g.: Say 3 qubits have state (3 ; 1 ; 4 ; 1 ; 5 ; 9 ; 2 ; 6). Measurement produces 000 = 0 with probability 9 = 173; 001 = 1 with probability 1 = 173; 010 = 2 with probability 16 = 173; 011 = 3 with probability 1 = 173; 100 = 4 with probability 25 = 173; 101 = 5 with probability 81 = 173; 110 = 6 with probability 4 = 173; 111 = 7 with probability 36 = 173. 5 is most likely outcome.

  6. 11 e.g.: Say 3 qubits have state (0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0).

  7. 11 e.g.: Say 3 qubits have state (0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0). Measurement produces 000 = 0 with probability 0; 001 = 1 with probability 0; 010 = 2 with probability 0; 011 = 3 with probability 0; 100 = 4 with probability 0; 101 = 5 with probability 1; 110 = 6 with probability 0; 111 = 7 with probability 0.

  8. 11 e.g.: Say 3 qubits have state (0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0). Measurement produces 000 = 0 with probability 0; 001 = 1 with probability 0; 010 = 2 with probability 0; 011 = 3 with probability 0; 100 = 4 with probability 0; 101 = 5 with probability 1; 110 = 6 with probability 0; 111 = 7 with probability 0. 5 is guaranteed outcome.

  9. 12 NOT gates NOT 0 gate on 3 qubits: (3 ; 1 ; 4 ; 1 ; 5 ; 9 ; 2 ; 6) �→ (1 ; 3 ; 1 ; 4 ; 9 ; 5 ; 6 ; 2).

  10. 12 NOT gates NOT 0 gate on 3 qubits: (3 ; 1 ; 4 ; 1 ; 5 ; 9 ; 2 ; 6) �→ (1 ; 3 ; 1 ; 4 ; 9 ; 5 ; 6 ; 2). NOT 0 gate on 4 qubits: (3 ; 1 ; 4 ; 1 ; 5 ; 9 ; 2 ; 6 ; 5 ; 3 ; 5 ; 8 ; 9 ; 7 ; 9 ; 3) �→ (1 ; 3 ; 1 ; 4 ; 9 ; 5 ; 6 ; 2 ; 3 ; 5 ; 8 ; 5 ; 7 ; 9 ; 3 ; 9).

  11. 12 NOT gates NOT 0 gate on 3 qubits: (3 ; 1 ; 4 ; 1 ; 5 ; 9 ; 2 ; 6) �→ (1 ; 3 ; 1 ; 4 ; 9 ; 5 ; 6 ; 2). NOT 0 gate on 4 qubits: (3 ; 1 ; 4 ; 1 ; 5 ; 9 ; 2 ; 6 ; 5 ; 3 ; 5 ; 8 ; 9 ; 7 ; 9 ; 3) �→ (1 ; 3 ; 1 ; 4 ; 9 ; 5 ; 6 ; 2 ; 3 ; 5 ; 8 ; 5 ; 7 ; 9 ; 3 ; 9). NOT 1 gate on 3 qubits: (3 ; 1 ; 4 ; 1 ; 5 ; 9 ; 2 ; 6) �→ (4 ; 1 ; 3 ; 1 ; 2 ; 6 ; 5 ; 9).

  12. 12 NOT gates NOT 0 gate on 3 qubits: (3 ; 1 ; 4 ; 1 ; 5 ; 9 ; 2 ; 6) �→ (1 ; 3 ; 1 ; 4 ; 9 ; 5 ; 6 ; 2). NOT 0 gate on 4 qubits: (3 ; 1 ; 4 ; 1 ; 5 ; 9 ; 2 ; 6 ; 5 ; 3 ; 5 ; 8 ; 9 ; 7 ; 9 ; 3) �→ (1 ; 3 ; 1 ; 4 ; 9 ; 5 ; 6 ; 2 ; 3 ; 5 ; 8 ; 5 ; 7 ; 9 ; 3 ; 9). NOT 1 gate on 3 qubits: (3 ; 1 ; 4 ; 1 ; 5 ; 9 ; 2 ; 6) �→ (4 ; 1 ; 3 ; 1 ; 2 ; 6 ; 5 ; 9). NOT 2 gate on 3 qubits: (3 ; 1 ; 4 ; 1 ; 5 ; 9 ; 2 ; 6) �→ (5 ; 9 ; 2 ; 6 ; 3 ; 1 ; 4 ; 1).

  13. � � � � 13 state measurement (1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0) 000 � (0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0) 001 (0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0) 010 � (0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0) 011 (0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0) 100 � (0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0) 101 (0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0) 110 � (0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1) 111 Operation on quantum state: NOT 0 , swapping pairs. Operation after measurement: flipping bit 0 of result. Flip: output is not input.

  14. 14 Controlled-NOT (CNOT) gates e.g. C 1 NOT 0 : (3 ; 1 ; 4 ; 1 ; 5 ; 9 ; 2 ; 6) �→ (3 ; 1 ; 1 ; 4 ; 5 ; 9 ; 6 ; 2).

  15. 14 Controlled-NOT (CNOT) gates e.g. C 1 NOT 0 : (3 ; 1 ; 4 ; 1 ; 5 ; 9 ; 2 ; 6) �→ (3 ; 1 ; 1 ; 4 ; 5 ; 9 ; 6 ; 2). Operation after measurement: flipping bit 0 if bit 1 is set; i.e., ( q 2 ; q 1 ; q 0 ) �→ ( q 2 ; q 1 ; q 0 ⊕ q 1 ).

  16. 14 Controlled-NOT (CNOT) gates e.g. C 1 NOT 0 : (3 ; 1 ; 4 ; 1 ; 5 ; 9 ; 2 ; 6) �→ (3 ; 1 ; 1 ; 4 ; 5 ; 9 ; 6 ; 2). Operation after measurement: flipping bit 0 if bit 1 is set; i.e., ( q 2 ; q 1 ; q 0 ) �→ ( q 2 ; q 1 ; q 0 ⊕ q 1 ). e.g. C 2 NOT 0 : (3 ; 1 ; 4 ; 1 ; 5 ; 9 ; 2 ; 6) �→ (3 ; 1 ; 4 ; 1 ; 9 ; 5 ; 6 ; 2).

  17. 14 Controlled-NOT (CNOT) gates e.g. C 1 NOT 0 : (3 ; 1 ; 4 ; 1 ; 5 ; 9 ; 2 ; 6) �→ (3 ; 1 ; 1 ; 4 ; 5 ; 9 ; 6 ; 2). Operation after measurement: flipping bit 0 if bit 1 is set; i.e., ( q 2 ; q 1 ; q 0 ) �→ ( q 2 ; q 1 ; q 0 ⊕ q 1 ). e.g. C 2 NOT 0 : (3 ; 1 ; 4 ; 1 ; 5 ; 9 ; 2 ; 6) �→ (3 ; 1 ; 4 ; 1 ; 9 ; 5 ; 6 ; 2). e.g. C 0 NOT 2 : (3 ; 1 ; 4 ; 1 ; 5 ; 9 ; 2 ; 6) �→ (3 ; 9 ; 4 ; 6 ; 5 ; 1 ; 2 ; 1).

  18. 15 Toffoli gates Also known as CCNOT gates: controlled-controlled-NOT gates. e.g. C 2 C 1 NOT 0 : (3 ; 1 ; 4 ; 1 ; 5 ; 9 ; 2 ; 6) �→ (3 ; 1 ; 4 ; 1 ; 5 ; 9 ; 6 ; 2).

  19. 15 Toffoli gates Also known as CCNOT gates: controlled-controlled-NOT gates. e.g. C 2 C 1 NOT 0 : (3 ; 1 ; 4 ; 1 ; 5 ; 9 ; 2 ; 6) �→ (3 ; 1 ; 4 ; 1 ; 5 ; 9 ; 6 ; 2). Operation after measurement: ( q 2 ; q 1 ; q 0 ) �→ ( q 2 ; q 1 ; q 0 ⊕ q 1 q 2 ).

  20. 15 Toffoli gates Also known as CCNOT gates: controlled-controlled-NOT gates. e.g. C 2 C 1 NOT 0 : (3 ; 1 ; 4 ; 1 ; 5 ; 9 ; 2 ; 6) �→ (3 ; 1 ; 4 ; 1 ; 5 ; 9 ; 6 ; 2). Operation after measurement: ( q 2 ; q 1 ; q 0 ) �→ ( q 2 ; q 1 ; q 0 ⊕ q 1 q 2 ). e.g. C 0 C 1 NOT 2 : (3 ; 1 ; 4 ; 1 ; 5 ; 9 ; 2 ; 6) �→ (3 ; 1 ; 4 ; 6 ; 5 ; 9 ; 2 ; 1).

  21. 16 More shuffling Combine NOT, CNOT, Toffoli to build other permutations.

  22. 16 More shuffling Combine NOT, CNOT, Toffoli to build other permutations. e.g. series of gates to rotate 8 positions by distance 1: 3 1 4 1 ▲ 5 9 2 6 ▲ sssssssss ▲ ▲ ▲ ▲ C 0 C 1 NOT 2 ▲ ▲ ▲ 3 1 ✾ 4 6 5 9 ✾ 2 1 ✾ ✾ ✆ ✆ ✾ ✾ ✆ ✆ ✾ ✾ ✆ ✆ C 0 NOT 1 ✾ ✾ ✆ ✆ ✆ ✆ 3 ✱ 6 4 ✱ 1 5 ✱ 1 2 ✱ 9 ✱ ✱ ✱ ✱ ✒✒✒✒ ✒✒✒✒ ✒✒✒✒ ✒✒✒✒ ✱ ✱ ✱ ✱ NOT 0 ✱ ✱ ✱ ✱ 6 3 1 4 1 5 9 2

  23. 17 Hadamard gates Hadamard 0 : ( a; b ) �→ ( a + b; a − b ). 3 1 4 1 5 9 2 6 ✹ ✹ ✹ ✹ ✹ ✹ ✹ ✹ ✡✡✡✡ ✡✡✡✡ ✡✡✡✡ ✡✡✡✡ ✹ ✹ ✹ ✹ ✹ ✹ ✹ ✹ 14 − 4 − 4 4 2 5 3 8

  24. 17 Hadamard gates Hadamard 0 : ( a; b ) �→ ( a + b; a − b ). 3 1 4 1 5 9 2 6 ✹ ✹ ✹ ✹ ✹ ✹ ✹ ✹ ✡✡✡✡ ✡✡✡✡ ✡✡✡✡ ✡✡✡✡ ✹ ✹ ✹ ✹ ✹ ✹ ✹ ✹ 14 − 4 − 4 4 2 5 3 8 Hadamard 1 : ( a; b; c; d ) �→ ( a + c; b + d; a − c; b − d ). 3 ❋ 1 ❋ 4 1 5 ❋ 9 ❋ 2 6 ❋ ❋ ❋ ❋ ①①①①①①① ①①①①①①① ①①①①①①① ①①①①①①① ❋ ❋ ❋ ❋ ❋ ❋ ❋ ❋ ❋ ❋ ❋ ❋ ❋ ❋ ❋ ❋ ❋ ❋ ❋ ❋ − 1 7 2 0 7 15 3 3

  25. 18 Some Hadamard applications Hadamard 0 , NOT 0 , Hadamard 0 : 3 1 4 1 5 9 2 6 ✹ ✹ ✹ ✹ ✹ ✹ ✹ ✹ ✡✡✡✡ ✡✡✡✡ ✡✡✡✡ ✡✡✡✡ ✹ ✹ ✹ ✹ ✹ ✹ ✹ ✹ 4 2 5 3 14 ✹ − 4 8 ✹ − 4 ✹ ✹ ✹ ✹ ✹ ✹ ✡✡✡✡ ✡✡✡✡ ✡✡✡✡ ✡✡✡✡ ✹ ✹ ✹ ✹ ✹ ✹ ✹ ✹ 2 4 3 5 − 4 ✹ 14 − 4 8 ✹ ✹ ✹ ✹ ✹ ✡✡✡✡ ✡✡✡✡ ✡✡✡✡ ✡✡✡✡ ✹ ✹ ✹ ✹ ✹ ✹ ✹ ✹ ✹ ✹ 6 − 2 8 − 2 10 − 18 4 − 12

  26. 18 Some Hadamard applications Hadamard 0 , NOT 0 , Hadamard 0 : 3 1 4 1 5 9 2 6 ✹ ✹ ✹ ✹ ✹ ✹ ✹ ✹ ✡✡✡✡ ✡✡✡✡ ✡✡✡✡ ✡✡✡✡ ✹ ✹ ✹ ✹ ✹ ✹ ✹ ✹ 4 2 5 3 14 ✹ − 4 8 ✹ − 4 ✹ ✹ ✹ ✹ ✹ ✹ ✡✡✡✡ ✡✡✡✡ ✡✡✡✡ ✡✡✡✡ ✹ ✹ ✹ ✹ ✹ ✹ ✹ ✹ 2 4 3 5 − 4 ✹ 14 − 4 8 ✹ ✹ ✹ ✹ ✹ ✡✡✡✡ ✡✡✡✡ ✡✡✡✡ ✡✡✡✡ ✹ ✹ ✹ ✹ ✹ ✹ ✹ ✹ ✹ ✹ 6 − 2 8 − 2 10 − 18 4 − 12 “Multiply each amplitude by 2.” This is not physically observable.

  27. 18 Some Hadamard applications Hadamard 0 , NOT 0 , Hadamard 0 : 3 1 4 1 5 9 2 6 ✹ ✹ ✹ ✹ ✹ ✹ ✹ ✹ ✡✡✡✡ ✡✡✡✡ ✡✡✡✡ ✡✡✡✡ ✹ ✹ ✹ ✹ ✹ ✹ ✹ ✹ 4 2 5 3 14 ✹ − 4 8 ✹ − 4 ✹ ✹ ✹ ✹ ✹ ✹ ✡✡✡✡ ✡✡✡✡ ✡✡✡✡ ✡✡✡✡ ✹ ✹ ✹ ✹ ✹ ✹ ✹ ✹ 2 4 3 5 − 4 ✹ 14 − 4 8 ✹ ✹ ✹ ✹ ✹ ✡✡✡✡ ✡✡✡✡ ✡✡✡✡ ✡✡✡✡ ✹ ✹ ✹ ✹ ✹ ✹ ✹ ✹ ✹ ✹ 6 − 2 8 − 2 10 − 18 4 − 12 “Multiply each amplitude by 2.” This is not physically observable. “Negate amplitude if q 0 is set.” No effect on measuring now .

  28. 19 Fancier example: “Negate amplitude if q 0 q 1 is set.” Assumes q 2 = 0: “ancilla” qubit. 3 1 4 1 ▲ 0 0 0 0 ▲ sssssssss ▲ ▲ ▲ ▲ C 0 C 1 NOT 2 ▲ ▲ ▲ 3 ▲ 1 ▲ 4 ▲ 0 ▲ 0 0 0 1 ▲ ▲ ▲ ▲ sssssssss sssssssss sssssssss sssssssss ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ Hadamard 2 ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ 3 ▲ 1 ▲ 4 ▲ 1 ▲ 3 1 4 − 1 ▲ ▲ ▲ ▲ sssssssss sssssssss sssssssss ▲ ▲ ▲ ▲ sssssss ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ NOT 2 ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ 3 ▲ 1 ▲ 4 − 1 3 1 4 1 ▲ ▲ ▲ ▲ ▲ sssssssss sssssssss sssssssss sssssssss ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ Hadamard 2 ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ ▲ 6 2 8 0 ▲ 0 0 0 − 2 ▲ ▲ sssssss ▲ ▲ ▲ C 0 C 1 NOT 2 ▲ ▲ ▲ 6 2 8 − 2 0 0 0 0

  29. 20 Affects measurements: “Negate amplitude around its average.” (3 ; 1 ; 4 ; 1) �→ (1 : 5 ; 3 : 5 ; 0 : 5 ; 3 : 5).

  30. 20 Affects measurements: “Negate amplitude around its average.” (3 ; 1 ; 4 ; 1) �→ (1 : 5 ; 3 : 5 ; 0 : 5 ; 3 : 5). 3 1 4 1 0 0 0 0 ✷ ✷ ✷ ✷ ✷ ✷ ✷ ✷ ☞☞☞☞ ☞☞☞☞ ☞☞☞☞ ☞☞☞☞ ✷ ✷ ✷ ✷ H 0 ✷ ✷ ✷ ✷ 4 ❉ 2 ❉ 5 3 0 ❉ 0 ❉ 0 0 ❉ ❉ ❉ ❉ ③ ③ ③ ③ ❉ ❉ ❉ ❉ ③ ③ ③ ③ ❉ ❉ ❉ ❉ ③ ③ ③ ③ ❉ ❉ ❉ ❉ ③ ③ ③ ③ H 1 ❉ ❉ ❉ ❉ ③ ③ ③ ③ ❉ ❉ ③ ③ ③ ③ ③ ③ ③ ③ 9 5 − 1 − 1 0 0 0 0 : : : − 9 ✷ 5 − 1 ✷ − 1 0 0 0 0 ✷ ✷ ✷ ✷ ☞☞☞☞ ✷ ✷ ☞☞☞☞ ☞☞☞☞ ☞☞☞☞ ✷ ✷ ✷ ✷ H 0 ✷ ✷ ✷ ✷ − 4 − 14 − 2 0 0 ❉ 0 ❉ 0 0 ❉ ❉ ❉ ❉ ③ ③ ③ ❉ ❉ ③③③③③ ❉ ❉ ③ ③ ③ ❉ ❉ ❉ ❉ ③ ③ ③ ❉ ❉ ❉ ❉ ③ ③ ③ H 1 ❉ ❉ ❉ ❉ ③ ③ ③ ❉ ❉ ③ ③ ③ ③ ③ − 6 − 14 − 2 − 14 0 0 0 0

  31. 21 Simon’s algorithm Step 1. Set up pure zero state: 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 :

  32. 21 Simon’s algorithm Step 2. Hadamard 0 : 1 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 :

  33. 21 Simon’s algorithm Step 3. Hadamard 1 : 1 ; 1 ; 1 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 :

  34. 21 Simon’s algorithm Step 4. Hadamard 2 : 1 ; 1 ; 1 ; 1 ; 1 ; 1 ; 1 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 : Each column is a parallel universe.

  35. 21 Simon’s algorithm Step 5. C 0 NOT 3 : 1 ; 0 ; 1 ; 0 ; 1 ; 0 ; 1 ; 0 ; 0 ; 1 ; 0 ; 1 ; 0 ; 1 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 : Each column is a parallel universe performing its own computations.

  36. 21 Simon’s algorithm Step 5b. More shuffling: 1 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 : Each column is a parallel universe performing its own computations.

  37. 21 Simon’s algorithm Step 5c. More shuffling: 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 : Each column is a parallel universe performing its own computations.

  38. 21 Simon’s algorithm Step 5d. More shuffling: 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 : Each column is a parallel universe performing its own computations.

  39. 21 Simon’s algorithm Step 5e. More shuffling: 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 : Each column is a parallel universe performing its own computations.

  40. 21 Simon’s algorithm Step 5f. More shuffling: 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 1 ; 0 : Each column is a parallel universe performing its own computations.

  41. 21 Simon’s algorithm Step 5g. More shuffling: 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 1 : Each column is a parallel universe performing its own computations.

  42. 21 Simon’s algorithm Step 5h. More shuffling: 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 : Each column is a parallel universe performing its own computations.

  43. 21 Simon’s algorithm Step 5i. More shuffling: 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 : Each column is a parallel universe performing its own computations.

  44. 21 Simon’s algorithm Step 5j. Final shuffling: 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 1 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 : Each column is a parallel universe performing its own computations.

  45. 21 Simon’s algorithm Step 5j. Final shuffling: 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 1 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 ; 0 ; 0 ; 1 ; 0 ; 0 : Each column is a parallel universe performing its own computations. Surprise: u and u ⊕ 101 match.

  46. 21 Simon’s algorithm Step 6. Hadamard 0 : 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 1 ; 0 ; 0 ; 1 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 1 ; 0 ; 0 ; 1 ; 1 ; 1 ; 1 ; 0 ; 0 ; 1 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 1 ; 0 ; 0 ; 1 ; 1 ; 0 ; 0 : Notation: 1 means − 1.

  47. 21 Simon’s algorithm Step 7. Hadamard 1 : 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 1 ; 1 ; 1 ; 1 ; 1 ; 1 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 1 ; 1 ; 1 ; 1 ; 1 ; 1 ; 1 ; 1 ; 1 ; 1 ; 1 ; 1 ; 1 ; 1 ; 1 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ; 1 ; 1 ; 1 ; 1 ; 1 ; 1 ; 1 :

  48. 21 Simon’s algorithm Step 8. Hadamard 2 : 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 2 ; 0 ; 2 ; 0 ; 0 ; 2 ; 0 ; 2 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 2 ; 0 ; 2 ; 0 ; 0 ; 2 ; 0 ; 2 ; 2 ; 0 ; 2 ; 0 ; 0 ; 2 ; 0 ; 2 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 2 ; 0 ; 2 ; 0 ; 0 ; 2 ; 0 ; 2 :

  49. 21 Simon’s algorithm Step 8. Hadamard 2 : 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 2 ; 0 ; 2 ; 0 ; 0 ; 2 ; 0 ; 2 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 2 ; 0 ; 2 ; 0 ; 0 ; 2 ; 0 ; 2 ; 2 ; 0 ; 2 ; 0 ; 0 ; 2 ; 0 ; 2 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 2 ; 0 ; 2 ; 0 ; 0 ; 2 ; 0 ; 2 : Step 9: Measure. Obtain some information about the surprise: a random vector orthogonal to 101.

  50. 22 Repeat to figure out 101.

  51. 22 Repeat to figure out 101. Generalize Step 5 to any function u �→ f ( u ) with f ( u ) = f ( u ⊕ s ). “Usually” algorithm figures out s .

  52. 22 Repeat to figure out 101. Generalize Step 5 to any function u �→ f ( u ) with f ( u ) = f ( u ⊕ s ). “Usually” algorithm figures out s . Shor’s algorithm replaces ⊕ with more general + operation. Many spectacular applications.

  53. 22 Repeat to figure out 101. Generalize Step 5 to any function u �→ f ( u ) with f ( u ) = f ( u ⊕ s ). “Usually” algorithm figures out s . Shor’s algorithm replaces ⊕ with more general + operation. Many spectacular applications. e.g. Shor finds “random” s with 2 u mod N = 2 u + s mod N . Easy to factor N using this.

  54. 22 Repeat to figure out 101. Generalize Step 5 to any function u �→ f ( u ) with f ( u ) = f ( u ⊕ s ). “Usually” algorithm figures out s . Shor’s algorithm replaces ⊕ with more general + operation. Many spectacular applications. e.g. Shor finds “random” s with 2 u mod N = 2 u + s mod N . Easy to factor N using this. e.g. Shor finds “random” s; t with 4 u 9 v mod p = 4 u + s 9 v + t mod p . Easy to compute discrete logs.

  55. 23 Grover’s algorithm Assume: unique s ∈ { 0 ; 1 } n has f ( s ) = 0. Traditional algorithm to find s : compute f for many inputs, hope to find output 0. Success probability is very low until #inputs approaches 2 n .

  56. 23 Grover’s algorithm Assume: unique s ∈ { 0 ; 1 } n has f ( s ) = 0. Traditional algorithm to find s : compute f for many inputs, hope to find output 0. Success probability is very low until #inputs approaches 2 n . Grover’s algorithm takes only 2 n= 2 reversible computations of f . Typically: reversibility overhead is small enough that this easily beats traditional algorithm.

  57. 24 Start from uniform superposition over all n -bit strings q .

  58. 24 Start from uniform superposition over all n -bit strings q . Step 1: Set a ← b where b q = − a q if f ( q ) = 0, b q = a q otherwise. This is fast.

  59. 24 Start from uniform superposition over all n -bit strings q . Step 1: Set a ← b where b q = − a q if f ( q ) = 0, b q = a q otherwise. This is fast. Step 2: “Grover diffusion”. Negate a around its average. This is also fast.

  60. 24 Start from uniform superposition over all n -bit strings q . Step 1: Set a ← b where b q = − a q if f ( q ) = 0, b q = a q otherwise. This is fast. Step 2: “Grover diffusion”. Negate a around its average. This is also fast. Repeat Step 1 + Step 2 about 0 : 58 · 2 0 : 5 n times.

  61. 24 Start from uniform superposition over all n -bit strings q . Step 1: Set a ← b where b q = − a q if f ( q ) = 0, b q = a q otherwise. This is fast. Step 2: “Grover diffusion”. Negate a around its average. This is also fast. Repeat Step 1 + Step 2 about 0 : 58 · 2 0 : 5 n times. Measure the n qubits. With high probability this finds s .

  62. 25 Normalized graph of q �→ a q for an example with n = 12 after 0 steps: 1.0 0.5 0.0 −0.5 −1.0

  63. 25 Normalized graph of q �→ a q for an example with n = 12 after Step 1: 1.0 0.5 0.0 −0.5 −1.0

  64. 25 Normalized graph of q �→ a q for an example with n = 12 after Step 1 + Step 2: 1.0 0.5 0.0 −0.5 −1.0

  65. 25 Normalized graph of q �→ a q for an example with n = 12 after Step 1 + Step 2 + Step 1: 1.0 0.5 0.0 −0.5 −1.0

  66. 25 Normalized graph of q �→ a q for an example with n = 12 after 2 × (Step 1 + Step 2): 1.0 0.5 0.0 −0.5 −1.0

  67. 25 Normalized graph of q �→ a q for an example with n = 12 after 3 × (Step 1 + Step 2): 1.0 0.5 0.0 −0.5 −1.0

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

What do quantum computers do? Daniel J. Bernstein University of Illinois at Chicago Quantum

What do quantum computers do? Daniel J. Bernstein University of Illinois at Chicago Quantum

1 What do quantum computers do? Daniel J. Bernstein University of Illinois at Chicago Quantum algorithm means an algorithm that a quantum computer can run. i.e. a sequence of instructions, where each instruction is in a quantum

892 views • 76 slides
Quantum algorithms Daniel J. Bernstein University of Illinois at Chicago Quantum algorithm

Quantum algorithms Daniel J. Bernstein University of Illinois at Chicago Quantum algorithm

1 Quantum algorithms Daniel J. Bernstein University of Illinois at Chicago Quantum algorithm means an algorithm that a quantum computer can run. i.e. a sequence of instructions, where each instruction is in a quantum computers

1.42k views • 138 slides
Quantum algorithms Daniel J. Bernstein Quantum algorithm means an algorithm that a

Quantum algorithms Daniel J. Bernstein Quantum algorithm means an algorithm that a

1 Quantum algorithms Daniel J. Bernstein Quantum algorithm means an algorithm that a quantum computer can run. i.e. a sequence of instructions, where each instruction is in a quantum computers supported instruction set. How do we

1.53k views • 135 slides
Short generators without quantum computers: the case of multiquadratics Daniel J. Bernstein

Short generators without quantum computers: the case of multiquadratics Daniel J. Bernstein

Short generators without quantum computers: the case of multiquadratics Daniel J. Bernstein University of Illinois at Chicago 31 July 2017 https://multiquad.cr.yp.to Joint work with: Jens Bauch & Henry de Valence & Tanja Lange &

553 views • 41 slides
You thought your communication was secure? Quantum computers are coming! Daniel J. Bernstein 1 , 2

You thought your communication was secure? Quantum computers are coming! Daniel J. Bernstein 1 , 2

You thought your communication was secure? Quantum computers are coming! Daniel J. Bernstein 1 , 2 Tanja Lange 1 1 Technische Universiteit Eindhoven 2 University of Illinois at Chicago 16 April 2016 1 / 33 Cryptography Motivation

1.01k views • 57 slides
Quantum computers: the future attack that breaks todays messages Daniel J. Bernstein &

Quantum computers: the future attack that breaks todays messages Daniel J. Bernstein &

Quantum computers: the future attack that breaks todays messages Daniel J. Bernstein & Tanja Lange University of Illinois at Chicago & Technische Universiteit Eindhoven 14 December 2018 Cryptography Motivation #1:

950 views • 78 slides
Quantum circuits for the CSIDH: optimizing quantum evaluation of isogenies Daniel J. Bernstein

Quantum circuits for the CSIDH: optimizing quantum evaluation of isogenies Daniel J. Bernstein

Quantum circuits for the CSIDH: optimizing quantum evaluation of isogenies Daniel J. Bernstein Tanja Lange Chloe Martindale Lorenz Panny quantum.isogeny.org Key bits where all known attacks take 2 operations (naive serial attack metric,

412 views • 16 slides
Summary: * Why quantum for computers? * Logic gates and algorithms * Manipulating quantum

Summary: * Why quantum for computers? * Logic gates and algorithms * Manipulating quantum

Elements of quantum information processing and quantum computers (with trapped ion examples) D. J. Wineland, Dept. of Physics, U Oregon, Eugene, OR; & Research Associate, NIST, Boulder, CO Summary: * Why quantum for computers? *

742 views • 42 slides
Quantum circuits for the CSIDH: optimizing quantum evaluation of isogenies Daniel J. Bernstein

Quantum circuits for the CSIDH: optimizing quantum evaluation of isogenies Daniel J. Bernstein

Quantum circuits for the CSIDH: optimizing quantum evaluation of isogenies Daniel J. Bernstein Tanja Lange Chloe Martindale Lorenz Panny quantum.isogeny.org Non-interactive key exchange Alice: secret a , public aG . Bob: secret b , public bG

499 views • 28 slides
Quantum walks Daniel J. Bernstein University of Illinois at Chicago Focusing on quantum walks

Quantum walks Daniel J. Bernstein University of Illinois at Chicago Focusing on quantum walks

1 Quantum walks Daniel J. Bernstein University of Illinois at Chicago Focusing on quantum walks as an algorithm-design tool: e.g. Grovers algorithm. e.g. Ambainiss algorithm. Can also study quantum walks on much more general graphs.

2.22k views • 186 slides
Qu Quantum co computers, ho how do do the hey work and nd wha hat can n the hey do do?

Qu Quantum co computers, ho how do do the hey work and nd wha hat can n the hey do do?

Qu Quantum co computers, ho how do do the hey work and nd wha hat can n the hey do do? Outline Quantum technology Quantum computing What is the advantage? The qubits Operating the quantum computer Quantum computing initiatives

475 views • 31 slides
Cryptography for the quantum internet Elements of a quantum TLS Christian Majenz

Cryptography for the quantum internet Elements of a quantum TLS Christian Majenz

Cryptography for the quantum internet Elements of a quantum TLS Christian Majenz Colloquium Informatics Institute, University of Amsterdam Quantum computers Quantum computers Accelerating effort to build a quantum computer Quantum

1.74k views • 115 slides
Algorithms for multiquadratic number fields D. J. Bernstein Jens Bauch, Daniel J. Bernstein,

Algorithms for multiquadratic number fields D. J. Bernstein Jens Bauch, Daniel J. Bernstein,

1 Algorithms for multiquadratic number fields D. J. Bernstein Jens Bauch, Daniel J. Bernstein, Henry de Valence, Tanja Lange, Christine van Vredendaal. Short generators without quantum computers: the case of multiquadratics. Eurocrypt

1.13k views • 97 slides
The libpqcrypto software library for post-quantum cryptography Daniel J. Bernstein and many

The libpqcrypto software library for post-quantum cryptography Daniel J. Bernstein and many

The libpqcrypto software library for post-quantum cryptography Daniel J. Bernstein and many contributors libpqcrypto.org Daniel J. Bernstein Context libpqcrypto.org Daniel J. Bernstein Redesigning crypto for security New requirements for

541 views • 51 slides
Cost analysis of hash collisions: will quantum computers make SHARCS obsolete? D. J. Bernstein

Cost analysis of hash collisions: will quantum computers make SHARCS obsolete? D. J. Bernstein

Cost analysis of hash collisions: will quantum computers make SHARCS obsolete? D. J. Bernstein University of Illinois at Chicago NSF ITR0716498 Quantum vs. SHARCS Exactly how expensive is it to break RSA-1024, ECC-160, etc.? Many papers

452 views • 32 slides
Short generators without quantum computers: the case of multiquadratics Christine van Vredendaal

Short generators without quantum computers: the case of multiquadratics Christine van Vredendaal

Short generators without quantum computers: the case of multiquadratics Christine van Vredendaal Technische Universiteit Eindhoven 1 May 2017 Joint work with: Jens Bauch & Daniel J. Bernstein & Henry de Valence & Tanja Lange

461 views • 44 slides
CRACKING GATE SANKET PURANDARE AIR 25 (CS) GATE 2016 WHY NOT GRE ? [MS IN USA] Except

CRACKING GATE SANKET PURANDARE AIR 25 (CS) GATE 2016 WHY NOT GRE ? [MS IN USA] Except

CRACKING GATE SANKET PURANDARE AIR 25 (CS) GATE 2016 WHY NOT GRE ? [MS IN USA] Except for the top IITs, no Indian university features in the top 100 in the world rankings. No significant research work, average projects and lack of

419 views • 12 slides
MAXIMALITY OF REVERSIBLE GATE SETS Various closures Tim Boykett 10 July 2020 Algebra

MAXIMALITY OF REVERSIBLE GATE SETS Various closures Tim Boykett 10 July 2020 Algebra

MAXIMALITY OF REVERSIBLE GATE SETS Various closures Tim Boykett 10 July 2020 Algebra PREREQUISITES Background Let A be a finite set. Sym ( A ) = S A is the set of permutations or bijections of A , Alt ( A ) the set of permutations of even

470 views • 26 slides
Advanced GATE Embedded Track II, Module 8 Fifth GATE Training Course June 2012 2012 The

Advanced GATE Embedded Track II, Module 8 Fifth GATE Training Course June 2012 2012 The

GATE in Multi-threaded/Web Applications GATE and Groovy Extending GATE Advanced GATE Embedded Track II, Module 8 Fifth GATE Training Course June 2012 2012 The University of Sheffield c This material is licenced under the Creative Commons

1.36k views • 108 slides
Prof. Anne Bracy CS 3410 Computer Science Cornell University The slides are the product of many

Prof. Anne Bracy CS 3410 Computer Science Cornell University The slides are the product of many

Prof. Anne Bracy CS 3410 Computer Science Cornell University The slides are the product of many rounds of teaching CS 3410 by Professors Weatherspoon, Bala, Bracy, and Sirer. See: P&H Appendix B.2 and B.3 (Also, see B.1) 1 From Switches

629 views • 34 slides
Fast Electronics for Future Experiments Gary S. Varner University of Hawaii University of

Fast Electronics for Future Experiments Gary S. Varner University of Hawaii University of

Fast Electronics for Future Experiments Gary S. Varner University of Hawaii University of Hawai i Joint CPAD and IFCM, Jan. 11, 2013 Overview Further advances at the Discovery Frontier Depends upon developing new instruments and

769 views • 38 slides
Proto60 analysis and FPGA based signal analysis E. Guliyev, M. Kavatsyuk, P.J.J. Lemmens, H.

Proto60 analysis and FPGA based signal analysis E. Guliyev, M. Kavatsyuk, P.J.J. Lemmens, H.

Proto60 analysis and FPGA based signal analysis E. Guliyev, M. Kavatsyuk, P.J.J. Lemmens, H. Lhner, G. Tambave XXXI PANDA Collaboration Meeting December 7 12, 2009 @ GSI, Darmstadt,Germany Outline: 1. Status of fitting of energy

143 views • 10 slides
Decoders and Trees 2 n 1 2 n 1 AND (2 n 1 ) AND (2 n 1 ) y [2 n 1 : 2 n 1 ]

Decoders and Trees 2 n 1 2 n 1 AND (2 n 1 ) AND (2 n 1 ) y [2 n 1 : 2 n 1 ]

Decoder( n ) n = 1 (base) n > 1 (recursion step) x [0] x [ n 1] x [ n 2 : 0] n 1

159 views • 5 slides
Building a basic membrane computer Alejandro Millan, Julian Viejo, Juan Quiros, et al. 14th

Building a basic membrane computer Alejandro Millan, Julian Viejo, Juan Quiros, et al. 14th

Building a basic membrane computer Alejandro Millan, Julian Viejo, Juan Quiros, et al. 14th Brainstorming Week on Membrane Computing, Feb. 1-5, 2016 Grupo ID2 (Investigacion y Desarrollo Digital) www.dte.us.es/id2 Dept. Tecnologia Electronica

341 views • 18 slides

More recommend