ELE 523E COMPUTATIONAL NANOELECTRONICS W2: Emerging Computing, 15/9/2014 FALL 2014 Mustafa Altun Electronics & Communication Engineering Istanbul Technical.

Slides:



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

Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 – CHAPTER 4 GRAPHS 1.
ELE 523E COMPUTATIONAL NANOELECTRONICS W3: Quantum Computing, 22/9/2014 FALL 2014 Mustafa Altun Electronics & Communication Engineering Istanbul Technical.
Quantum Computing Uf H Nick Bonesteel
Types of Algorithms.
Reducibility Class of problems A can be reduced to the class of problems B Take any instance of problem A Show how you can construct an instance of problem.
1 Optimization Algorithms on a Quantum Computer A New Paradigm for Technical Computing Richard H. Warren, PhD Optimization.
ELE 523E COMPUTATIONAL NANOELECTRONICS W7-W8: Probabilistic Computing, 20/10/ /10/2014 FALL 2014 Mustafa Altun Electronics & Communication Engineering.
© 2006 Pearson Addison-Wesley. All rights reserved14 A-1 Chapter 14 Graphs.
Math443/543 Mathematical Modeling and Optimization
Department of Computer Science & Engineering University of Washington
An Algebraic Foundation for Quantum Programming Languages Andrew Petersen & Mark Oskin Department of Computer Science The University of Washington.
Anuj Dawar.
ELE 523E COMPUTATIONAL NANOELECTRONICS
Quantum computing Alex Karassev. Quantum Computer Quantum computer uses properties of elementary particle that are predicted by quantum mechanics Usual.
By: Mike Neumiller & Brian Yarbrough
ELE 523E COMPUTATIONAL NANOELECTRONICS W1: Introduction, 8/9/2014 FALL 2014 Mustafa Altun Electronics & Communication Engineering Istanbul Technical University.
Package Transportation Scheduling Albert Lee Robert Z. Lee.
Outline Main result Quantum computation and quantum circuits Feynman’s sum over paths Polynomials QuPol program “Quantum Polynomials” Quantum polynomials.
EHB 111E NANOELECTRONICS Nanoelectronics, 18/11/2014 FALL 2014 Mustafa Altun Electronics & Communication Engineering Istanbul Technical University Web:
1 Cost Metrics for Reversible and Quantum Logic Synthesis Dmitri Maslov 1 D. Michael Miller 2 1 Dept. of ECE, McGill University 2 Dept. of CS, University.
Limits and Horizon of Computing Post silicon computing.
RESOURCES, TRADE-OFFS, AND LIMITATIONS Group 5 8/27/2014.
An Introduction to Quantum Phenomena and their Effect on Computing Peter Shoemaker MSCS Candidate March 7 th, 2003.
DISCRETE COMPUTATIONAL STRUCTURES CS Fall 2005.
Solving mutual exclusion by using entangled Qbits Mohammad Rastegari proff: Dr.Rahmani.
Major objective of this course is: Design and analysis of modern algorithms Different variants Accuracy Efficiency Comparing efficiencies Motivation thinking.
Optimization with Neural Networks Presented by: Mahmood Khademi Babak Bashiri Instructor: Dr. Bagheri Sharif University of Technology April 2007.
Quantum Computing Paola Cappellaro
Linear Algebra. Circuits The circuits in computers and other input devices have inputs, each of which is either a 0 or 1, the output is also 0s and 1s.
A brief introduction to Quantum computer
Weikang Qian. Outline Intersection Pattern and the Problem Motivation Solution 2.
1 Quantum Computing Lecture Eleven. 2 Outline  Shrinking sizes of electronic devices  Modern physics & quantum world  Principles of quantum computing.
Quantum Computing and Quantum Programming Language
EHB 111E NANOELECTRONICS Nanoelectronics, 03/12/2013 FALL 2013 Mustafa Altun Electronics & Communication Engineering Istanbul Technical University Web:
ELE 523E COMPUTATIONAL NANOELECTRONICS
Types of Algorithms. 2 Algorithm classification Algorithms that use a similar problem-solving approach can be grouped together We’ll talk about a classification.
ELE 523E COMPUTATIONAL NANOELECTRONICS
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems Prof. Hao Zhu Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
ELE 523E COMPUTATIONAL NANOELECTRONICS W8-W9: Probabilistic Computing, 2/11/ /11/2015 FALL 2015 Mustafa Altun Electronics & Communication Engineering.
Introduction to Quantum Computing
Complexity of Computations Nicholas Tran Department of Mathematics & Computer Science Santa Clara University Santa Clara, CA USA.
Page 1 COMPSCI 290.2: Computer Security “Quantum Cryptography” including Quantum Communication Quantum Computing.
Quantum Computation Stephen Jordan. Church-Turing Thesis ● Weak Form: Anything we would regard as “computable” can be computed by a Turing machine. ●
1 Euler and Hamilton paths Jorge A. Cobb The University of Texas at Dallas.
Synthesis and Optimization of Switching Nanoarrays Muhammed Ceylan Morgul Mustafa Altun, PhD Istanbul Technical University.
1 An Introduction to Quantum Computing Sabeen Faridi Ph 70 October 23, 2007.
Quantum Computing: An Introduction
Beginner’s Guide to Quantum Computing Graduate Seminar Presentation Oct. 5, 2007.
Attendance Syllabus Textbook (hardcopy or electronics) Groups s First-time meeting.
Prabhas Chongstitvatana Chulalongkorn University
Optimization by Quantum Computers
ELE 523E COMPUTATIONAL NANOELECTRONICS
Quantum Computing and Artificial Intelligence
SAT problem SAT – Boolean satisfiability problem
ELE 523E COMPUTATIONAL NANOELECTRONICS
COMPSCI 290.2: Computer Security
Unsolvable Problems December 4, 2017.
Limits and Horizon of Computing
By Nealesh Ragoodial - Security Capstone
Objective of This Course
Quantum Computing Dorca Lee.
ELE 523E COMPUTATIONAL NANOELECTRONICS
ELE 523E COMPUTATIONAL NANOELECTRONICS
Quantum Computation and Information Chap 1 Intro and Overview: p 28-58
Quantum Computing Prabhas Chongstitvatana Faculty of Engineering
ELE 523E COMPUTATIONAL NANOELECTRONICS
Quantum Computing Hakem Alazmi Jhilakshi Sharma Linda Vu.
By:- Manas Pandey Electrnics & Communication Roll No
Presentation transcript:

