Lect_28 is very important on the su.pptx

detailed analysis on the subject

1. Quantum computing COMP308 Lecture notes based on: Introduction to Quantum Computing http://www.cs.uwaterloo.ca/~cleve/CS497-F07 Richard Cleve, Institute for Quantum Computing, University of Waterloo Introduction to Quantum Computing and Quantum Information Theory Dan C. Marinescu and Gabriela M. Marinescu Computer Science Department , University of Central Florida

2. 2 Moore’s Law Measuring a state (e.g. position) disturbs it Quantum systems sometimes seem to behave as if they are in several states at once Different evolutions can interfere with each other Following trend … atomic scale in 15-20 years Quantum mechanical effects occur at this scale: 1975 1980 1985 1990 1995 2000 2005 10 4 10 5 10 6 10 7 10 8 10 9 number of transistors year

3. 3 Quantum mechanical effects Additional nuisances to overcome? or New types of behavior to make use of? [Shor ’94]: polynomial-time algorithm for factoring integers on a quantum computer This could be used to break most of the existing public-key cryptosystems, including RSA, and elliptic curve crypto [Bennett, Brassard ’84]: provably secure codes with short keys

4. 4 Also with quantum information: Fast er algorithms for combinatorial search problems Fast algorithms for simulating quantum mechanics Communication savings in distributed systems More efficient notions of “proof systems” Quantum information theory is a generalization of the classical information theory that we all know—which is based on probability theory classical information theory quantum information theory

5. What is a quantum computer? A quantum computer is a machine that performs calculations based on the laws of quantum mechanics, which is the behavior of particles at the sub-atomic level.

6. Introduction “I think I can safely say that nobody understands quantum mechanics” - Feynman 1982 - Feynman proposed the idea of creating machines based on the laws of quantum mechanics instead of the laws of classical physics. 1985 - David Deutsch developed the quantum turing machine, showing that quantum circuits are universal. 1994 - Peter Shor came up with a quantum algorithm to factor very large numbers in polynomial time. 1997 - Lov Grover develops a quantum search algorithm with O(√N) complexity

7. Representation of Data - Qubits A bit of data is represented by a single atom that is in one of two states denoted by |0> and |1> . A single bit of this form is known as a qubit A physical implementation of a qubit could use the two energy levels of an atom. An excited state representing |1> and a ground state representing |0>. Excited State Ground State Nucleus Light pulse of frequency  for time interval t Electron State |0> State |1>

8. Representation of Data - Superposition A single qubit can be forced into a superposition of the two states denoted by the addition of the state vectors: | > =  |0> +  |1> Where  and  are complex numbers and | | + |  | = 1 1 2 1 2 1 2 2 2 A qubit in superposition is in both of the states |1> and |0 at the same time

9. Representation of Data - Superposition Light pulse of frequency  for time interval t/2 State |0> State |0> + |1> Consider a 3 bit qubit register. An equally weighted superposition of all possible states would be denoted by: | > = |000> + |001> + . . . + |111> 1 √8 1 √8 1 √8

10. One qubit Mathematical abstraction Vector in a two dimensional complex vector space (Hilbert space) Dirac’s notation ket  column vector bra  row vector bra  dual vector (transpose and complex conjugate)

11. 11 A bit versus a qubit A bit Can be in two distinct states, 0 and 1 A measurement does not affect the state A qubit can be in state or in state or in any other state that is a linear combination of the basis state When we measure the qubit we find it in state with probability in state with probability are complex numbers

12. The Boch sphere representation of one qubit A qubit in a superposition state is represented as a vector connecting the center of the Bloch sphere with a point on its periphery. The two probability amplitudes can be expressed using Euler angles.

13. 13 Qubit measurement

14. Two qubits Represented as vectors in a 2-dimensional Hilbert space with four basis vectors When we measure a pair of qubits we decide that the system it is in one of four states with probabilities

15. 15 Measuring two qubits Before a measurement the state of the system consisting of two qubits is uncertain (it is given by the previous equation and the corresponding probabilities). After the measurement the state is certain, it is 00, 01, 10, or 11 like in the case of a classical two bit system.

16. 16 Measuring two qubits (cont’d) What if we observe only the first qubit , what conclusions can we draw? We expect that the system to be left in an uncertain sate, because we did not measure the second qubit that can still be in a continuum of states. The first qubit can be 0 with probability 1 with probability

