Presentation is loading. Please wait.

Presentation is loading. Please wait.

خودکار آبی دات کام WwW.Khodkarabi.com WwW.dariushmoridi.blogfa.com دانلود مقاله تحقیق ، پروژه ، انواع خدمات دانشجویی ، ترجمه ، اخبار فناوری در : خودکار.

Similar presentations


Presentation on theme: "خودکار آبی دات کام WwW.Khodkarabi.com WwW.dariushmoridi.blogfa.com دانلود مقاله تحقیق ، پروژه ، انواع خدمات دانشجویی ، ترجمه ، اخبار فناوری در : خودکار."— Presentation transcript:

1 خودکار آبی دات کام WwW.Khodkarabi.com WwW.dariushmoridi.blogfa.com
دانلود مقاله تحقیق ، پروژه ، انواع خدمات دانشجویی ، ترجمه ، اخبار فناوری در : خودکار آبی دات کام برخی از مطالب سایت : آموزش نرم افزار پروتیوس آشنایی با شبکه های GSM و GPRS روشهای حل مساله های ریاضی ۱۰ نکته برای بهتر امتحان دادن اطلاعات کامل و مفید در مورد پورت HDMI بررسی و مقایسه انواع میکروفون ها دانلود مقالات برق الکترونیک و کامپیوتر

2 Lecture : Dariush Moridi
Quantum Computer Lecture : Dariush Moridi

3 Overview Data Representation Operations on Data Features and uses
Introduction and History Data Representation Operations on Data Features and uses Conclusion

4 Introduction A quantum computer is a computation device that use of quantum mechanical phenomena, such as superposition , to perform operations on data. Quantum computers are different from digital computers based on transistors. Whereas digital computers require data to be encoded into binary digits (bits), quantum computation uses quantum properties to represent data and perform operations on these data. A current computer has bits which represent 0 and 1 based on electrical signals. But in Quantum computer works with Qbits. In a Quantum Computer could be replicated by atoms in the excited or grounded state. However, given the multiple properties of quantum mechanics it would allow that other states to be inferred at the same time.

5 History Feynman proposed the idea of creating machines based on the laws of quantum mechanics instead of the laws of classical physics. David Deutsch of the University of Oxford, describes the first universal quantum computer. Peter Shor came up with a quantum algorithm to factor very large numbers in polynomial time. First working 2-qubit NMR computer demonstrated at University of California, Berkeley. Dwave announced a 128 Qubit system on December 2008

6 Data Representation Operations on Data Features and uses Conclusion
Introduction and History Data Representation Operations on Data Features and uses Conclusion

7 Qbit “Quantum” + “Bit” = Qubit Data Representation
The basic building part of a Quantum Computer is the Qubit The data about the spin position is referred to as a Qubit In classic computer a bit must be only 0 or 1, but a qubit can be 0,1 or superposition of 0 and 1 When multiple Qubits are combined it gives exceptional increase in there ability to represent data

8 A Classical Bit: Two Possible States

9 A Classical Bit: Two Possible States
1

10 Single Bit Operation: NOT
x y 0 1 1 0 y x

11 Single Bit Operation: NOT
x y 0 1 1 0 y x 1

12 A Quantum Bit or “Qubit”
|  is pronounced “ket” and denotes the state of the computer

13 A Quantum Bit or “Qubit”
1

14 A Quantum Bit or “Qubit”
1

15 A Quantum Bit or “Qubit”
Superposition : Ability of a particle to be in two different states at the same time Quantum superposition of 0 and 1 The qubit may be in a superposition x|0> + y|1> of the two states. The complex amplitudes x and y determine which state we will see if we make a measurement. When an observer measures a qubit in this superposition, the probability that the observer will see state |0> is |x|2 and the probability of seeing |1> is |y|2. 1

16 A Quantum Bit or “Qubit”
1

17 A Quantum Bit: A Continuum of States
1 cos q sin q +

18 A Quantum Bit: A Continuum of States
Actually, qubit states live on the surface of a sphere. 1 2 sin cos f q i e - +

19 A Quantum NOT Gate X

20 A Quantum NOT Gate X X

21 A Quantum NOT Gate X

22 A Quantum NOT Gate X X

23 Hadamard Gate H H

24 Hadamard Gate H H

25 Hadamard Gate H H

26 Hadamard Gate H H

27 Hadamard Gate H H is its own inverse H

28 Hadamard Gate H H is its own inverse H

29 Hadamard Gate H H is its own inverse H

30 Hadamard Gate H H is its own inverse H

31 One qubit H The significant point being that by performing the single operation on the qubit, we have performed the operation on two different values

32 H H Two qubits Counting in binary 1 2 3
1 2 Counting in binary 3 Likewise, two-qubit system would perform the operation on 4 values

33 Three qubits H H H

34 Three qubits H H H 1 2 3 4 5 6 7 three-qubit system on eight

35 N qubits H H N H H Increasing the number of qubits therefore exponentially increases the 'quantum parallelism' we can obtain with the system 1 2 3 2N-1

36 N qubits H H H H Quantum superposition of all possible input states!

37 Data Representation Operations on Data Features and uses Conclusion
Introduction and History Data Representation Operations on Data Features and uses Conclusion

38 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 H State |0> State |0> + |1> State |1> Note: Two Hadamard gates used in succession can be used as a NOT gate

39 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. Input Output A - Target A’ A B A’ B’ 1 B - Control B’ Note: The CN gate has a similar behavior to the XOR gate

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

41 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. Output A - Target A’ Input A B C A’ B’ C’ 1 B - Control 1 B’ C - Control 2 C’ When our target input is 1, our target output is a result of a NAND of B and C.

42 Data Representation Operations on Data Features and uses Conclusion
Introduction and History Data Representation Operations on Data Features and uses Conclusion

43 Features and uses Quantum computer is much faster than classical computer. This computer can solve very complex calculations and simulations. Quantum computer can be used in area of finance. It can be used to solving complex Mathematical problems. Military uses of quantum computer. Google image search. Example: To search the entire Library of Congress for one’s name given an unsorted database... Classical Computer – 100 years Quantum Computer – ½ second

44 Introduction and History
Data Representation Operations on Data Features and uses Conclusion

45 conclusion The field of quantum computing is growing rapidly as many of today's leading computing groups, universities, colleges, and all the leading IT vendors are researching the topic. This is an exciting field with many open questions and extremely diverse problematics. The quantum computers power to perform calculations across a multitude of parallel universes gives it the ability to quickly perform tasks that classical computers will never be able to practically achieve. 

46 WwW.Dariushmoridi.blogfa.com WwW.khodkarabi.com
You Can download this reasearch from :

47 THE END


Download ppt "خودکار آبی دات کام WwW.Khodkarabi.com WwW.dariushmoridi.blogfa.com دانلود مقاله تحقیق ، پروژه ، انواع خدمات دانشجویی ، ترجمه ، اخبار فناوری در : خودکار."

Similar presentations


Ads by Google