THE HOLY GRAIL OF SCIENCE!




                           PRESENTED BY : DHANITH KRISHNA.B
                                               &
                                          SABEER SHA . S

                                         S1S2-CS , MCET
ACME 2011                                                     1
ACME 2011   2
ACME 2011   3
Computing governed by Quantum mechanics.

            Makes use of Quantum Entanglement and Superposition.

            Basic building block is a Quantum bit (Qubit)



            Bit                            Qubit




                                                                    Quantum
                                                                    Superposition
ACME 2011                                                                   4
Decoherence




ACME 2011                 5
Decoherence




ACME 2011                 6
ACME 2011   7
100                                                    011
                                     Quantum
            110                                                    101
                                       F(x)
            001                                                    000
                                     Processor
            100                                                    111




        Input                                                    Output


        We make simple Quantum gates and connect them to form
       Quantum networks.


       Quantum gates support certain new operations in addition to
        classical computational operations.


ACME 2011                                                                 8
Design Realizations
Proposed Quantum Computer                   DiVincenzo Criteria
       Architectures:



                            Computer uses accurate quantum gates and
                            quantum logic.

                            Physically scalable (Qubits can be increased).

                            Qubits can be initialized to some values.

                            Has means of reading Qubits.

                            Operates much faster than Decoherence
                            time.



  ACME 2011                                                              9
•A Qubit register of L       •Faster switching.      •Supports entirely new
      Qubits are equivalent       •Quantum Computers       algorithms with no
      to 2L classical registers    consume lesser          classical analogs.
      operating in parallel.       energy.
     •2L computations per
      single step.

     Quantum                                              Quantum
                                  Efficiency
     Parallelism                                          Algorithms



     •True Randomness             •Every object in this   •Simulation helps in
      helps in various             universe , in some      drug development.
      cryptographic                sense is a Quantum     •Simulation helps in
      purposes.                    computer.               study of Quantum
                                  •CYBORGs could be        Mechanics.
                                   made.

     True                         Artificial              Molecular
     Randomness                   Intelligence            Simulation
ACME 2011                                                                          10
Theoretician's dream


                 Need of
            technologies for     Problem of
             better scaling &   Decoherence.
            Interconnection.



               Need for
            advancement in      Quantum Error
            Nanotechnology       Handling and
              & Quantum         Gate accuracy.
              software's.




ACME 2011                                        11
NMR based     Dwave
                                                   two Qubit –   Vesuvius
                                    Peter Shor's   Computer.     computer
                                    first                        (512
                                    Quantum                      Qubit).
                        Deutsch's   Algorithm.
                        Universal
                        Quantum
            Richard     Computer.
            Feynman's
            model of
ACME 2011
            quantum                                                 12
            computer.
All quantum computers to date are fancy laboratory ideas!

  No one knows if we will be able to make a Quantum computer suitable for real life
  use in near future.

   At the same time researchers understand the boost that Quantum computers
  are goanna provide us if ever we could make one.

  Several technical problems will delay the realization of a quantum computer
  atleast by a few decades.

  Though it's realization is a nightmare , optimism might do wonders.




ACME 2011                                                                         13
http://plato.stanford.edu/ on Progress in Physics’, vol 61 (1998).
      A.M. Steane, ‘Reports
  http://qubit.org
  http://cam.qubit.org pour les calculateurs' by A. Barenco, A.Ekert, A. Sanpera and C. Machiavello appeared in ‘La
      'Un saut d'echelle
      Recherche ‘November 1996.Adapted by A. Barenco, updated by M. Aulbach.
  http://dsd.lbl.gov
  http://www.media.mit.edu/quanta/quanta-web/index.html
  http://www.howstuffworks.com/ Leah Henderson and Vlatko Vedral.
      ‘Quantum Entanglement’ by
  http://www.iqc.ca/
  http://www.physics.unlv.edu
  http://ieee.spectrum.org Of David Deutsch.
      The Video Lectures
  http://wikipedia.org
     ‘Experimental Realization of Shor’s Quantum Factoring Algorithm’ by M. Steffen,L.M.K.Vandersypen,G.
     Breyta,C.S.Yannoni,M.Sherwood,L.Chuang.

     ‘Quantum Computers’ by Todd A. Brun.


     ‘Quantum Computers’ by Osama Awwad.


     ‘Introduction to Quantum Computation’ by Neil Shenvi.


     General Nanocomputing by Simon Benjamin and Artur Ekert.