17. 17 Bell state 1/ sqrt (2) |0> + 1/ sqrt (2) |1> Measurement of a qubit in that state gives 50 % of time logic 0, 50% of time logic. Can also be denoted as |+>

18. 18 Entanglement Entanglement is an elegant, almost exact translation of the German term Verschrankung used by Schrodinger who was the first to recognize this quantum effect. An entangled pair is a single quantum system in a superposition of equally possible states. The entangled state contains no information about the individual particles, only that they are in opposite states. The important property of an entangled pair is that the measurement of one particle influences the state of the other particle. Einstein called that “Spooky action at a distance".

19. Due to the nature of quantum physics, the destruction of information in a gate will cause heat to be evolved which can destroy the superposition of qubits. Operations on Qubits - Reversible Logic A B C 1 1 1 1 1 Input Output A B C In these 3 cases, information is being destroyed Ex. The AND Gate This type of gate cannot be used. We must use Quantum Gates .

20. Quantum Gates Quantum Gates are similar to classical gates, but do not have a degenerate output. i.e. their original input state can be derived from their output state, uniquely. They must be reversible. This means that a deterministic computation can be performed on a quantum computer only if it is reversible. Luckily, it has been shown that any deterministic computation can be made reversible.(Charles Bennet, 1973)

21. 21

22. 22 One qubit gates I  identity gate; leaves a qubit unchanged. X or NOT gate  transposes the components of an input qubit. Y gate. Z gate  flips the sign of a qubit. H  the Hadamard gate.

23. Quantum Gates - Hadamard Simplest gate involves one qubit and is called a Hadamard Gate ( also known as a square-root of NOT gate.) Used to put qubits into superposition. H State |0> State |0> + |1> H State |1> Note: Two Hadamard gates used in succession can be used as a NOT gate

24. Quantum Gates - Controlled NOT A gate which operates on two qubits is called a Controlled-NOT (CN) Gate. If the bit on the control line is 1, invert the bit on the target line. A - Target B - Control A B A’ B’ 1 1 1 1 1 1 1 1 Input Output Note: The CN gate has a similar behavior to the XOR gate with some extra information to make it reversible. A’ B’

25. Example Operation - Multiplication By 2 Carry Bit Carry Bit Ones Bit Carry Bit Ones Bit 1 1 Input Output Ones Bit We can build a reversible logic circuit to calculate multiplication by 2 using CN gates arranged in the following manner: H

26. Quantum Gates - Controlled Controlled NOT (CCN) A - Target B - Control 1 C - Control 2 A B C A’ B’ C’ 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Input Output A’ B’ C’ A gate which operates on three qubits is called a Controlled Controlled NOT (CCN) Gate. Iff the bits on both of the control lines is 1,then the target bit is inverted.

27. A Universal Quantum Computer The CCN gate has been shown to be a universal reversible logic gate as it can be used as a NAND gate. A - Target B - Control 1 C - Control 2 A B C A’ B’ C’ 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Input Output A’ B’ C’ When our target input is 1, our target output is a result of a NAND of B and C.

28. 28 Classical and quantum systems Probabilistic states: Quantum states: Dirac notation: | 000, | 001, | 010, …, | 111 are basis vectors, so

29. 29 Dirac bra/ket notation Ket:  ψ  always denotes a column vector, e.g. Bra c ket :  φ  ψ  denotes  φ    ψ  , the inner product of  φ  and  ψ  Bra:  ψ  always denotes a row vector that is the conjugate transpose of  ψ  , e.g. [  * 1  * 2   * d ] Convention:

30. 30 Basic operations on qubits (I) Rotation by  : (0) Initialize qubit to | 0 or to | 1 (1) Apply a unitary operation U ( formally U † U = I ) Examples: Recall conjugate transpose NOT (bit flip): Maps | 0  | 1 | 1  | 0 Phase flip: Maps | 0  | 0 | 1   | 1

31. 31 Basic operations on qubits (II) Hadamard: More examples of unitary operations: (unitary  rotation)    1  Reflection about this line H   H  1 

32. 32 Basic operations on qubits (III) (3) Apply a “standard” measurement:   +  1  (  ) There exist other quantum operations, but they can all be “simulated” by the aforementioned types Example: measurement with respect to a different orthonormal basis {  ψ  ,  ψ 1  } |  | 2 |  | 2    1   ψ   ψ 1  … and the quantum state collapses to   or  1 

