Molecular Scale Architectures Quantum Cellular Automata and Molecular Combinatorial Logic By Jeff Kramer.

Slides:



Advertisements
Similar presentations
Electric Charge What are the different kinds of electric charge?
Advertisements

Reversible Gates in various realization technologies
Kameshwar K. Yadavalli, Alexei O. Orlov, Ravi K. Kummamuru, John Timler, Craig Lent, Gary Bernstein, and Gregory Snider Department of Electrical Engineering.
Electrostatic Force Opposites Attract Like Charges Repel Holds Atom together!
LOGIC GATES ADDERS FLIP-FLOPS REGISTERS Digital Electronics Mark Neil - Microprocessor Course 1.
Montek Singh COMP Aug 30,  Gain/amplification ◦ restoring logic ◦ clock gain  QCA Implementation  Experimental results.
Alexei O. Orlov Department of Electrical Engineering University of Notre Dame, IN, USA Temperature dependence of locked mode in a Single-Electron Latch.
_____________________________________________________________ EE 666 April 14, 2005 Molecular quantum-dot cellular automata Yuhui Lu Department of Electrical.
1 Foundations of Software Design Lecture 3: How Computers Work Marti Hearst Fall 2002.
The Logic Machine We looked at programming at the high level and at the low level. The question now is: How can a physical computer be built to run a program?
Montek Singh COMP Aug 25,  Cellular automata  Quantum dot cellular automata (QCA)  Wires and gates using QCA  Implementation.
Homework Your task is to design a regular structure such as Kronecker Lattice or Shannon Lattice using modern Quantum Dot Cellular Automata technology.
Minimization Techniques for Reversible Logic Synthesis.
Optical Devices An Overview of Terms from Optical Computing.
Comparators A comparator compares two input words.
Comparators  A comparator compares two input words.  The following slide shows a simple comparator which takes two inputs, A, and B, each of length 4.
Successor of the Transistor
Capacitors II Physics 2415 Lecture 9 Michael Fowler, UVa.
Types of bonds Metallic Solids Ionic Solids Molecular Solids
Quantum Dots and Quantum Dot Cellular Automata SOURCES: –Rajarshi Mukhopadhyay, ece. gatech. Edu –Richard Spillman –Yan-Ten Lu, Physics, NCKU –Tony.
What you should learn: How compounds differ from the elements that make them How a chemical formula represent the ratio of atoms in a compound How the.
ELECTRICITY.
School of Computer Science G51CSA 1 Computer Systems Architecture Fundamentals Of Digital Logic.
Gerousis Toward Nano-Networks and Architectures C. Gerousis and D. Ball Department of Physics, Computer Science and Engineering Christopher Newport University.
Power Dissipation Bounds and Models for Quantum-dot Cellular Automata Circuits Saket Srivastava*, Sudeep Sarkar # and Sanjukta Bhanja* * Electrical Engineering,
Applications of Quantum Physics
Peter-Bernd Otte – Sep CB collaboration meeting, Edinburgh.
TECHNICAL SEMINAR ON TECHNOLOGIES AND DESIGNS FOR ELECTRONIC NANOCOMPUTERS PRESENTED BY : BIJAY KUMAR XESS ADMN NO : 4 I&E/2K.
Electrostatics Unit 11. Electric Charge Symbol: q Unit: Coulomb (C) Two kinds of Charge: Positive Negative Law of Electrostatics: Like charges REPEL-
Complementary CMOS Logic Style Construction (cont.)
What Do All These Pictures Have In Common?
Bayesian Macromodeling for Circuit Level QCA Design Saket Srivastava and Sanjukta Bhanja Department of Electrical Engineering University of South Florida,
Ionic Bonds and Ionic Compounds
Weds., Jan. 29, 2014PHYS , Dr. Andrew Brandt 1 PHYS 1442 – Section 004 Lecture #5 Wednesday January 29, 2014 Dr. Andrew Brandt CH 17 Electric Potential.
Electric Current and Resistance Physics. Potential Difference  Charges can “lose” potential energy by moving from a location at high potential (voltage)
Basic Sequential Components CT101 – Computing Systems Organization.
Extreme Computing 2005 Center for Nano Science and Technology University of Notre Dame Craig S. Lent University of Notre Dame Molecular QCA and the limits.
4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.
aka Electrovalent bonds
University of Notre Dame Lecture 19 - Intro to MQCA Nanomagnetic Logic Devices.
TYPES OF CHEMICAL BONDS
Nanotechnology.
Northeastern U N I V E R S I T Y 1 Design and Test of Fault Tolerant Quantum Dot Cellular Automata Electrical and Computer Department.
Cellular Automata Based Hamming Hash Family : Synthesis and Application CELLULAR AUTOMATA BASED HAMMING HASH FAMILY : SYNTHESIS AND APPLICATION Niloy Ganguly.
Introduction to Spintronics
S. E. Thompson EEL Quantum cellular Automata Quantum Cellular Automata (QCA) refers to any one of several models of quantum computation, which have.
Clocked Molecular Quantum-dot Cellular Automata
Introduction to Quantum Computing
1 Catalyst December 12, 2013 Summarize the properties of ionic compounds in complete sentences. Use page in the book if necessary.
Number Representation (Part 2) Computer Architecture (Fall 2006)
Implementing Tile-based Chip Multiprocessors with GALS Clocking Styles Zhiyi Yu, Bevan Baas VLSI Computation Lab, ECE Department University of California,
Bayesian Modeling of Quantum-Dot-Cellular-Automata Circuits Sanjukta Bhanja and Saket Srivastava Electrical Engineering, University of South Florida, Tampa,
Chapter 17-1b 1 When a balloon and your hair are charged by rubbing, only the rubbed areas become charged. 2.
Ionic Bonding (Part I) One Atom’s Loss (of an Electron) is Another Atom’s Gain.
COMBINATIONAL AND SEQUENTIAL CIRCUITS Guided By: Prof. P. B. Swadas Prepared By: BIRLA VISHVAKARMA MAHAVDYALAYA.
© 2014 Pearson Education, Inc. Building Blocks of the Universe.
LOGIC GATES. INTRODUCTION TO LOGIC GATES Boolean functions may be practically implemented by using electronic gates. The following points are important.
Chapter S4 Building Blocks of the Universe
Sequential Logic Design
Electromagnetic Induction
Digital Error Correction
Electric Current and Resistance
[ ] [ ] + - AQA BONDING, STRUCTURE AND THE PROPERTIES OF MATTER 1
Electromagnetic Induction
Frank Sill Torres1,2, Pedro A. Silva3, Geraldo Fontes3, José A. M
Synchronization of Clocked Field-Coupled Circuits
1DFKI GmbH (Germany), 2University of Bremen (Germany)
Electrostatics Charge
Agenda Lecture Content: Combinatorial Circuits Boolean Algebras
Presentation transcript:

