Calculating with the square root of NOT
|
|
- Erick Shepherd
- 5 years ago
- Views:
Transcription
1 Calculating with the square root of NOT Alexis De Vos Imec v.z.w. and Universiteit Gent Belgium Cryptasc workshop Université Libre de Bruxelles, 6 Oct 2009
2 This is about groups
3 This is about groups Groups exist in three different flavours:
4 This is about groups Groups exist in three different flavours: finite groups Order is an integer infinite, but still discrete groups Order = ℵ 0 infinite groups with a non-countable number of elements = Lie groups Order = m
5 But first another story...
6 A logically irreversible computer 3 1 adding computer 4
7 3 1 adding computer 4?? adding computer 4
8 A logically reversible computer : 3 adding & subtracting computer 1 2 4
9 3 adding & subtracting computer adding & subtracting computer 1 2 4
10 Truth table of three irreversible logic gates (a) XOR gate (b) NOR gate (c) AND gate. AB P AB P AB P (a) P = A B (b) P = A + B (c) P = A B Truth table of a reversible logic gate AB PQ P = A B Q = A
11 Truth table of three reversible logic gates of width 2 (a) an arbitrary reversible gate r (b) the identity gate i (c) the inverse r 1 of r AB PQ (a) AB PQ (b) AB PQ (c) The group of reversible gates of width w is isomorphic to the symmetric group S 2 w. Its order is (2 w )!. Here w = 2 Thus S 4 Its order is 4! = 24.
12 The number r of reversible gates w r , ,922,789,888,000 r(w) = (2 w )!
13 The CONTROLLED NOT gate: P = A Q = A B. is equivalent with P = A Q = if (A = 0) then B else B. The CONTROLLED CONTROLLED NOT gate: P = A Q = B R = AB C. is equivalent with P = A Q = B R = if (AB = 0) then C else C.
14 Schematic for (a) CONTROLLED NOT gate (b) CONTROLLED CONTROLLED NOT gate (c) CONTROLLED SWAP gate a B _ Q _ A Q A A A B c C R A Q A A A B C R A Q A A A B b R _ C _ R C A A B B A A B B
15 Transistor cost: The CONTROLLED NOT gate or FEYNMAN gate : 8 transistors TheCONTROLLED CONTROLLED NOT gate ortoffoli gate : 16 transistors The CONTROLLED SWAP gate or FREDKIN gate : 16 transistors.
16 Microscope photograph (140 µm 120 µm) of 2.4-µm 4-bit reversible ripple adder (192 transistors).
17 Microscope photograph (610 µm 290 µm) of 0.8-µm 4-bit reversible carry-look-ahead adder (320 transistors).
18 Microscope photograph (1,430 µm 300 µm) of 0.35-µm 8-bit reversible multiplier (2,504 transistors).
19 Oscilloscope view of 0.35 µm full adder.
20 The number r of reversible circuits and the number q of quantum circuits w r q , ,922,789,888, r(w) = (2 w )! q(w) = (2w ) 2
21 Example: w = 1 r(w) = r(1) = 2 The two 1-bit computers (group S 2 ) are represented by the 2 2 permutation matrices: and q(w) = q(1) = 4 The infinitely many 1-qubit computers (group U(2)) are represented by the 2 2 unitary matrices: cos(θ) exp(iα) sin(θ) exp(iβ) sin(θ) exp(iγ) cos(θ) exp( iα + iβ + iγ)
22 Example: w = 1 r(w) = r(1) = 2 The two 1-bit computers (group S 2 ) are represented by the 2 2 permutation matrices: and q(w) = q(1) = 4 The infinitely many 1-qubit computers (group U(2)) are represented by the 2 2 unitary matrices: cos(θ) exp(iα) sin(θ) exp(iβ) sin(θ) exp(iγ) cos(θ) exp( iα + iβ + iγ) S 2? U(2) 2 < Order(?) < 4
23 Take S 2 and introduce an extra generator: i 1 i 2 1 i 1 + i Obtain a group with four 2 2 matrices:, i 1 i 2 1 i 1 + i, , and i 1 + i 1 + i 1 i S 2 Z 4 U(2) 2 < 4 < 4
24 Next: w = 2 Take S 4 and introduce an extra generator: i 1 i i 1 + i i 1 i i 1 + i S 4? U(4) 24 < 192 < 16
25 Next: w = 2 Take S 4 and introduce an extra generator: i 1 i i 1 + i i 1 i i 1 + i S 4? U(4) 24 < 192 < 16 Four representative circuits: a b c d
26 Next: w = 2 Take S 4 and introduce an other extra generator: i 1 i i 1 + i S 4? U(4) 24 < ℵ 0 < 16
27 The number of reversible circuits, as a function of the circuit width w, if we allow no square roots of NOT, if we allow square roots of NOT, and if we allow controlled square roots of NOT. w classical classical plus NOT classical plus controlled NOT not applicable ℵ 0 3 4
28 The number of reversible circuits, as a function of the circuit width w, if we allow no square roots of NOT, if we allow square roots of NOT, and if we allow controlled square roots of NOT. w classical classical plus NOT classical plus controlled NOT not applicable ℵ ,320 ℵ 0 ℵ ,922,789,888,000 ℵ 0 ℵ 0
29 The number of reversible circuits, as a function of the circuit width w, if we allow no square roots of NOT, if we allow square roots of NOT, and if we allow controlled square roots of NOT. w classical classical plus NOT classical plus controlled NOT not applicable ℵ ,320 ℵ 0 ℵ ,922,789,888,000 ℵ 0 ℵ 0 Making two controlled NOT gates from a single NOT gate.
30 Future research: (1) Replace square root by other root θ/π = 1/2 = i 1 i 1 i 1 + i, cos(θ) exp(iθ) i sin(θ) exp(iθ) i sin(θ) exp(iθ) cos(θ) exp(iθ)
31 Future research: (1) Replace square root by other root θ/π = 1/2 = i 1 i 1 i 1 + i, cos(θ) exp(iθ) i sin(θ) exp(iθ) i sin(θ) exp(iθ) cos(θ) exp(iθ) S 2 U(1) U(2) 2 < 1 < 4
32 Future research: (1) Replace square root by other root θ/π = 1/2 = i 1 i 1 i 1 + i, cos(θ) exp(iθ) i sin(θ) exp(iθ) i sin(θ) exp(iθ) cos(θ) exp(iθ) (2) Take square root of other (hermitian) 2 2 matrix e.g. Pauli matrix = Hadamard matrix = i i
33
Reversible computer hardware
Reversible computer hardware Alexis De Vos Imec v.z.w. and Universiteit Gent Belgium York, 22 March 2009 A logically irreversible computer 3 1 adding computer 4 3 1 adding computer 4?? adding computer
More informationControl gates as building blocks for reversible computers
Control gates as building blocks for reversible computers A. De Vos 1, B. Desoete 2, F. Janiak 3, and A. Nogawski 3 1 Universiteit Gent and Imec v.z.w., B-9000 Gent, Belgium 2 Universiteit Gent, B-9000
More informationQuantum gate. Contents. Commonly used gates
Quantum gate From Wikipedia, the free encyclopedia In quantum computing and specifically the quantum circuit model of computation, a quantum gate (or quantum logic gate) is a basic quantum circuit operating
More informationQuantum computing! quantum gates! Fisica dell Energia!
Quantum computing! quantum gates! Fisica dell Energia! What is Quantum Computing?! Calculation based on the laws of Quantum Mechanics.! Uses Quantum Mechanical Phenomena to perform operations on data.!
More informationSymmetry Groups for the Decomposition of Reversible Computers, Quantum Computers, and Computers in between
Symmetry 011, 3, 305-34; doi:10.3390/sym300305 OPEN ACCESS symmetry ISSN 073-8994 www.mdpi.com/journal/symmetry Article Symmetry Groups for the Decomposition of Reversible Computers, Quantum Computers,
More information2.0 Basic Elements of a Quantum Information Processor. 2.1 Classical information processing The carrier of information
QSIT09.L03 Page 1 2.0 Basic Elements of a Quantum Information Processor 2.1 Classical information processing 2.1.1 The carrier of information - binary representation of information as bits (Binary digits).
More informationProjects about Quantum adder circuits Final examination June 2018 Quirk Simulator
Projects about Quantum adder circuits Final examination June 2018 Quirk Simulator http://algassert.com/2016/05/22/quirk.html PROBLEM TO SOLVE 1. The HNG gate is described in reference: Haghparast M. and
More informationProblem Set # 6 Solutions
Id: hw.tex,v 1.4 009/0/09 04:31:40 ike Exp 1 MIT.111/8.411/6.898/18.435 Quantum Information Science I Fall, 010 Sam Ocko October 6, 010 1. Building controlled-u from U (a) Problem Set # 6 Solutions FIG.
More informationDESIGN AND ANALYSIS OF A FULL ADDER USING VARIOUS REVERSIBLE GATES
DESIGN AND ANALYSIS OF A FULL ADDER USING VARIOUS REVERSIBLE GATES Sudhir Dakey Faculty,Department of E.C.E., MVSR Engineering College Abstract The goal of VLSI has remained unchanged since many years
More informationChapter 03: Computer Arithmetic. Lesson 03: Arithmetic Operations Adder and Subtractor circuits Design
Chapter 03: Computer Arithmetic Lesson 03: Arithmetic Operations Adder and Subtractor circuits Design Objective To understand adder circuit Subtractor circuit Fast adder circuit 2 Adder Circuit 3 Full
More informationCombinational Logic. By : Ali Mustafa
Combinational Logic By : Ali Mustafa Contents Adder Subtractor Multiplier Comparator Decoder Encoder Multiplexer How to Analyze any combinational circuit like this? Analysis Procedure To obtain the output
More informationCarry Look Ahead Adders
Carry Look Ahead Adders Lesson Objectives: The objectives of this lesson are to learn about: 1. Carry Look Ahead Adder circuit. 2. Binary Parallel Adder/Subtractor circuit. 3. BCD adder circuit. 4. Binary
More informationQuantum Phase Estimation using Multivalued Logic
Quantum Phase Estimation using Multivalued Logic Agenda Importance of Quantum Phase Estimation (QPE) QPE using binary logic QPE using MVL Performance Requirements Salient features Conclusion Introduction
More informationOn two subgroups of U(n), useful for quantum computing
Journal of Physics: Conference Series PAPER OPEN ACCESS On two subgroups of Un, useful for quantum computing To cite this article: Alexis De Vos and Stijn De Baerdemacker 05 J. Phys.: Conf. Ser. 597 0030
More informationMidterm Exam Two is scheduled on April 8 in class. On March 27 I will help you prepare Midterm Exam Two.
Announcements Midterm Exam Two is scheduled on April 8 in class. On March 27 I will help you prepare Midterm Exam Two. Chapter 5 1 Chapter 3: Part 3 Arithmetic Functions Iterative combinational circuits
More informationReversible and Quantum computing. Fisica dell Energia - a.a. 2015/2016
Reversible and Quantum computing Fisica dell Energia - a.a. 2015/2016 Reversible computing A process is said to be logically reversible if the transition function that maps old computational states to
More informationDesign Methodologies for Reversible Logic Based Barrel Shifters
University of South Florida Scholar Commons Graduate Theses and Dissertations Graduate School January 2012 Design Methodologies for Reversible Logic Based Barrel Shifters Saurabh Kotiyal University of
More informationNovel Reversible Gate Based Circuit Design and Simulation Using Deep Submicron Technologies
Novel Reversible Gate Based Circuit Design and Simulation Using Deep Submicron Technologies Abstract: The set AND, OR, and EXOR gates are not reversible as Landauer which states that for irreversible logic
More informationECE 545 Digital System Design with VHDL Lecture 1. Digital Logic Refresher Part A Combinational Logic Building Blocks
ECE 545 Digital System Design with VHDL Lecture Digital Logic Refresher Part A Combinational Logic Building Blocks Lecture Roadmap Combinational Logic Basic Logic Review Basic Gates De Morgan s Law Combinational
More informationThe logic is straightforward. Adding two 0s will result in 0. Adding two 1s results in 10 where 1 is the carry bit and 0 is the sum bit.
Adders Half adders Half adders represent the smallest block for adding in digital computers. What they do is very simple: they add two bits, producing a sum and a carry. The logic is straightforward. Adding
More informationIBM quantum experience: Experimental implementations, scope, and limitations
IBM quantum experience: Experimental implementations, scope, and limitations Plan of the talk IBM Quantum Experience Introduction IBM GUI Building blocks for IBM quantum computing Implementations of various
More informationImplementation of Reversible ALU using Kogge-Stone Adder
Implementation of Reversible ALU using Kogge-Stone Adder Syed.Zaheeruddin, Ch.Sandeep Abstract: Reversible circuits are one promising direction with applications in the field of low-power design or quantum
More informationLooking at a two binary digit sum shows what we need to extend addition to multiple binary digits.
A Full Adder The half-adder is extremely useful until you want to add more that one binary digit quantities. The slow way to develop a two binary digit adders would be to make a truth table and reduce
More informationQuantum computing. Shor s factoring algorithm. Dimitri Petritis. UFR de mathématiques Université de Rennes CNRS (UMR 6625) Rennes, 30 novembre 2018
Shor s factoring algorithm Dimitri Petritis UFR de mathématiques Université de Rennes CNRS (UMR 6625) Rennes, 30 novembre 2018 Classical Turing machines Theoretical model of classical computer = classical
More informationADVANCES in NATURAL and APPLIED SCIENCES
ADVANCES in NATURAL and APPLIED SCIENCES ISSN: 1995-0772 Published BY AENSI Publication EISSN: 1998-1090 http://www.aensiweb.com/anas 2015 Special 9(17): pages 50-57 Open Access Journal Design and Implementation
More informationCMSC 313 Lecture 17. Focus Groups. Announcement: in-class lab Thu 10/30 Homework 3 Questions Circuits for Addition Midterm Exam returned
Focus Groups CMSC 33 Lecture 7 Need good sample of all types of CS students Mon /7 & Thu /2, 2:3p-2:p & 6:p-7:3p Announcement: in-class lab Thu /3 Homework 3 Questions Circuits for Addition Midterm Exam
More informationAdders - Subtractors
Adders - Subtractors Lesson Objectives: The objectives of this lesson are to learn about: 1. Half adder circuit. 2. Full adder circuit. 3. Binary parallel adder circuit. 4. Half subtractor circuit. 5.
More information1 Readings. 2 Unitary Operators. C/CS/Phys C191 Unitaries and Quantum Gates 9/22/09 Fall 2009 Lecture 8
C/CS/Phys C191 Unitaries and Quantum Gates 9//09 Fall 009 Lecture 8 1 Readings Benenti, Casati, and Strini: Classical circuits and computation Ch.1.,.6 Quantum Gates Ch. 3.-3.4 Kaye et al: Ch. 1.1-1.5,
More informationThe Bloch Sphere. Ian Glendinning. February 16, QIA Meeting, TechGate 1 Ian Glendinning / February 16, 2005
The Bloch Sphere Ian Glendinning February 16, 2005 QIA Meeting, TechGate 1 Ian Glendinning / February 16, 2005 Outline Introduction Definition of the Bloch sphere Derivation of the Bloch sphere Properties
More informationPSEUDORANDOM BINARY SEQUENCES GENERATOR
PSEUDORANDOM BINARY SEQUENCES GENERATOR 1. Theoretical considerations White noise is defined as a random process with power spectral density that is constant in an infinite frequency band. Quasi-white
More informationA Technology Based Complexity Model for Reversible Cuccaro Ripple-Carry Adder
Copyright 2014 American Scientific Publishers All rights reserved Printed in the United States of America Journal of Low Power Electronics Vol. 10, 1 9, 2014 A Technology Based Complexity Model for Reversible
More informationDesign of a Novel Reversible ALU using an Enhanced Carry Look-Ahead Adder
Design of a Novel Reversible ALU using an Enhanced Carry Look-Ahead Adder *K.JYOTHI **Md.ASIM IQBAL *M.TECH Dept Of ECE, KAKATHIYA UNIVERSITY OF ENGINEERING AND TECHNOLOGY **Asst. prof Dept of ECE, KAKATHIYA
More informationOverview. Arithmetic circuits. Binary half adder. Binary full adder. Last lecture PLDs ROMs Tristates Design examples
Overview rithmetic circuits Last lecture PLDs ROMs Tristates Design examples Today dders Ripple-carry Carry-lookahead Carry-select The conclusion of combinational logic!!! General-purpose building blocks
More informationCprE 281: Digital Logic
CprE 281: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Multiplication CprE 281: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev HW
More informationIntroduction to Quantum Computing
Introduction to Quantum Computing Part I Emma Strubell http://cs.umaine.edu/~ema/quantum_tutorial.pdf April 12, 2011 Overview Outline What is quantum computing? Background Caveats Fundamental differences
More informationReversible ALU Implementation using Kogge-Stone Adder
Reversible ALU Implementation using Kogge-Stone Adder K.Ravitejakhanna Student, Department of ECE SR Engineering College, Ch.Sridevi Reddy Asst.Professor, Department of ECE SR Engineering College, Abstract
More informationCprE 281: Digital Logic
CprE 281: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Fast Adders CprE 281: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev HW5
More informationIntroduction to Quantum Computation
Chapter 1 Introduction to Quantum Computation 1.1 Motivations The main task in this course is to discuss application of quantum mechanics to information processing (or computation). Why? Education:Asingleq-bitisthesmallestpossiblequantummechanical
More informationDesign Exploration and Application of Reversible Circuits in Emerging Technologies
University of South Florida Scholar Commons Graduate Theses and Dissertations Graduate School 4-7-216 Design Exploration and Application of Reversible Circuits in Emerging Technologies Saurabh Kotiyal
More informationChapter 10. Quantum algorithms
Chapter 10. Quantum algorithms Complex numbers: a quick review Definition: C = { a + b i : a, b R } where i = 1. Polar form of z = a + b i is z = re iθ, where r = z = a 2 + b 2 and θ = tan 1 y x Alternatively,
More informationC/CS/Phys 191 Quantum Gates and Universality 9/22/05 Fall 2005 Lecture 8. a b b d. w. Therefore, U preserves norms and angles (up to sign).
C/CS/Phys 191 Quantum Gates and Universality 9//05 Fall 005 Lecture 8 1 Readings Benenti, Casati, and Strini: Classical circuits and computation Ch.1.,.6 Quantum Gates Ch. 3.-3.4 Universality Ch. 3.5-3.6
More informationTotal Time = 90 Minutes, Total Marks = 50. Total /50 /10 /18
University of Waterloo Department of Electrical & Computer Engineering E&CE 223 Digital Circuits and Systems Midterm Examination Instructor: M. Sachdev October 23rd, 2007 Total Time = 90 Minutes, Total
More information4. QUANTUM COMPUTING. Jozef Gruska Faculty of Informatics Brno Czech Republic. October 20, 2011
4. QUANTUM COMPUTING Jozef Gruska Faculty of Informatics Brno Czech Republic October 20, 2011 4. QUANTUM CIRCUITS Quantum circuits are the most easy to deal with model of quantum computations. Several
More informationNumber System. Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary
Number System Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary BOOLEAN ALGEBRA BOOLEAN LOGIC OPERATIONS Logical AND Logical OR Logical COMPLEMENTATION
More informationSingle qubit + CNOT gates
Lecture 6 Universal quantum gates Single qubit + CNOT gates Single qubit and CNOT gates together can be used to implement an arbitrary twolevel unitary operation on the state space of n qubits. Suppose
More information92 CHAPTER III. QUANTUM COMPUTATION. Figure III.11: Diagram for swap (from NC).
92 CHAPTER III. QUANTUM COMPUTATION Figure III.11: Diagram for swap (from NC). C.3 Quantum circuits 1. Quantum circuit: A quantum circuit isa sequential seriesofquantum transformations on a quantum register.
More informationIntroduction to Quantum Algorithms Part I: Quantum Gates and Simon s Algorithm
Part I: Quantum Gates and Simon s Algorithm Martin Rötteler NEC Laboratories America, Inc. 4 Independence Way, Suite 00 Princeton, NJ 08540, U.S.A. International Summer School on Quantum Information, Max-Planck-Institut
More informationXI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL.
2017-18 XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL HALF ADDER 1. The circuit that performs addition within the Arithmetic and Logic Unit of the CPU are called adders. 2. A unit that adds two
More informationComplex numbers: a quick review. Chapter 10. Quantum algorithms. Definition: where i = 1. Polar form of z = a + b i is z = re iθ, where
Chapter 0 Quantum algorithms Complex numbers: a quick review / 4 / 4 Definition: C = { a + b i : a, b R } where i = Polar form of z = a + b i is z = re iθ, where r = z = a + b and θ = tan y x Alternatively,
More information6. Quantum error correcting codes
6. Quantum error correcting codes Error correcting codes (A classical repetition code) Preserving the superposition Parity check Phase errors CSS 7-qubit code (Steane code) Too many error patterns? Syndrome
More informationSome Recent Research Issues in Quantum Logic
Some Recent Research Issues in Quantum Logic Marek Perkowski Part one What will be discussed?. Background. Quantum circuits synthesis 3. Quantum circuits simulation 4. Quantum logic emulation and evolvable
More informationDeutsch Algorithm on Classical Circuits
Deutsch Algorithm on Classical Circuits Assist.Prof.Dr. Osman Kaan EROL Istanbul Technical University, Electrical-Electronics Faculty, Computer Engineering Dept. Istanbul-Turkey Abstract: The well-known
More informationSimulating classical circuits with quantum circuits. The complexity class Reversible-P. Universal gate set for reversible circuits P = Reversible-P
Quantum Circuits Based on notes by John Watrous and also Sco8 Aaronson: www.sco8aaronson.com/democritus/ John Preskill: www.theory.caltech.edu/people/preskill/ph229 Outline Simulating classical circuits
More informationQuantum Information & Quantum Computing
Math 478, Phys 478, CS4803, February 9, 006 1 Georgia Tech Math, Physics & Computing Math 478, Phys 478, CS4803 Quantum Information & Quantum Computing Problems Set 1 Due February 9, 006 Part I : 1. Read
More informationLecture 4 Modeling, Analysis and Simulation in Logic Design. Dr. Yinong Chen
Lecture 4 Modeling, Analysis and Simulation in Logic Design Dr. Yinong Chen The Engineering Design Process Define Problem and requirement Research Define Alternative solutions CAD Modeling Analysis Simulation
More informationA NEW DESIGN TECHNIQUE OF REVERSIBLE GATES USING PASS TRANSISTOR LOGIC
Journal of Engineering Science 0(0), 00, 5- A NEW DESIGN TECHNIQUE OF REVERSIBLE GATES USING PASS TRANSISTOR LOGIC Md. Sazzad Hossain, Md. Minul Hasan, Md. Motiur Rahman and A. S. M. Delowar Hossain Department
More informationTranslating between the roots of the identity in quantum computers
Translating between the roots of the identity in quantum computers Wouter Castryc 1 Jeroen Demeyer Alexis De Vos Oliver Keszocze 3 Mathias Soeen 4 1 Imec-COSIC, Departement Eletrotechnie, KU Leuven, Leuven,
More informationMenu. Binary Adder EEL3701 EEL3701. Add, Subtract, Compare, ALU
Other MSI Circuit: Adders >Binar, Half & Full Canonical forms Binar Subtraction Full-Subtractor Magnitude Comparators >See Lam: Fig 4.8 ALU Menu Look into m... 1 Binar Adder Suppose we want to add two
More informationLie algebraic quantum control mechanism analysis
Lie algebraic quantum control mechanism analysis June 4, 2 Existing methods for quantum control mechanism identification do not exploit analytic features of control systems to delineate mechanism (or,
More informationQLang: Qubit Language
QLang: Qubit Language Christopher Campbell Clément Canonne Sankalpa Khadka Winnie Narang Jonathan Wong September 24, 24 Introduction In 965, Gordon Moore predicted that the number of transistors in integrated
More informationA Novel Synthesis Algorithm for Reversible Circuits
A Novel Synthesis Algorithm for Reversible Circuits Mehdi Saeedi, Mehdi Sedighi*, Morteza Saheb Zamani Email: {msaeedi, msedighi, szamani}@ aut.ac.ir Quantum Design Automation Lab, Computer Engineering
More informationArchitecture. Chapter 5. Noson S. Yanofsky c March 24, 2007
Chapter 5 Architecture Noson S. Yanofsky c March 4, 007 noson@sci.brooklyn.cuny.edu From the intrinsic evidence of his creation, the Great Architect of the Universe now begins to appear as a pure mathematician.
More informationELCT201: DIGITAL LOGIC DESIGN
ELCT2: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 4 Following the slides of Dr. Ahmed H. Madian محرم 439 ه Winter 28
More informationQuantum Information & Quantum Computation
CS9A, Spring 5: Quantum Information & Quantum Computation Wim van Dam Engineering, Room 59 vandam@cs http://www.cs.ucsb.edu/~vandam/teaching/cs9/ Administrivia Who has the book already? Office hours: Wednesday
More informationA Novel Nanometric Reversible Four-bit Signed-magnitude Adder/Subtractor. Soudebeh Boroumand
A Novel Nanometric Reversible Four-bit Signed-magnitude Adder/Subtractor Soudebeh Boroumand Department of Computer Engineering, Tabriz Branch, Islamic Azad University, Tabriz, Iran sb.boroumand@gmail.com
More informationResource Efficient Design of Quantum Circuits for Quantum Algorithms
Resource Efficient Design of Quantum Circuits for Quantum Algorithms Himanshu Thapliyal Department of Electrical and Computer Engineering University of Kentucky, Lexington, KY hthapliyal@uky.edu Quantum
More informationQuantum Computing Lecture 3. Principles of Quantum Mechanics. Anuj Dawar
Quantum Computing Lecture 3 Principles of Quantum Mechanics Anuj Dawar What is Quantum Mechanics? Quantum Mechanics is a framework for the development of physical theories. It is not itself a physical
More informationCprE 281: Digital Logic
CprE 281: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Signed Numbers CprE 281: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev Administrative
More information9/29/2016. Task: Checking for a Lower-Case Letter. ECE 120: Introduction to Computing. Change C 5 to C 5 to Obtain L(C) from U(C)
University of Illinois at Urbana-Champaign Dept. of Electrical and Computer Engineering ECE 12: Introduction to Computing Multiplexers (Muxes) Task: Checking for a Lower-Case Letter What if we also need
More informationAddition and Subtraction
ddition and Subtraction Philipp Koehn 9 February 2018 1 addition 1-it dder 2 Let s start simple: dding two 1-it numbers Truth table + 0 0 0 0 1 1 1 0 1 1 1 10 Really 2 Operations 3 Truth table for "position
More informationQuantum Computing. 6. Quantum Computer Architecture 7. Quantum Computers and Complexity
Quantum Computing 1. Quantum States and Quantum Gates 2. Multiple Qubits and Entangled States 3. Quantum Gate Arrays 4. Quantum Parallelism 5. Examples of Quantum Algorithms 1. Grover s Unstructured Search
More informationmith College Computer Science CSC270 Spring 16 Circuits and Systems Lecture Notes Week 2 Dominique Thiébaut
mith College Computer Science CSC270 Spring 16 Circuits and Systems Lecture Notes Week 2 Dominique Thiébaut dthiebaut@smith.edu Lab 1: Lessons Learned a0 b0 adder c0 S0 a1 b1 a0 b0 adder adder S1 S0 a31
More informationThe Classification of Clifford Gates over Qubits
The Classification of Clifford Gates over Qubits Daniel Grier, Luke Schaeffer MIT Introduction Section 1 Introduction Classification Introduction Idea Study universality by finding non-universal gate sets.
More informationDesign of Digital Adder Using Reversible Logic
RESEARCH ARTICLE Design of Digital Adder Using Reversible Logic OPEN ACCESS Gowthami P*, RVS Satyanarayana ** * (Research scholar, Department of ECE, S V University College of Engineering, Tirupati, AP,
More informationAdditional Gates COE 202. Digital Logic Design. Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals
Additional Gates COE 202 Digital Logic Design Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals Presentation Outline Additional Gates and Symbols Universality of NAND and NOR gates NAND-NAND
More informationHigh Speed Time Efficient Reversible ALU Based Logic Gate Structure on Vertex Family
International Journal of Engineering Research and Development e-issn: 2278-067X, p-issn: 2278-800X, www.ijerd.com Volume 11, Issue 04 (April 2015), PP.72-77 High Speed Time Efficient Reversible ALU Based
More informationLakshmi Narain College of Technology, Bhopal (M.P.) India
Volume 5, Issue 2, February 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com An Extensive
More informationGallery of Quantum Gates
Gallery of Quantum Gates by José Luis Gómez-Muñoz http://homepage.cem.itesm.mx/lgomez/quantum/ jose.luis.gomez@itesm.mx Introduction This is a tutorial on the use of Quantum`Computing` Mathematica add-on
More informationInformation quantique, calcul quantique :
Séminaire LARIS, 8 juillet 2014. Information quantique, calcul quantique : des rudiments à la recherche (en 45min!). François Chapeau-Blondeau LARIS, Université d Angers, France. 1/25 Motivations pour
More informationBinary addition (1-bit) P Q Y = P + Q Comments Carry = Carry = Carry = Carry = 1 P Q
Digital Arithmetic In Chapter 2, we have discussed number systems such as binary, hexadecimal, decimal, and octal. We have also discussed sign representation techniques, for example, sign-bit representation
More informationCs302 Quiz for MID TERM Exam Solved
Question # 1 of 10 ( Start time: 01:30:33 PM ) Total Marks: 1 Caveman used a number system that has distinct shapes: 4 5 6 7 Question # 2 of 10 ( Start time: 01:31:25 PM ) Total Marks: 1 TTL based devices
More informationLogic and Computer Design Fundamentals. Chapter 5 Arithmetic Functions and Circuits
Logic and Computer Design Fundamentals Chapter 5 Arithmetic Functions and Circuits Arithmetic functions Operate on binary vectors Use the same subfunction in each bit position Can design functional block
More informationDesign and Optimization of Reversible BCD Adder/Subtractor Circuit for Quantum and Nanotechnology Based Systems
World pplied Sciences Journal 4 (6): 787-792, 2008 ISSN 1818-4952 IDOSI Publications, 2008 Design and Optimization of Reversible CD dder/subtractor Circuit for Quantum and Nanotechnology ased Systems 1
More informationQuantum Computing. Quantum Computing. Sushain Cherivirala. Bits and Qubits
Quantum Computing Bits and Qubits Quantum Computing Sushain Cherivirala Quantum Gates Measurement of Qubits More Quantum Gates Universal Computation Entangled States Superdense Coding Measurement Revisited
More informationExtended Superposed Quantum State Initialization Using Disjoint Prime Implicants
Extended Superposed Quantum State Initialization Using Disjoint Prime Implicants David Rosenbaum, Marek Perkowski Portland State University, Department of Computer Science Portland State University, Department
More informationModule 2. Basic Digital Building Blocks. Binary Arithmetic & Arithmetic Circuits Comparators, Decoders, Encoders, Multiplexors Flip-Flops
Module 2 asic Digital uilding locks Lecturer: Dr. Yongsheng Gao Office: Tech 3.25 Email: Web: Structure: Textbook: yongsheng.gao@griffith.edu.au maxwell.me.gu.edu.au 6 lecturers 1 tutorial 1 laboratory
More informationProblem Set # 8 Solutions
Id: hw.tex,v 1.4 009/0/09 04:31:40 ike Exp 1 MIT.111/8.411/6.898/18.435 Quantum Information Science I Fall, 010 Sam Ocko November 15, 010 Problem Set # 8 Solutions 1. (a) The eigenvectors of S 1 S are
More informationFundamentals of Digital Design
Fundamentals of Digital Design Digital Radiation Measurement and Spectroscopy NE/RHP 537 1 Binary Number System The binary numeral system, or base-2 number system, is a numeral system that represents numeric
More informationOPTIMAL DESIGN AND SYNTHESIS OF FAULT TOLERANT PARALLEL ADDER/SUBTRACTOR USING REVERSIBLE LOGIC GATES. India. Andhra Pradesh India,
OPTIMAL DESIGN AND SYNTHESIS OF FAULT TOLERANT PARALLEL ADDER/SUBTRACTOR USING REVERSIBLE LOGIC GATES S.Sushmitha 1, H.Devanna 2, K.Sudhakar 3 1 MTECH VLSI-SD, Dept of ECE, ST. Johns College of Engineering
More informationSynthesis of Quantum Circuit for FULL ADDER Using KHAN Gate
Synthesis of Quantum Circuit for FULL ADDER Using KHAN Gate Madhumita Mazumder West Bengal University of Technology, West Bengal ABSTRACT Reversible and Quantum logic circuits have more advantages than
More informationDESIGN OF PARITY PRESERVING LOGIC BASED FAULT TOLERANT REVERSIBLE ARITHMETIC LOGIC UNIT
International Journal of VLSI design & Communication Systems (VLSICS) Vol.4, No.3, June 2013 DESIGN OF PARITY PRESERVING LOGIC BASED FAULT TOLERANT REVERSIBLE ARITHMETIC LOGIC UNIT Rakshith Saligram 1
More informationCMSC 313 Lecture 18 Midterm Exam returned Assign Homework 3 Circuits for Addition Digital Logic Components Programmable Logic Arrays
MS 33 Lecture 8 Midterm Exam returned Assign Homework 3 ircuits for Addition Digital Logic omponents Programmable Logic Arrays UMB, MS33, Richard hang MS 33, omputer Organization & Assembly
More informationComputer organization
Computer organization Levels of abstraction Assembler Simulator Applications C C++ Java High-level language SOFTWARE add lw ori Assembly language Goal 0000 0001 0000 1001 0101 Machine instructions/data
More informationLogic gates. Quantum logic gates. α β 0 1 X = 1 0. Quantum NOT gate (X gate) Classical NOT gate NOT A. Matrix form representation
Quantum logic gates Logic gates Classical NOT gate Quantum NOT gate (X gate) A NOT A α 0 + β 1 X α 1 + β 0 A N O T A 0 1 1 0 Matrix form representation 0 1 X = 1 0 The only non-trivial single bit gate
More informationLow Power and High Speed BCD Adder using Reversible Gates
Low Power and High Speed BCD Adder using Reversible Gates Pradeep S R PraveenKumar Prathibha S R Abstract Reversible logic is one of the emerging technologies having promising applications in quantum computing.
More informationChapter 2. Basic Principles of Quantum mechanics
Chapter 2. Basic Principles of Quantum mechanics In this chapter we introduce basic principles of the quantum mechanics. Quantum computers are based on the principles of the quantum mechanics. In the classical
More informationEECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits)
EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) September 5, 2002 John Wawrzynek Fall 2002 EECS150 Lec4-bool1 Page 1, 9/5 9am Outline Review of
More informationFloating Point Representation and Digital Logic. Lecture 11 CS301
Floating Point Representation and Digital Logic Lecture 11 CS301 Administrative Daily Review of today s lecture w Due tomorrow (10/4) at 8am Lab #3 due Friday (9/7) 1:29pm HW #5 assigned w Due Monday 10/8
More informationSimon s algorithm (1994)
Simon s algorithm (1994) Given a classical circuit C f (of polynomial size, in n) for an f : {0, 1} n {0, 1} n, such that for a certain s {0, 1} n \{0 n }: x, y {0, 1} n (x y) : f (x) = f (y) x y = s with
More informationA NEW DESIGN TECHNIQUE OF REVERSIBLE BCD ADDER BASED ON NMOS WITH PASS TRANSISTOR GATES
A NEW DESIGN TECHNIQUE OF REVERSIBLE BCD ADDER BASED ON NMOS WITH PASS TRANSISTOR GATES Md. Sazzad Hossain 1, Md. Rashedul Hasan Rakib 1, Md. Motiur Rahman 1, A. S. M. Delowar Hossain 1 and Md. Minul Hasan
More information