ACME 2011                                                                                                             14

Devilz craft

  • 1.
    THE HOLY GRAILOF SCIENCE! PRESENTED BY : DHANITH KRISHNA.B & SABEER SHA . S S1S2-CS , MCET ACME 2011 1
  • 2.
  • 3.
  • 4.
    Computing governed byQuantum mechanics. Makes use of Quantum Entanglement and Superposition. Basic building block is a Quantum bit (Qubit) Bit Qubit Quantum Superposition ACME 2011 4
  • 5.
  • 6.
  • 7.
  • 8.
    100 011 Quantum 110 101 F(x) 001 000 Processor 100 111 Input Output  We make simple Quantum gates and connect them to form Quantum networks.  Quantum gates support certain new operations in addition to classical computational operations. ACME 2011 8
  • 9.
    Design Realizations Proposed QuantumComputer DiVincenzo Criteria Architectures: Computer uses accurate quantum gates and quantum logic. Physically scalable (Qubits can be increased). Qubits can be initialized to some values. Has means of reading Qubits. Operates much faster than Decoherence time. ACME 2011 9
  • 10.
    •A Qubit registerof L •Faster switching. •Supports entirely new Qubits are equivalent •Quantum Computers algorithms with no to 2L classical registers consume lesser classical analogs. operating in parallel. energy. •2L computations per single step. Quantum Quantum Efficiency Parallelism Algorithms •True Randomness •Every object in this •Simulation helps in helps in various universe , in some drug development. cryptographic sense is a Quantum •Simulation helps in purposes. computer. study of Quantum •CYBORGs could be Mechanics. made. True Artificial Molecular Randomness Intelligence Simulation ACME 2011 10
  • 11.
    Theoretician's dream Need of technologies for Problem of better scaling & Decoherence. Interconnection. Need for advancement in Quantum Error Nanotechnology Handling and & Quantum Gate accuracy. software's. ACME 2011 11
  • 12.
    NMR based Dwave two Qubit – Vesuvius Peter Shor's Computer. computer first (512 Quantum Qubit). Deutsch's Algorithm. Universal Quantum Richard Computer. Feynman's model of ACME 2011 quantum 12 computer.
  • 13.
    All quantum computersto date are fancy laboratory ideas! No one knows if we will be able to make a Quantum computer suitable for real life use in near future.  At the same time researchers understand the boost that Quantum computers are goanna provide us if ever we could make one. Several technical problems will delay the realization of a quantum computer atleast by a few decades. Though it's realization is a nightmare , optimism might do wonders. ACME 2011 13
  • 14.
    http://plato.stanford.edu/ on Progressin Physics’, vol 61 (1998). A.M. Steane, ‘Reports http://qubit.org http://cam.qubit.org pour les calculateurs' by A. Barenco, A.Ekert, A. Sanpera and C. Machiavello appeared in ‘La 'Un saut d'echelle Recherche ‘November 1996.Adapted by A. Barenco, updated by M. Aulbach. http://dsd.lbl.gov http://www.media.mit.edu/quanta/quanta-web/index.html http://www.howstuffworks.com/ Leah Henderson and Vlatko Vedral. ‘Quantum Entanglement’ by http://www.iqc.ca/ http://www.physics.unlv.edu http://ieee.spectrum.org Of David Deutsch. The Video Lectures http://wikipedia.org ‘Experimental Realization of Shor’s Quantum Factoring Algorithm’ by M. Steffen,L.M.K.Vandersypen,G. Breyta,C.S.Yannoni,M.Sherwood,L.Chuang. ‘Quantum Computers’ by Todd A. Brun. ‘Quantum Computers’ by Osama Awwad. ‘Introduction to Quantum Computation’ by Neil Shenvi. General Nanocomputing by Simon Benjamin and Artur Ekert. ACME 2011 14