Molecular Scale Architectures Quantum Cellular Automata and Molecular Combinatorial Logic By Jeff Kramer

Quantum Cellular Automata Quantum Cellular Automata (or QCA) is a method of transmitting and processing data via held charges in an array of quantum dots. These electrostatic interactions allow for truly amazing data flow and processing operations at nanoscale levels. “QCA wires, majority gates, clocked cell operation, and (recently) true power gain between QCA cells has been demonstrated.”(Lieberman)

QCA The basic QCA cell consists of 4 quantum dots and two spare electrons. These dots are oriented in a square, and the placement of the electrons determines the polarity (left to right = 1) Tunneling Energy is t Nearest Neighbor Distance is a

QCA The compensating positive charge is fixed, and the tunneling barriers between cells are assumed to be insurmountable. Adding a fifth center dot also improves the functionality of the cell.

QCA The barriers between cells being relatively high causes the electrons to be well localized on certain dots. This cell polarization due to Columbic interaction is what allows for data transfer. The two configurations

QCA The cell-cell transfer via Columbic interaction is shown on the right. Cell 2 is fixed and Cell 1’s response is measured. While the response is slightly non-linear, it still is very close to perfect switching. Cell Demo

QCA A cell can also be rotated 45 degrees. This has different special effects on the quantum tunneling and switching.

QCA Many different nanoscale devices are possible using quantum cellular automata. These devices mimic the traditional electronic devices we’re used to, albeit in a completely different manner, both conceptually and physically.

QCA Quantum wires are constructed by stringing together groups of CA and letting the Columbic interaction handle switching. The loss from cell to cell is very small, especially if tunneling barrier energies are high. Rotated cells have the same transmission properties but they also invert the response from every cell. Line Demo

QCA Inversion can also be performed by a dedicated inverter. This is constructed using the property of anti-alignment of cells. Inverter Demo

QCA Both a “fanout”, or branch, and a corner wire are simple to construct. The quantum cell alignment allows for transmission even around corners and to multiple cells. Fanout (top) and Corner Wire

QCA The majority gate allows for construction of AND/OR logic. By holding an input at 1, you force an OR on the other two outputs. By holding an input at 0, you force an AND of the other two outputs. With AND/OR, you can construct complex systems like full adders. Majority Gate Demo

QCA This is a coplanar cross. Rotated cells do not effect the polarization of regular cells and regular cells do not effect the polarization of rotated cells. This lets strange configurations like this actually function correctly. Notice that from A to B requires a large tunnel jump, and that the horizontal rotated cells are even in number.

QCA This is a full adder. Can you see the various parts that make it up? Bigger Picture

QCA Other recent advances include the construction of quantum amplifiers, memory systems that truly take advantage of the QCA’s special nature, and conceptual computer science pipelining experiments and changes. However, all of these experiments have been only completed with metal dot quantum cells at low temperatures. Work on molecular scale QCA’s is progressing but is running into several technical barriers.

QCA Any Questions?

Molecular Combinatorial Logic Don Eigler’s team at IBM used STM to manipulate carbon monoxide atoms on a sheet of gold, setting up a cascade that replicates the process of a three input sorter This all happens at a scale of 12X17 nanometers. It required only one eV to function, but had to be held near absolute zero and in hard vacuum.

Molecular Combinatorial Logic