Quantum computing - Introduction

12,770 views

Published on

Introduction to Quantum Computing

Published in: Technology
2 Comments
17 Likes
Statistics
Notes
No Downloads
Views
Total views
12,770
On SlideShare
0
From Embeds
0
Number of Embeds
39
Actions
Shares
0
Downloads
1,532
Comments
2
Likes
17
Embeds 0
No embeds

No notes for slide

Quantum computing - Introduction

  1. 1. Quantum Computing<br />A New Era of Future Computing<br />Rushmila Islam<br />
  2. 2. Overview<br />19 April 2011<br />2<br />Computing Generations<br />Quantum Computing<br />Quantum Logics and Representation<br />How It Works<br />Present Status <br />Future Research<br />Conclusion<br />Open Discussion<br />
  3. 3. Computing Generations<br />19 April 2011<br />3<br />First Generation (1940-1956) <br />Vacuum Tubes<br />Second Generation (1956-1963) <br />Transistors<br />Third Generation (1964-1971) <br />Integrated Circuits<br />Fourth Generation (1971-Present) <br />Microprocessors<br />Fifth Generation (Present and Beyond) <br />Artificial Intelligence<br />
  4. 4. Why Quantum Computing<br />19 April 2011<br />4<br />"The number of transistors incorporated in a chip will approximately double every 24 months." -- Gordon Moore, Intel Co-Founder<br />
  5. 5. Why Quantum Computing<br />19 April 2011<br />5<br />By 2020 to 2025, transistors will be so small and it will generate so much heat that standard silicon technology may eventually collapse.<br /> Already Intel has implemented 32nm silicon technology<br />If scale becomes too small, Electrons tunnel through micro-thin barriers between wires corrupting signals.<br />
  6. 6. Quantum Computing<br />19 April 2011<br />6<br />A quantum computer is a machine that performs calculations based on the laws of quantum mechanics.<br />A theoretical model is the Quantum Turing machine – Universal Quantum Computer.<br />
  7. 7. Quantum Logics and Representation<br />19 April 2011<br />7<br />Quantum Computers use quantum mechanical phenomena- <br />Entanglement<br />Superposition  <br />Quantum computational operations were executed on a very small number of Qubits (quantum bits)<br />
  8. 8. Quantum Logics and Representation<br />19 April 2011<br />8<br />A classical computer has a memory made up of bits. A quantum computer maintains a sequence of qubits. <br />A single qubit can represent a one, a zero, or, crucially, any quantum superposition of these.<br />Quantum computer with n qubits can be in an arbitrary superposition of up to 2n different states simultaneously (this compares to a normal computer that can only be in one of these 2n states at any one time).<br />
  9. 9. Qubit<br />19 April 2011<br />9<br />This sphere is often called the Bloch sphere, and it provides a useful means to visualize the state of a single qubit.<br />
  10. 10. Qubit: How It Works<br />10<br />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>. <br />Light pulse of frequency  for time interval t<br />Excited State<br />Nucleus<br />Ground State<br />Electron<br />State |0><br />State |1><br />19 April 2011<br />
  11. 11. Superposition: How It Works<br />11<br />A qubit in superposition is in both of the states |1> and |0> at the same time.<br />One example of a two-state quantum system is the polarization of a single photon<br />
  12. 12. 19 April 2011<br />12<br />Multiple computations simultaneously<br />
  13. 13. Superposition: How It Works<br />13<br />A single qubit can be forced into a superposition of the two states denoted by the addition of the state vectors: <br /> |> = 1|0> + 2 |1><br />Where 1and 1are complex numbers and |1|2 + | 2|2 = 1<br />Light pulse of frequency  for time interval t/2<br />State |0> + |1><br />State |0><br />
  14. 14. Quantum Logic Gates<br />19 April 2011<br />14<br />Commonly used gates<br />Hadamard gate<br />Pauli-X gate<br />Pauli-Y gate<br />Pauli-Z gate<br />Phase shift gates<br />Swap gate<br />Controlled gates<br />
  15. 15. Controlled Gates<br />19 April 2011<br />15<br />Controlled gates act on 2 or more qubits. For example, the controlled NOT gate (or CNOT) acts on 2 qubits, and performs the NOT operation on the second qubits only when the first qubit is |1> , and otherwise leaves it unchanged. It is represented by the matrix-<br />Circuit representation of controlled NOT gate<br />
  16. 16. Present Status <br />19 April 2011<br />16<br />Quantum physicists from the University of Innsbruck have set another world record: They have achieved controlled entanglement of 14 quantum bits (qubits) and, thus, realized the largest quantum register that has ever been produced. ScienceDaily (Apr 1, 2011) <br />Researchers at Delft University of Technology have succeeded in carrying out calculations with two quantum bits. ScienceDaily (June.17, 2010) <br />December 19, 2001 – IBM performs Shor’s Algorithm<br />
  17. 17. Future Research<br />19 April 2011<br />17<br />If large-scale quantum computers can be built, they will be able to solve certain problems much faster than any classical computer using the best currently known algorithms (for example integer factorization using Shor's algorithm or the simulation of quantum many-body systems). <br />Desktop Quantum computers expected by many within 10 years<br />
  18. 18. Conclusion<br />19 April 2011<br />18<br />
  19. 19. References<br />19 April 2011<br />19<br />http://en.wikipedia.org/wiki/Quantum_computer<br />http://bigthink.com/ideas/24289<br />http://gizmodo.com/#!5335901/giz-explains-why-quantum-computing-is-the-future-but-a-distant-one<br />http://www.bbc.co.uk/news/science-environment-12811199<br />http://www.qubit.org/tutorials/25-quantum-computing.html<br />http://www.sciencedaily.com/releases/2011/04/110401085103.htm<br />http://plato.stanford.edu/entries/qt-quantcomp/<br />
  20. 20. 19 April 2011<br />

×