Quantum computer


Published on

Quantum Computers Presentation

Published in: Education
  • Be the first to comment

  • Be the first to like this

No Downloads
Total views
On SlideShare
From Embeds
Number of Embeds
Embeds 0
No embeds

No notes for slide

Quantum computer

  1. 1. By, Kaushik Innamuri 10UQ1A0528 CSE-A
  2. 2. Data is represented using qubits.  The data in qubit is determined by quantum superposition phenomenon and can be either 0 or 1 or both at a time.  The operations are done after initializing qubits to initial state that represents the problem and manipulations are done on quantum logic gates.  The sequence of manipulations done on logic gates are known as “Quantum Algorithm”.  The data in the qubit is determined using quantum entanglement. 
  3. 3.       Quantum computers use atoms to perform calculations. The computation is based on principles of quantum theory. In 1981, Feynman proposed an idea on creating machines based on laws of quantum mechanics. In1985, David Deutsch developed the quantum turing machine, showing that quantum circuits are universal. In 1994, Peter Shor came up with a quantum algorithm to factor very large numbers in polynomial time. In 1997, Lov Grover develops a quantum search algorithm with O(√N) complexity
  4. 4.  Till 1982, Quantum mechanics and Computing are two different fields of study.  Accurate and speedy computation machine Part of life because logical work can also be done Advantages    Makes work easy and faster  Any complex computation or logical work like laboratory work become easy  Many kinds of numerical problems cannot be solved using conventional computers.  Example: Factorization of a number  The computer time required to factor an integer containing N digits is believed to increase exponentially with N.
  5. 5.  Single processor can perform multiple computations on its own simultaneously  Qubits may be assigned with either 0 or 1 or both at a particular time stamp.  The Quantum logic gate is reversible which means no of I/Ps = no of O/Ps.  The algorithms are well written such that it suits with the application.  In 2011, D-Wave launched a fullycommercial, 128-qubit quantum computer.
  6. 6.  Encryption Technology  Ultra-secure and Super-dense Communications  Molecular  True Simulations Randomness  Artificial Intelligence
  7. 7.  Can solve factorization problems very effectively than classical computers.  Polynomial Speed UP  Decryption of public keys  Quantum Teleportation
  8. 8.  Quantum decoherence  Cost  Quantum  Error algorithms application Correction  Output
  9. 9.  Quantum Computing could provide a radical change in the way computation is performed.  The advantages of Quantum Computing lie in the aspects of Quantum Mechanics that are peculiar to it, most notably entanglement.  Classical Computers will be significantly larger than Quantum Computers for the foreseeable future.