ELE 523E COMPUTATIONAL NANOELECTRONICS W2: Emerging Computing, 15/9/2014 FALL 2014 Mustafa Altun Electronics & Communication Engineering Istanbul Technical University Web:

Outline  Overview of Boolean algebra  Overview of computational complexity  Quantum computing  DNA computing  Computing with nano arrays  Emerging transistors

Boolean Algebra Elementary AlgebraBoolean Algebra Variables Numbers ( 1, 3.2, π ) TRUE and FALSE OperatorsAddition (+) Multiplication (×) AND ( ˄ ) OR ( ˅ ) NOT (¬) Example y = x 1 x 2 + x 1 x 3 +x 2 x 3 f = x 1 x 2 ˅ x 1 x 3 ˅ x 2 x 3 UsageFundamental MathLogic, Computer Science

Boolean Gates How to implement gates, extensively any given Boolean function, with emerging devices? NAND and NOR are universal.

Computational Complexity  Focus on classifying computational problems according to their inherent difficulty.  Time  Circuit size  Number of processors  Determine the practical limits regarding the restrictions on resources.  Based on algorithms  Reaching optimal solutions. Emerging devices aim to improve computational complexity of important problems.

Notations Big O notation C is a positive real number. Example:

Time Complexity Examples Example: Counting the class of n students (a)One by one (b)Every row has a constant A number of students. (c) n is upper bounded by a number B. Example: Finding the intersection of two sets with n and m elements. Example: Travelling salesman problem: Given a list of n cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?