33. 33 Distinguishing between two states Question 1: can we distinguish between the two cases? Let be in state or Distinguishing procedure: apply H measure This works because H  +  =   and H  −  =  1  Question 2: can we distinguish between   and  +  ? Since they’re not orthogonal, they cannot be perfectly distinguished … but statistical difference is detectable

34. 34 Operations on n -qubit states Unitary operations: … and the quantum state collapses Measurements :    ( U † U = I )

35. 35 Entanglement The state of the combined system their tensor product : ?? Suppose that two qubits are in states: Question: what are the states of the individual qubits for 1. ? 2. ? Answers: 1. 2. ... this is an entangled state

36. 36 Structure among subsystems V U W qubits: #2 #1 #4 #3 time unitary operations measurements

37. 37 Quantum circuits 0 1 1 0 1 0 1 1 1 1 Computation is “feasible” if circuit-size scales polynomially

38. 38

39. 39 One qubit gates

40. 40 Identity transformation, Pauli matrices, Hadamard

41. 41 Tensor products and ``outer’’ products

42. 42 CNOT a two qubit gate Two inputs Control Target The control qubit is transferred to the output as is. The target qubit Unaltered if the control qubit is 0 Flipped if the control qubit is 1.

43. 43

44. 44 The two input qubits of a two qubit gates

45. 45 Two qubit gates

46. 46 Two qubit gates

47. 47 Final comments on the CNOT gate CNOT preserves the control qubit (the first and the second component of the input vector are replicated in the output vector) and flips the target qubit (the third and fourth component of the input vector become the fourth and respectively the third component of the output vector). The CNOT gate is reversible. The control qubit is replicated at the output and knowing it we can reconstruct the target input qubit.

48. 48 Example of a one-qubit gate applied to a two-qubit system U (do nothing) The resulting 4x4 matrix is        U      1     U  1   1      1  U    1   1    1  U  1  Maps basis states as: Question: what happens if U is applied to the first qubit?

49. 49 Controlled- U gates U             1      1   1      1  U    1   1    1  U  1  Maps basis states as: Resulting 4x4 matrix is controlled- U =

50. 50 Controlled- NOT (CNOT) Note: “control” qubit may change on some input states! X  a   b   a  b   a  ≡   +  1    −  1    −  1    −  1  H H H H 

51. 51 Multiplication problem “Grade school” algorithm takes O ( n 2 ) steps Best currently-known classical algorithm costs O ( n log n loglog n ) Best currently-known quantum method: same Input: two n -bit numbers (e.g. 101 and 111 ) Output: their product (e.g. 100011 )

52. 52 Factoring problem Trial division costs  2 n / 2 Best currently-known classical algorithm costs O ( 2 n ⅓ log ⅔ n ) Hardness of factoring is the basis of the security of many cryptosystems (e.g. RSA) Shor’s quantum algorithm costs  n 2 [ O ( n 2 log n loglog n ) ] Implementation would break RSA and other cryptosystems Input: an n -bit number (e.g. 100011 ) Output: their product (e.g. 101 , 111 )

53. Grover’s Search Algorithm • Search in a database with N names . • Names are randomly entered. • Classically on average N/2 search is required . O(N) operations is required. • Quantum computation requires O( sqrt (N )) operations

54. 54 How do quantum algorithms work? This is not performing “exponentially many computations at polynomial cost” But we can make some interesting tradeoffs : instead of learning about any ( x , f ( x ) ) point, one can learn something about a global property of f Given a polynomial-time classical algorithm for f :{0 , 1} n → T , it is straightforward to construct a quantum algorithm that creates the state: The most straightforward way of extracting information from the state yields just ( x , f ( x ) ) for a random x  {0 , 1} n

55. 55 Deutsch’s problem Let f : {0,1} → {0,1} f There are four possibilities: x f 1 ( x ) 1 x f 2 ( x ) 1 1 1 x f 3 ( x ) 1 1 x f 4 ( x ) 1 1 Goal: determine f ( )  f ( 1 ) Any classical method requires two queries What about a quantum method?

56. 56 Reversible black box for f U f a b a b  f ( a ) f alternate notation: A classical algorithm: (still requires 2 queries) f f 1 f ( )  f ( 1 ) 2 queries + 1 auxiliary operation

57. 57 Quantum algorithm for Deutsch H f H H  1    f ( )  f ( 1 ) 1 query + 4 auxiliary operations How does this algorithm work? Each of the three H operations can be seen as playing a different role ... 1 2 3

