Mustafa Altun Electronics & Communication Engineering Istanbul Technical University Web: http://www.ecc.itu.edu.tr/. ELE 523E COMPUTATIONAL NANOELECTRONICS. W2 : Emerging Computing, 23 /9/2013. FALL 2013. Outline. Overview of Boolean algebra Overview of computational complexity
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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
How to implementgates, extensivelyanygivenBooleanfunction, with emerging devices?
Emergingdevicesaimto improvecomputational complexity of importantproblems.
Big O notation
C is a positive real number.
Countingtheclass of nstudents
Everyrow has a constantA number of students.
Findingtheintersection of twosetswithnandmelements.
Travellingsalesman 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?
Travelling Salesman Problem
Factorizing semi-prime (RSA) numbers. For each RSA number n, there exist prime numbers p and q such that n = p × q.
15 = 3 × 5
4633 = 41 × 113
The prize for RSA-1024 is $100.000.
RSA-2048 takes approximately 10 billion years with the bestknown algorithm.
What isPvs NP?
Practically, where are we now?
Erik Lucero’scircuittofactorize 15
Classical NOT gate
Quantum NOT gate
Findthecorrespondingmatrix of a quantumgateX.
Find the output of a Hadamard gate. Proove that it is reversible.
Modified travellingsalesmanproblem (TSP): Given 7 towns, is there a routefromtown0totown6withvisitingeachtownexactlyonce?
Single electron transistor