Introduction to Quantum Logic 2002/10/08 Tuesday Jung-wook Kim.

Slides:



Advertisements
Similar presentations
Logic Gates.
Advertisements

Hadi Hosseini CS 6805 Logic Synthesis Faculty of Computer Science Spring 2009.
ADDER, HALF ADDER & FULL ADDER
Digital Circuits. Review – Getting the truth table The first step in designing a digital circuit usually is to get the truth table. That is, for every.
CDA 3100 Recitation Week 10.
MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 1 Combinational Circuit – Arithmetic Circuit Parallel Adder Example: 4-bit adder.
1 Combinational Logic Design&Analysis. 2 Introduction We have learned all the prerequisite material: – Truth tables and Boolean expressions describe functions.
Midterm Exam for Quantum Computing Class Marek Perkowski.
A Transformation Based Algorithm for Reversible Logic Synthesis D. Michael Miller Dmitri Maslov Gerhard W. Dueck Design Automation Conference, 2003.
08/07/041 CSE-221 Digital Logic Design (DLD) Lecture-8:
Marek Perkowski Reversible Logic Models: Billiard Ball and Optical Lecture 4.
Reversible Circuit Synthesis Vivek Shende & Aditya Prasad.
Introduction to Reversible Ckts Igor Markov University of Michigan Electrical Engineering & Computer Science.
Minimization Techniques for Reversible Logic Synthesis.
Introduction to Quantum logic (2) Yong-woo Choi.
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
 Arithmetic circuit  Addition  Subtraction  Division  Multiplication.
Thapliyal 1MAPLD 2005/1012 A Beginning in the Reversible Logic Synthesis of Sequential Circuits Himanshu Thapliyal and M.B Srinivas
Chapter 4 The Building Blocks: Binary Numbers, Boolean Logic, and Gates.
REVERSIBLE LOGIC SYNTHESIS. Overview of the Presentation 1. Introduction 2. Design of a Reversible Full-adder Circuit.
What is an And Gate? It is a digital circuit that produce logical operations The logical operations are call Boolean logical Boolean operation consist.
Quantum Homomorphic Encryption
ECEN 248 Lab 4: Multiplexer Based Arithmetic Logic Unit
Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP
REVERSIBLE CELLULAR AUTOMATA WITHOUT MEMORY Theofanis Raptis Computational Applications Group Division of Applied Technologies NCSR Demokritos, Ag. Paraskevi,
1 hardware of quantum computer 1. quantum registers 2. quantum gates.
Design of an 8-bit Carry-Skip Adder Using Reversible Gates Vinothini Velusamy, Advisor: Prof. Xingguo Xiong Department of Electrical Engineering, University.
Digital Logic. 2 Abstractions in CS (gates) Basic Gate: Inverter IO IO GNDI O Vcc Resister (limits conductivity) Truth Table.
Logic Design CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.
A brief introduction to Quantum computer
ARITHMETIC MICRO OPERATIONS
Universal college of engineering & technology. .By Harsh Patel)
1 Ethics of Computing MONT 113G, Spring 2012 Session 5 Binary Addition.
Quantum Computing Reversibility & Quantum Computing.
Introduction to Quantum Computing
Generating Toffoli Networks from ESOP Expressions Yasaman Sanaee Winter 2009 University of New Brunswick.
Logic Gates M. AL-Towaileb1. Introduction Boolean algebra is used to model the circuitry of electronic devices. Each input and each output of such a device.
Combinational Circuits
ECE 320 Homework #4 1. Using 8 data input selector logic (MUX), implement the following two functions: a) F(A,B,C)=S 0 S 2 S 3 S 5 b) F(A,B,C,D)=P 0 +P.
Digital Design Module 2 Decoder Amit Kumar AP SCSE, GU Greater Noida.
AND Gate Inputs Output Input A (Switch) Input B (Switch) Output Y (Lamp) 0 (Open) 0 (OFF) A B Lamp.
Quantum Cost Calculation of Reversible Circuit Sajib Mitra MS/ Department of Computer Science and Engineering University of Dhaka
How does a Computer Add ? Logic Gates within chips: AND Gate A B Output OR Gate A B Output A B A B
ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR and parity check Circuits.
Logic Gates Chapter 5 Subject: Digital System Year: 2009.
Online Testable Fault Tolerant Full Adder in Reversible Logic Synthesis Sajib Kumar Mitra MS/ Department of Computer Science and Engineering University.
WORKING PRINCIPLE OF DIGITAL LOGIC
A Synthesis Method for MVL Reversible Logic by 1 Department of Computer Science, University of Victoria, Canada M. Miller 1, G. Dueck 2, and D. Maslov.
Attendance Syllabus Textbook (hardcopy or electronics) Groups s First-time meeting.
Quantum gates SALEEL AHAMMAD SALEEL. Introduction.
Chapter 12. Chapter Summary Boolean Functions Representing Boolean Functions Logic Gates Minimization of Circuits (not currently included in overheads)
PORTLAND QUANTUM LOGIC GROUP.
Exclusive OR Gate.
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
Elec 2607 Digital Switching Circuits
Thursday, 22 November 2018 Logic Gates
Quantum Computing Dorca Lee.
Week 7: Gates and Circuits: PART II
Digital Logic.
Introduction to Quantum logic (2)
Number Systems and Circuits for Addition
KS4 Electricity – Electronic systems
Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y
Homework 2 This homework is the first use of quantum gates. In lectures we learned about the following gates: inverter, Feynman (controlled NOT), Toffoli.
Digital Logic.
DIGITAL ELECTRONICS B.SC FY
Electronics for Physicists
Digital Circuits.
Carryout bit? Carryout bit is ‘1’ also on four cases. When a, b and carryin are 110, 101, 011, 111. Does it mean that we need a similar circuit as sum?
Presentation transcript:

Introduction to Quantum Logic 2002/10/08 Tuesday Jung-wook Kim

Reversible Logic v Lose information is equal meaning to lose energy in physical view. n The loss of information is associated with laws of physics requiring that one bit of information lost dissipates of Energy. n Whenever we use a logically irreversible gate we dissipate energy into the environment. n Reversible computation can reduce heat dissipation by losing no information through the gate. So, It allows higher densities, higher speed.

Reversible Gate v Irreversible gate v v reversible gate n n Input and Output is one-to-one mapping u u Output reconstruct input. u u No information loss through the gate n n The gate of this type is called Feymann gate (so famous physician). u u This gate is elementary gate of quantum logic

More Reversible Gate v Inverter – Only reversible gate in classic logic v Feymann gate – controlled inverter

More Reversible Gate v Toffoli gate – controlled controlled inverter v Fredkin gate – controlled swap (6 7) Reversible&Universal (1 4 2) (3 6)

Circuit with reversible gate v Swapper with Feymann gate v Full Adder with 5 Fredkin gate

General reversible gate v Four reversible gate n Inverter1-by-1 gate n Feymann2-by-2 gate n Toffoli3-by-3 gate n Fredkin3-by-3 gate n More??4-by-4 gate? … N-by-N gate is possible

General reversible gate v G gate (General gate of inv, Feymann, Toffoli) n n f = arbitrary function of a & b n n G gate is reversible

General reversible gate v H gate (General gate of Fredkin gate) n H gate is reversible gate