1 / 26

Quantum Computing

Quantum Computing. Ambarish Roy 16.508. Presentation Flow. Introduction. Two basic directions. First MOSFETs to Single-Electron Devices Second Quantum Computation. Objective. Not intended to accelerate digital computation Use new algorithm’s approach Theory Hilbert space

dale-compton
Download Presentation

Quantum Computing

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Quantum Computing Ambarish Roy 16.508

  2. Presentation Flow

  3. Introduction

  4. Two basic directions First • MOSFETs to Single-Electron Devices Second • Quantum Computation

  5. Objective • Not intended to accelerate digital computation • Use new algorithm’s approach Theory • Hilbert space • Qubits - a quantum object • Superposition of states - Quantum parallelism • Constructive and Destructive interference technique

  6. Hilbert Space A quantum state, describing all we know about a system, can be thought of as a vector in some abstract space called Hilbert space.

  7. Classical Computational Science

  8. Entire process flow • 1847 – Ideas for logical operations like AND, OR, and NOT on binary numbers • 1936 – Turing Machine • Bits and Gates • Small to Huge Logic Design

  9. reversible gate • Reversible gates contains information about the Input • Quantum mechanics describes only reversible processes. • Example: CNOT gate, reversible gate used in Quantum Computation (Fredkin Gate)

  10. CNOT • Two inputs ‘a’ and ‘b’ • ‘b’ complements, if a=1 • Output is ‘b’, if a=0 • Therefore a C(ontrolled)NOT gate • Truth table:

  11. Quantum Qubits and Gates

  12. Forming Qubits • Semiconductor materials provides the richest set of tools for constructing qubits. III-V materials preferred • Possible basis for qubits are Quantum Dots The confinement of the electrons in the Quantum Dots makes the energy levels discrete, thus offering the possibility of using them for encoding quantum information.

  13. Quantum Logic Gates • Unlike digital logic gates, quantum logic gates generally act on a superposition of digital states • Concept on Adjoint and Hermitian matrices • Example: state describing two states c0 and c1 :

  14. Example: 3 Bit register = 8 states • Example: CNOT Gate • Therefore, Parallelism

  15. Errors and Decoherence

  16. Sources of Error • The gate operations are not perfect • The isolation between the QM system and environment is not perfect • The system itself differs from the idealized model system considered while designing Therefore, deviation from the ideal result

  17. Counter-strategy options • Optimize the apparatus that controls Quantum system • Design gate operations in such a way that errors in experimental parameters tend to cancel than amplify • Store information in areas of the Hilbert space that are least affected by the interaction between the system and its environment

  18. Tasks for Quantum Computers

  19. Why Quantum • During repetition of some tasks on a large no. of input values, Quantum algorithms are more efficient that classical algorithms. • Example, Searching the database-the steps required for evaluation is decreased Advantages of quantum parallelism can be exploited in cases where one is not interested in all answers to all possible inputs Classes of Algorithms • Quantum Fourier transform based algorithms • Quantum searching algorithms Algorithms available • Shor’s 1994, Grover’s 1997, and Deutsch & Jozsa 1992

  20. Potential limitations to generate a time evolution that is identical to that of the digital system • In comparison with the rich theoretical work, relatively little experimental work has been published • Keeping the track of all degrees of freedom is a computationally expensive problem

  21. Building a Quantum computer

  22. The network Model • First step is to define how the information is to be stored • Once qubits are defined the architecture must provide means of operating on this quantum register • Algorithm required to initialize the quantum register • The result of the computation must be read out

  23. Requirements for quantum hardware • Qubits: Not to form a large register and confine to a smaller required states • Initialization: System must be put in a well defined state while initializing • Decoherence time: The computation must be completed before the decay has significantly degraded the information • Quantum gates: Building up a universal set of quantum gates like in digital computers

  24. Liquid state NMR quantum Comp. • NMR is mainly a spectroscopic tool that is used for the analysis of almost any type of molecule. • In the form of MRI it also has become an important tool in clinical medicine • It encodes the quantum information in the nuclear spin degrees of freedom of molecules placed in a glass tube • We study NMR systems to show how quantum computers can be implemented

  25. uses • Quantum Computers to replace classical computers • Quantum Teleportation • Quantum Cryptography

  26. Today at Present • The most advanced quantum computers have not gone beyond manipulating more than 7 qubits, meaning that they are still at the "1 + 1" stage • 5-qubit, august 2000, IBM-Almaden Research Center • 7-qubit, march 2000, Los Alamos National Lab. “Practical Quantum computer is years away”

More Related