Quantum gates SALEEL AHAMMAD SALEEL. Introduction.

Slides:



Advertisements
Similar presentations
Quantum Computation and Quantum Information – Lecture 2
Advertisements

Quantum Computation and Quantum Information – Lecture 3
University of Strathclyde
University of Queensland
Logic Gates.
Light and Matter Tim Freegarde School of Physics & Astronomy University of Southampton Quantum computation.
Quantum Packet Switching A. Yavuz Oruç Department of Electrical and Computer Engineering University of Maryland, College Park.
Quantum computing COMP308 Lecture notes based on:
Midterm Exam for Quantum Computing Class Marek Perkowski.
Advanced Computer Architecture Laboratory EECS Fall 2001 Quantum Logic Circuits John P. Hayes EECS Department University of Michigan, Ann Arbor,
Quantum Computing Ambarish Roy Presentation Flow.
1 Welcome to the presentation on Computational Capabilities with Quantum Computer By Anil Kumar Javali.
1 A Quantum self- Routing Packet Switching Manish Kumar Shukla, Rahul Ratan and A. Yavuz Oruc, Department of Electrical and Computer Engineering, University.
University of Queensland
Engineering Models and Design Methods for Quantum State Machines.
Quantum Computing Joseph Stelmach.
Anuj Dawar.
1 Recap (I) n -qubit quantum state: 2 n -dimensional unit vector Unitary op: 2 n  2 n linear operation U such that U † U = I (where U † denotes the conjugate.
Introduction to Quantum logic (2) Yong-woo Choi.
Quantum Computation and Quantum Information – Lecture 2 Part 1 of CS406 – Research Directions in Computing Dr. Rajagopal Nagarajan Assistant: Nick Papanikolaou.
Quantum Algorithms Preliminaria Artur Ekert. Computation INPUT OUTPUT Physics Inside (and outside) THIS IS WHAT OUR LECTURES WILL.
Quantum Information Processing
Presented by: Erik Cox, Shannon Hintzman, Mike Miller, Jacquie Otto, Adam Serdar, Lacie Zimmerman.
Classical Versus Quantum. Goal: Fast, low-cost implementation of useful algorithms using standard components (gates) and design techniques Classical Logic.
Alice and Bob’s Excellent Adventure
Michael A. Nielsen University of Queensland Quantum Mechanics I: Basic Principles Goal of this and the next lecture: to introduce all the basic elements.
خودکار آبی دات کام دانلود مقاله تحقیق ، پروژه ، انواع خدمات دانشجویی ، ترجمه ، اخبار فناوری در : خودکار.
Introduction Each logical element or condition must always have a logic value of either "0" or "1", we also need to have ways to combine different logical.
October 1 & 3, Introduction to Quantum Computing Lecture 1 of 2 Introduction to Quantum Computing Lecture 1 of 2
Solving mutual exclusion by using entangled Qbits Mohammad Rastegari proff: Dr.Rahmani.
Week 6: Gates and Circuits: PART I READING: Chapter 4.
1 hardware of quantum computer 1. quantum registers 2. quantum gates.
You Did Not Just Read This or did you?. Quantum Computing Dave Bacon Department of Computer Science & Engineering University of Washington Lecture 3:
Quantum Computing Paola Cappellaro
Physics of Computing and the Promise and Limitations of Quantum Computing Charles H. Bennett IBM Research Yorktown Santa Cruz, 24 Oct 2005.
A brief introduction to Quantum computer
Quantum Computing Reversibility & Quantum Computing.
Quantum Mechanics(14/2) Hongki Lee BIOPHOTONICS ENGINEERING LABORATORY School of Electrical and Electronic Engineering, Yonsei University Quantum Computing.
Quantum Computing: An Overview for non-specialists Mikio Nakahara Department of Physics & Research Centre for Quantum Computing Kinki University, Japan.
S. E. Thompson EEL Quantum cellular Automata Quantum Cellular Automata (QCA) refers to any one of several models of quantum computation, which have.
Introduction to Quantum Computing
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 653 Lecture.
Lecture 10: Quantum Computing
IPQI-2010-Anu Venugopalan 1 qubits, quantum registers and gates Anu Venugopalan Guru Gobind Singh Indraprastha Univeristy Delhi _______________________________________________.
Quantum Computing: An Introduction Khalid Muhammad 1 History of Quantum Computing Bits and Qubits Problems with the Quantum Machine.
Quantum Computers The basics. Introduction 2/47 Dušan Gajević.
Quantum Cost Calculation of Reversible Circuit Sajib Mitra MS/ Department of Computer Science and Engineering University of Dhaka
An Introduction to Quantum Computation Sandy Irani Department of Computer Science University of California, Irvine.
Combinational Logic Logic gates. and, or, not Derived gates. nand, nor, xor John F. Wakerly – Digital Design. 4 th edition. Chapter 4.
QUANTUM COMPUTERS, COMPUTING AND INFORMATION ALAN DURNEV, PHYSICS.
1 An Introduction to Quantum Computing Sabeen Faridi Ph 70 October 23, 2007.
Intro to Quantum Algorithms SUNY Polytechnic Institute Chen-Fu Chiang Fall 2015.
Quantum Computing Keith Kelley CS 6800, Theory of Computation.
Attendance Syllabus Textbook (hardcopy or electronics) Groups s First-time meeting.
Richard Cleve DC 3524 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681 Lecture.
Combinational Logic Logic gates. and, or, not Derived gates.
Introduction to Quantum Computing Lecture 1 of 2
CSCI-100 Introduction to Computing
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
Quantum Computing Dorca Lee.
Digital Logic & Design Lecture 05
Introduction to Quantum logic (2)
OSU Quantum Information Seminar
KS4 Electricity – Electronic systems
Quantum Computation and Information Chap 1 Intro and Overview: p 28-58
Quantum Computing Prabhas Chongstitvatana Faculty of Engineering
Quantum Computing Joseph Stelmach.
Agenda Lecture Content: Combinatorial Circuits Boolean Algebras
Presentation transcript:

Quantum gates SALEEL AHAMMAD SALEEL

Introduction

Logic gate A logic gate is an idealized or physical device a Boolean function, that is, it performs a logical operation on one or more logic inputs and implementing produces a single logic output.

Quantum Gates a quantum gate (or quantum logic gate) is a basic quantum circuit operating on a small number of qubits. They are the building blocks of quantum circuits, like classical logic gates are for conventional digital circuits. quantum bit (qubit) is a unit of quantum information—the quantum analogue of the classical bit—with additional dimensions associated to the quantum properties of a physical atom.

Why Quantum gate Quantum Gates are similar to classical gates, but do not have a degenerate output. i.e. their original input state can be derived from their output state, uniquely. They must be reversible. This means that a deterministic computation can be performed on a quantum computer only if it is reversible. Luckily, it has been shown that any deterministic computation can be made reversible.

AND gate A B C In these 3 cases, information is being destroyed Due to the nature of quantum physics, the destruction of information in a gate will cause heat to be evolved which can destroy the superposition of qubits. Example.

Explanation

Quantum States For quantum computing we need only deal with finite quantum systems, and it suffices to consider only finite dimensional complex vector spaces with inner product. A quantum bit (qubit) is a unit vector in a one- dimensional complex vector space. We will use Bra/Ket (invented by Dirac) to represent these unit vectors. |0> = 1010 |1> = 0101

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>. Excited State Ground State Nucleus Light pulse of frequency for time interval t Electron State |0>State |1> Qbit representation

Super position A single qubit can be forced into a superposition of the two states denoted by the addition of the state vectors: |  > =  |0> +  |1> Where  and  are complex numbers and |  | + |  | = A qubit in superposition is in both of the states |1> and |0 at the same time

Quantum Gates One-Input gate: Hadamard Maps    1/  2   + 1/  2   and    1/  2   – 1/  2  . Ignoring the normalization factor 1/  2, we can write  x   (-1)x  x  –  –  x  One-Input gate: Phase shift H 

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. A - Target B - Control InputOutput Note: The CN gate has a similar behavior to the XOR gate with some extra information to make it reversible A’ B’

The CCN gate has been shown to be a universal reversible logic gate as it can be used as a NAND gate. A - Target B - Control 1 C - Control 2 InputOutput A’ B’ C’ When our target input is 1, our target output is a result of a NAND of B and C. Controlled Controlled NOT

New Frontiers Quantum Computer Quantum Mechanics Quantum Logic Quantum computers Quantum Programming

Nuclear spins 5-spin molecule synthesized Pathway to 7-9 qubits First demonstration of a fast 5-qubit algorithm

Quantum information is radically different to its classical counterpart. This is because the superposition principle allows for many possible states. Our inability to measure every property we might like leads to information security, but generalised measurements allow more possibilities than the more familiar von Neumann measurements. Summary

Entanglement is the quintessential quantum property. It allows us to teleport quantum information AND it underlies the speed-up of quantum algorithms Entanglement is the quintessential quantum property. It allows us to teleport quantum information AND it underlies the speed-up of quantum algorithms.. Quantum information technology will radically change all information processing and much else besides!