Bayesian Modeling of Quantum-Dot-Cellular-Automata Circuits Sanjukta Bhanja and Saket Srivastava Electrical Engineering, University of South Florida, Tampa,

Slides:



Advertisements
Similar presentations
Bayesian networks Chapter 14 Section 1 – 2. Outline Syntax Semantics Exact computation.
Advertisements

ADDER, HALF ADDER & FULL ADDER
Making Simple Decisions
Junction Trees And Belief Propagation. Junction Trees: Motivation What if we want to compute all marginals, not just one? Doing variable elimination for.
1 Knowledge Engineering for Bayesian Networks. 2 Probability theory for representing uncertainty l Assigns a numerical degree of belief between 0 and.
Introduction of Probabilistic Reasoning and Bayesian Networks
Hidden Markov Models M. Vijay Venkatesh. Outline Introduction Graphical Model Parameterization Inference Summary.
GS 540 week 6. HMM basics Given a sequence, and state parameters: – Each possible path through the states has a certain probability of emitting the sequence.
Montek Singh COMP Oct 11,  Today’s topics: ◦ more on error metrics ◦ more applications ◦ architectures and design tools ◦ challenges and.
Bayesian Networks Chapter 2 (Duda et al.) – Section 2.11
Inference in Bayesian Nets
_____________________________________________________________ EE 666 April 14, 2005 Molecular quantum-dot cellular automata Yuhui Lu Department of Electrical.
Bayesian networks Chapter 14 Section 1 – 2.
Bayesian Belief Networks
Montek Singh COMP Aug 25,  Cellular automata  Quantum dot cellular automata (QCA)  Wires and gates using QCA  Implementation.
Propagation in Poly Trees Given a Bayesian Network BN = {G, JDP} JDP(a,b,c,d,e) = p(a)*p(b|a)*p(c|e,b)*p(d)*p(e|d) a d b e c.
A Fault-tolerant Architecture for Quantum Hamiltonian Simulation Guoming Wang Oleg Khainovski.
ENGIN112 L12: Circuit Analysis Procedure September 29, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 12 Circuit Analysis Procedure.
Emerging Logic Devices
Quiz 4: Mean: 7.0/8.0 (= 88%) Median: 7.5/8.0 (= 94%)
Spatial Analyst Toolbox Lecture 17. Spatial Analyst Tool Sets  Conditional  Density  Distance  Generalization  Ground Water  Interpolation  Conditional.
CS 4100 Artificial Intelligence Prof. C. Hafner Class Notes March 13, 2012.
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,
CPT tools Very much a work in progress. Manipulating CPTs numericPartSplits a mixed data frame into a numeric matrix and a factor part. rescaleTableRescales.
Bayesian Macromodeling for Circuit Level QCA Design Saket Srivastava and Sanjukta Bhanja Department of Electrical Engineering University of South Florida,
Introduction to Bayesian Networks
Jeffrey Zheng School of Software, Yunnan University August 4, nd International Summit on Integrative Biology August 4-5, 2014 Chicago, USA.
4. Combinational Logic Networks Layout Design Methods 4. 2
ECE 8443 – Pattern Recognition ECE 8527 – Introduction to Machine Learning and Pattern Recognition Objectives: Reestimation Equations Continuous Distributions.
PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 8: GRAPHICAL MODELS.
T06-02.S - 1 T06-02.S Standard Normal Distribution Graphical Purpose Allows the analyst to analyze the Standard Normal Probability Distribution. Probability.
Introduction to Nano- computing for K-8 Students Sanjukta Bhanja and Javier Pulecio Assistant Professor, PhD student University of South Florida.
QCAdesigner – CUDA HPPS project
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.
MODELING MATTER AT NANOSCALES 6.The theory of molecular orbitals for the description of nanosystems (part II) The density matrix.
Lecture 2: Statistical learning primer for biologists
Molecular Scale Architectures Quantum Cellular Automata and Molecular Combinatorial Logic By Jeff Kramer.
Bayesian networks and their application in circuit reliability estimation Erin Taylor.
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
Learning and Acting with Bayes Nets Chapter 20.. Page 2 === A Network and a Training Data.
Pattern Recognition and Machine Learning
Introduction on Graphic Models
ECE 8443 – Pattern Recognition ECE 8527 – Introduction to Machine Learning and Pattern Recognition Objectives: Reestimation Equations Continuous Distributions.
Belief Networks Kostas Kontogiannis E&CE 457. Belief Networks A belief network is a graph in which the following holds: –A set of random variables makes.
Conditional Independence As with absolute independence, the equivalent forms of X and Y being conditionally independent given Z can also be used: P(X|Y,
An Algorithm to Learn the Structure of a Bayesian Network Çiğdem Gündüz Olcay Taner Yıldız Ethem Alpaydın Computer Engineering Taner Bilgiç Industrial.
CS 2750: Machine Learning Bayesian Networks Prof. Adriana Kovashka University of Pittsburgh March 14, 2016.
CS 2750: Machine Learning Review
CS 2750: Machine Learning Directed Graphical Models
Bayesian networks Chapter 14 Section 1 – 2.
Presented By S.Yamuna AP/CSE
Inference in Bayesian Networks
Probabilistic Data Management
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
Artificial Intelligence
Structure and Semantics of BN
Generalized Belief Propagation
Propagation Algorithm in Bayesian Networks
Frank Sill Torres1,2, Pedro A. Silva3, Geraldo Fontes3, José A. M
CS 188: Artificial Intelligence
KS4 Electricity – Electronic systems
DIGITAL ELECTRONICS B.SC FY
1DFKI GmbH (Germany), 2University of Bremen (Germany)
LECTURE 15: REESTIMATION, EM AND MIXTURES
Structure and Semantics of BN
Belief Networks CS121 – Winter 2003 Belief Networks.
Presentation transcript:

Bayesian Modeling of Quantum-Dot-Cellular-Automata Circuits Sanjukta Bhanja and Saket Srivastava Electrical Engineering, University of South Florida, Tampa, Florida, USA. P ss is the steady state polarization. E is the total kink energy of neighboring cells. Ω is the Rabi frequency and Δ is the thermal ratio. and are the probabilities of observing the system in each of the two states. and where & H is the Hamiltonian of a QCA Cell using Hartree approximation. E k is the kink energy. γ is the tunneling energy. f i is the geometric distance factor. is the weighted sum of neighborhood polarizations. Quantum-Dot Cellular Automata (QCA) Overview P=+1 P=-1 In a QCA cell two electrons occupy diagonally opposite dots in the cell due to mutual repulsion of like charges. Hence a QCA cell can be in any one of the two possible states depending on the polarization of charges in the cell. Electrostatic Interaction between charges in two QCA Cells Is given as: This interaction is determines the kink energy between two cells. E kink = E opp. polarization – E same polarization Purpose: Fast Bayesian Computing Model Quick Estimation and Comparison of Quantum Mechanical Quantities in QCA Circuits Directly models the quantum mechanical steady state probabilities Computation Model using Hartree Approximation Bayesian Network based Modeling Results Results of our Bayesian model of a three input clocked majority gate, Inverter and Full Adder. The Bayesian Network structure shown here is based on the flow of the wave function and information regarding the clock. We used Hugin software tool for Bayesian inference. We also show the temperature and input dependence on the probability of the output node in the Graph. We have also successfully modeled other logic circuits. The output node probabilities of all the models have similar dependence on temperature and the applied input vector (a) QCA Clocked Majority Gate (b) Bayesian net Structure (c) Temperature and Input Dependence (a) QCA Inverter (b) Bayesian model Bayesian Network is a DAG in which: Nodes: Random variables Links: Causal dependencies amongst random variables. Each Node has a Conditional Probability Table (CPT) that quantifies the effect of parents on that node. Ne(X) = set of all neighboring cells that can effect a cell X. C(X) = Clocking zone of cell X. T(X) = Time taken by wave function to propagate from the inputs or from the nodes nearest to the previous clock zone. Pa(X) = Parent set of cell X. Ch(X) = Non parent neighbors of X. Joint Probability Distribution function: Minimal factored Joint Probability Distribution function: General representation: How do we model Causality? Clocks determine the causal order between cells. Within each clock zone causality is determined by the direction of propagation of wave function. How do we perform ground state calculation? We choose children states so as to maximize Ω, which would minimize ground state energy over all possible ground states of the cell. Steady state density matrix diagonal entries are used with child state assignments (ch*(X)) to determine the CPT of all cells in the Bayesian Network. (a) QCA Majority Gate (b) Bayesian model