PHYS 650 - Spring 2009
Number |
Date |
Due on |
  Assignment |
|---|---|---|---|
|   Exercises 2.1, 2.7, 2.9, 2.11, 2.19, 2.26, 2.27 | |||
|
  1. Exercise 2.59   2. Describe a Turing machine to add two one-bit binary numbers   3. Exercise 3.8   4. Show that Toffoli gate may be used to implement NAND and FANOUT operations   5. Exercise 4.16 |
|||
|
  1. Exercise 4.24   2. Exercise A4.6   3. Exercise A5.1 (Double points) |
|||
|
  1. Write a computer code capable of factoring 5-digit number N=p*q,       where p & q are prime numbers.       Use factoring algorithm described in class. (Double points).   2. Work out the details of the Deutsch’s algorithm implementation.   3. Work out the details of the Deutsch-Jozsa algorithm implementation (p. 34-36). |