1. Attendance Syllabus Textbook (hardcopy or electronics) Groups Emails First-time meeting

2. Introduction and Overview From “classical physics” to “quantum mechanics” “ultraviolet catastrophe” see the video: A Brief History Of Quantum Mechanics https://www.youtube.com/watch?v=B7pACq_xWyw Quantum mechanics is a mathematical framework or set of rules for the construction of physical theories.

3. Computer Science Church–Turing thesis (Alan Turing & Alonzo Church, 1936) Any algorithmic process can be simulated using a Turing machine. Electronic computers (John von Neumann) Transistors (William Shockley) Moore’s law (Gordon Moore) Computer power will double for constant cost roughly once every two years. (should end in 21 st century, moving to a different computing paradigm) A classical computer can simulate a quantum computer, but it is not “efficient.” Strong Church–Turing thesis Any algorithmic process can be simulated efficiently using a Turing machine. (People have tried to find a counter example, for instance, primality) Randomized algorithms (an ad-hoc version of strong Church–Turing thesis) Any algorithmic process can be simulated efficiently using a probabilistic TM. David Deutsch used quantum mechanics to derive a stronger version. Any physical system can be simulated efficiently using a quantum computer. (the proof is ongoing).

4. Computer Science (continue) A problem/algorithm that can be solved/executed efficiently on QC, but not on TM Deutsch algorithm Deutsch-Jozsa algorithm Grover’s algorithm Shor’s algorithm Feynman had pointed out that there seemed to be essential difficulties in simulating quantum mechanical systems on classical computers, and suggested that building computers based on the principles of quantum mechanics would allow us to avoid those difficulties.

5. Quantum Bits (Qubits) Classical bits vs. Quantum bits Qbits are mathematical objects (similarly to 0/1 in classical bits)

6. Quantum Bits (Qubits) Measurement

7. Multiple Qubits EPR = Einstein, Podolsky, Rosen

8. Single Qubit Gates NOT Unitary matrix

9. Single Qubit Gates Z gate: H gate (Hadamard):

10. Multiple Qubit Gates

11. Reversible / Invertible “Any multiple qubit logic gate may be composed from CNOT and single qubit gates.” Universality Classical XOR and NAND are irreversible or non-invertible. Qubit gates are always reversible (there are always inversed matrices). The inverse of U is the adjoint of U. Similarly, any multiple classical logic gate may be composed from NAND gates.

12. Measurements in bases other than the computational basis Change basis from |0>, |1> to |+>, |->

13. Wire = the passage of time Acyclic No FANIN No FANOUT Circuit swapping two qubits

15. Qubit Copying Circuit? Input Output ( สมมติว่าถ้าก็อปปี้กรณีทั่วๆ ไปได้ จะได้ output ดังนี้ ) Specific case: x = |0> or |1> Proof pp. 532 วงจรนี้ก็อปปี้ |0> หรือ |1> ได้ Input = |0>ab = 10output = |00> Input = |1>ab = 01output = |11> 2 เทอมนี้จะเท่ากันก็ต่อเมื่อ ab = 0 มี 2 กรณีคือ - หนึ่ง a = 1, b = 0 หรือ input = |0> - สอง a = 0, b = 1 หรือ input = |1> ดังนั้นวงจรนี้จะก็อปปี้ได้เฉพาะ |0> หรือ |1> เท่านั้น

16. Bell States

17. Quantum Teleportation Alice Bob Sent to Bob EPR pair

18. Quantum Teleportation Faster-than-light communication? ไม่ว่าจะ teleport “object” หรือ “information” ก็ไม่มีทางเร็ว ไปกว่าแสงได้

19. Classical computations on a quantum computer Write an 8x8 matrix of Toffoli gate.

20. Simulating NAND gate and FANOUT How to produce a random number?

21. Quantum Parallelism

22. Deutsch’s algorithm If f(x) = 1, y will be inverted (not). Show the calculation of all the 4 cases. ???

25. Deutsch-Jozsa algorithm f: {0,1} n → {0,1} f(x) is constant for all values of x. f(x) is balanced, that is, equal to 1 for exactly half of all the possible x, and 0 for the other half. f(x) is either constant or balanced.

26. Deutsch-Jozsa algorithm x = state (1 bits) x = state (n bits) Constant = |0..0> Balanced = other states ใช้สูตร ทางขวา inner product Coeff. ของ pp. 34

27. The Power of Quantum Computation P = solved in polynomial time NP = verified in polynomial time PSPACE = solved in polynomial space We do not know whether P != NP PSPACE is bigger than NP NP-complete Graph isomorphism Integer Factorization BQP (bounded error quantum polynomial time) is the class of decision problems solvable by a quantum computer in polynomial time, with an error probability of at most 1/3 for all instances.

28. Stern-Gerlach Experiment ใช้ classical bit เพื่อแทน spin ในแต่ละแกน X, Y, Z ได้ หรือไม่ ? Video: https://www.youtube.com/watch?v=rg4Fnag4V-E

29. Stern-Gerlach Experiment

32. Further Reading http://www-bcf.usc.edu/~tbrun/Course/lecture02.pdf