58. 58 Quantum algorithm ( 1 ) H f H H  1    1. Creates the state   –  1  , which is an eigenvector of 1 2 3 NOT with eigenvalue – 1 I with eigenvalue + 1 This causes f to induce a phase shift of ( – 1 ) f ( x ) to  x  f   –  1   x  ( – 1 ) f ( x )  x    –  1 

59. 59 Quantum algorithm ( 2 ) 2. Causes f to be queried in superposition (at 0 + 1 ) f   –  1    ( – 1 ) f ( ) 0 + ( – 1 ) f ( 1 ) 1   –  1  H x f 1 ( x ) 1 x f 2 ( x ) 1 1 1 x f 3 ( x ) 1 1 x f 4 ( x ) 1 1 (  +  1 ) (  –  1 )

60. 60 Quantum algorithm ( 3 ) 3. Distinguishes between (  +  1 ) and (  –  1 ) H (  +  1 )   (  –  1 )  1  H

61. 61 Summary of Deutsch’s algorithm H f H H  1    f ( )  f ( 1 ) 1 2 3 constructs eigenvector so f -queries induce phases:  x   ( – 1 ) f ( x )  x  produces superpositions of inputs to f : 0 + 1 extracts phase differences from ( – 1 ) f ( ) 0 + ( – 1 ) f ( 1 ) 1 Makes only one query, whereas two are needed classically

62. 62 One-out-of-four search Let f : {0,1} 2 → {0,1} have the property that there is exactly one x  {0,1} 2 for which f ( x ) = 1 Four possibilities: x f 00 ( x ) 00 01 10 11 1 Goal: find x  {0,1} 2 for which f ( x ) = 1 x f 01 ( x ) 00 01 10 11 1 x f 10 ( x ) 00 01 10 11 1 x f 11 ( x ) 00 01 10 11 1 What is the minimum number of queries classically? ____ Quantumly? ____

63. 63 Quantum algorithm (I) f  x 1   x 2   y   x 2   x 1   y  f ( x 1 ,x 2 )  ( ( – 1 ) f ( 00 ) 00 + ( – 1 ) f ( 01 ) 01 + ( – 1 ) f ( 10 ) 10 + ( – 1 ) f ( 11 ) 11)(  –  1 ) Output state of query? Black box for 1-4 search: Start by creating phases in superposition of all inputs to f : Input state to query? f H H H  1      (00 + 01 + 10 + 11)(  –  1 )

64. 64 Quantum algorithm (II) Output state of the first two qubits in the four cases: f H H H  1      Case of f 00 ?  ψ 01  = + 00 – 01 + 10 + 11  ψ 10  = + 00 + 01 – 10 + 11  ψ 11  = + 00 + 01 + 10 – 11 What noteworthy property do these states have ?  Orthogonal U  ψ 00  = – 00 + 01 + 10 + 11 Case of f 01 ? Case of f 10 ? Case of f 11 ?  Apply the U that maps   ψ 00  ,  ψ 01  ,  ψ 10  ,  ψ 11  to  00 , 01 , 10 , 11 (resp.)

65. What makes a quantum algorithm potentially faster than any classical one? Quantum parallelism: by using superpositions of quantum states , the computer is executing the algorithm on all possible inputs at once Dimension of quantum Hilbert space: the “size” of the state space for the quantum system is exponentially larger than the corresponding classical system Entanglement capability: different subsystems ( qubits ) in a quantum computer become entangled, exhibiting nonclassical correlations

66. Quantum algorithms research Require more quantum algorithms in order to : solve problems more efficiently understand the power of quantum computation make valid/realistic assumptions for information security Problems for quantum algorithms research: requires close collaboration between physicists and computer scientists highly non-intuitive nature of quantum physics even classical algorithms research is difficult

67. Summary of quantum algorithms It may be possible to solve a problem on a quantum system much faster (i.e., using fewer steps) than on a classical computer Factorization and searching are examples of problems where quantum algorithms are known and are faster than any classical ones Implications for cryptography, information security Study of quantum algorithms and quantum computation is important in order to make assumptions about adversary’s algorithmic and computational capabilities Leading to an understanding of the computational power of quantum vs classical systems

68. Conclusion In 2001, a 7 qubit machine was built and programmed to run Shor’s algorithm to successfully factor 15. What algorithms will be discovered next? Can quantum computers solve NP Complete problems in polynomial time?