Time Complexity Examples Travelling Salesman Problem

Time Complexity Examples Example: Factorizing semi-prime (RSA) numbers. For each RSA number n, there exist prime numbers p and q such that n = p × q. What is P vs NP? 15 = 3 × = 41 × 113 The prize for RSA-1024 is $ RSA-2048 takes approximately 10 billion years with the best known algorithm.

Emerging Devices

Quantum Computing  Theoretically, quantum computers solve RSA-2048 problem in seconds compared to 10 billion years.  Shor’s algorithm.  Cracking RSA keys - a breakthrough in cryptology.  Quantum key distribution Practically, where are we now? Erik Lucero’s circuit to factorize 15

Quantum Computing  February 2012: IBM scientists achieved several breakthroughs in quantum computing with superconducting integrated circuits  September 2012: The first working "quantum bit" based on a single atom in silicon suitable for the building blocks of modern computers.  October 2012: Nobel Prizes were presented to David J. Wineland and Serge Haroche for their basic work on understanding the quantum world - work which may eventually help makequantum computing possible.  May 2013: Google launching the Quantum Artificial Intelligence Lab with 512-qubit quantum computer.

Bits vs. Qubits Bits  0 or 1 at a time  Deterministic  Discrete and stable states  State of a bit:  In state 0 or 1 with a probability of Qubits  0 or 1 at the same time  Probabilistic  Superposition of states  State of a qubit:  In state 0 with a probability of  In state 1 with a probability of

Bits vs. Qubits

Quantum Gates Classical NOT gate Quantum NOT gate

Quantum Gates Quantum gates are reversible

Quantum Gates Example: Find the corresponding matrix of a quantum gate X. Example: Find the output of a Hadamard gate. Proove that it is reversible.

Quantum Gates  Can the following matrix be a Q-gate matrix?  What are the properties of Q-gate matrices?  What are the other gate types for single qubits?  How about the gates for multiple qubits.  Is there a universal quantum gate?

DNA Computing  Parallel computing  For certain problems, DNA computers are faster and smaller than any other computer built so far.  A test tube of DNA can contain trillions of strands.  Computing with DNA strands  Depending on absence and presence of DNA molecules.  Strands have directions.  How do strands stick together?

DNA Computing for TSP Adleman’s motivating experiment,1994 Modified travelling salesman problem (TSP): Given 7 towns, is there a route from town 0 to town 6 with visiting each town exactly once?

DNA Computing for TSP  Step-1: Construct strands for each link (road) considering directions  Step-2: Make the strands join where they have matching numbers.  Step-3: Eliminate all the strands other than 0-to-6 ones.  Step-4: Eliminate strands other than the ones having 6 strands.  Step-5: Look for 1, 2, 3, 4, and 5 strands one-by-one.

DNA Computing for TSP Computational complexity?

DNA Strand Displacement

DNA Computing  Main advantages  Parallel  Dense, small area  Can solve untractable problems  Disadvantages  Slow  Fragile  Unreliable, randomness

Computing with Nano Arrays Self-assembled nano arrays  Computing models for nano arrays  Two-terminal switch-based Diode-based Transistor-based  Four-terminal switch-based

Two-terminal Switch-based Model

Implement the circuit below with diode-based nanoarrays.

Four-terminal Switch-based Model

What are the Boolean functions implemented in (a) ad (b)?

Computing with Seperate Devices Nanowire transistor Single electron transistor  Direct replacement of CMOS transistors  Some advantages over CMOS  Interconnection problems  Lack of integration

Suggested Readings/Videos  Erik Lucero’ s quantum computing (2012):  DNA computing: Computing with soup (2012), Article in The Economics,  Haselman, M., & Hauck, S. (2010). The future of integrated circuits: A survey of nanoelectronics. Proceedings of the IEEE, 98(1),