Brian Sutton

Brian Sutton

Auto-generated profile, based on publicly available information

Brian Sutton

Department of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, 47906 USA

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 July 2017 in Physical Review X
Verified
Journal Article
Open access
PDF file
KCKerem Yunus Camsari
Kerem Yunus Camsari
RFRafatul Faria
Rafatul Faria
BSBrian M. Sutton
Brian M. Sutton
SDSupriyo Datta
Supriyo Datta
Conventional semiconductor-based logic and nanomagnet-based memory devices are built out of stable, deterministic units such as standard metal-oxide semiconductor transistors, or nanomagnets with energy barriers in excess of ≈40–60  kT. In this paper, we show that unstable, stochastic units, which we call “p-bits,” can be interconnected to create robust correlations that implement precise Boolean functions with impressive accuracy, comparable to standard digital circuits. At the same time, they are invertible, a unique property that is absent in standard digital circuits. When operated in the direct mode, the input is clamped, and the network provides the correct output. In the inverted mode, the output is clamped, and the network fluctuates among all possible inputs that are consistent with that output. First, we present a detailed implementation of an invertible gate to bring out the key role of a single three-terminal transistorlike building block to enable the construction of correlated p-bit networks. The results for this specific, CMOS-assisted nanomagnet-based hardware implementation agree well with those from a universal model for p-bits, showing that p-bits need not be magnet based: any three-terminal tunable random bit generator should be suitable. We present a general algorithm for designing a Boltzmann machine (BM) with a symmetric connection matrix [J] (Jij=Jji) that implements a given truth table with p-bits. The [J] matrices are relatively sparse with a few unique weights for convenient hardware implementation. We then show how BM full adders can be interconnected in a partially directed manner (Jij≠Jji) to implement large logic operations such as 32-bit binary addition. Hundreds of stochastic p-bits get precisely correlated such that the correct answer out of 233 (≈8×109) possibilities can be extracted by looking at the statistical mode or majority vote of a number of time samples. With perfect directivity (Jji=0) a small number of samples is enough, while for less directed connections more samples are needed, but even in the former case logical invertibility is largely preserved. This combination of digital accuracy and logical invertibility is enabled by the hybrid design that uses bidirectional BM units to construct circuits with partially directed interunit connections. We establish this key result with extensive examples including a 4-bit multiplier which in inverted mode functions as a factorizer.

15 March 2017 in Scientific Reports
Verified
Journal Article
Open access
PDF file
BSBrian Sutton
Brian Sutton
KCKerem Yunus Camsari
Kerem Yunus Camsari
BBBehtash Behin-Aein
Behtash Behin-Aein
SDSupriyo Datta
Supriyo Datta
This paper draws attention to a hardware system which can be engineered so that its intrinsic physics is described by the generalized Ising model and can encode the solution to many important NP-hard problems as its ground state. The basic constituents are stochastic nanomagnets which switch randomly between the ±1 Ising states and can be monitored continuously with standard electronics. Their mutual interactions can be short or long range, and their strengths can be reconfigured as needed to solve specific problems and to anneal the system at room temperature. The natural laws of statistical mechanics guide the network of stochastic nanomagnets at GHz speeds through the collective states with an emphasis on the low energy states that represent optimal solutions. As proof-of-concept, we present simulation results for standard NP-complete examples including a 16-city traveling salesman problem using experimentally benchmarked models for spin-transfer torque driven stochastic nanomagnets.

1 March 2019 in Applied Physics Reviews
Verified
Journal Article
Closed access
PDF file
KCKerem Y. Camsari
Kerem Y. Camsari
BSBrian M. Sutton
Brian M. Sutton
SDSupriyo Datta
Supriyo Datta
We introduce the concept of a probabilistic or p-bit, intermediate between the standard bits of digital electronics and the emerging q-bits of quantum computing. We show that low barrier magnets or LBMs provide a natural physical representation for p-bits and can be built either from perpendicular magnets designed to be close to the in-plane transition or from circular in-plane magnets. Magnetic tunnel junctions (MTJs) built using LBMs as free layers can be combined with standard NMOS transistors to provide three-terminal building blocks for large scale probabilistic circuits that can be designed to perform useful functions. Interestingly, this three-terminal unit looks just like the 1T/MTJ device used in embedded magnetic random access memory technology, with only one difference: the use of an LBM for the MTJ free layer. We hope that the concept of p-bits and p-circuits will help open up new application spaces for this emerging technology. However, a p-bit need not involve an MTJ; any fluctuating resistor could be combined with a transistor to implement it, while completely digital implementations using conventional CMOS technology are also possible. The p-bit also provides a conceptual bridge between two active but disjoint fields of research, namely, stochastic machine learning and quantum computing. First, there are the applications that are based on the similarity of a p-bit to the binary stochastic neuron (BSN), a well-known concept in machine learning. Three-terminal p-bits could provide an efficient hardware accelerator for the BSN. Second, there are the applications that are based on the p-bit being like a poor man's q-bit. Initial demonstrations based on full SPICE simulations show that several optimization problems, including quantum annealing are amenable to p-bit implementations which can be scaled up at room temperature using existing technology.

21 August 2020 in IEEE Access
Verified
Journal Article
Open access
BSBrian Sutton
Brian Sutton
RFRafatul Faria
Rafatul Faria
LGLakshmi Anirudh Ghantasala
Lakshmi Anirudh Ghantasala
RJRisi Jaiswal
Risi Jaiswal
KCKerem Yunus Camsari
Kerem Yunus Camsari
SDSupriyo Datta
Supriyo Datta
In this paper we present a concrete design for a probabilistic (p-) computer based on a network of p-bits, robust classical entities fluctuating between -1 and +1, with probabilities that are controlled through an input constructed from the outputs of other p-bits. The architecture of this probabilistic computer is similar to a stochastic neural network with the p-bit playing the role of a binary stochastic neuron, but with one key difference: there is no sequencer used to enforce an ordering of p-bit updates, as is typically required. Instead, we explore sequencerless designs where all p-bits are allowed to flip autonomously and demonstrate that such designs can allow ultrafast operation unconstrained by available clock speeds without compromising the solution’s fidelity. Based on experimental results from a hardware benchmark of the autonomous design and benchmarked device models, we project that a nanomagnetic implementation can scale to achieve petaflips per second with millions of neurons. A key contribution of this paper is the focus on a hardware metric – flips per second– as a problem and substrate-independent figure-of-merit for an emerging class of hardware annealers known as Ising Machines. Much like the shrinking feature sizes of transistors that have continually driven Moore’s Law, we believe that flips per second can be continually improved in later technology generations of a wide class of probabilistic, domain specific hardware.

30 October 2018 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
APAhmed Zeeshan Pervaiz
Ahmed Zeeshan Pervaiz
BSBrian M. Sutton
Brian M. Sutton
LGLakshmi Anirudh Ghantasala
Lakshmi Anirudh Ghantasala
KCKerem Y. Camsari
Kerem Y. Camsari
Probabilistic spin logic is a recently proposed computing paradigm based on unstable stochastic units called probabilistic bits (p-bits) that can be correlated to form probabilistic circuits (p-circuits). These p-circuits can be used to solve the problems of optimization, inference, and implement precise Boolean functions in an ``inverted'' mode, where a given Boolean circuit can operate in reverse to find the input combinations that are consistent with a given output. In this brief, we present a scalable field-programmable gate array implementation of such invertible p-circuits. We implement a ``weighted'' p-bit that combines stochastic units with localized memory structures. We also present a generalized tile of weighted p-bits to which a large class of problems beyond invertible Boolean logic can be mapped and how invertibility can be applied to interesting problems such as the NP-complete subset sum problem by solving a small instance of this problem in hardware.

9 December 2015 in Scientific Reports
Verified
Journal Article
Open access
BSBrian Sutton
Brian Sutton
SDSupriyo Datta
Supriyo Datta
The use of spin torque as a substitute for magnetic fields is now well established for classical operations like the switching of a nanomagnet. What we are describing here could be viewed as an application of spin torque like effects to quantum processes involving single qubit rotations as well as two qubit entanglement. A key ingredient of this scheme is the use of a large number of itinerant electrons whose cumulative effect is to produce the desired qubit operations on static spins. Each interaction involves entanglement and collapse of wavefunctions so that the operation is only approximately unitary. However, we show that the non-unitary component of the operations can be kept below tolerable limits with proper design. As a capstone example, we present the implementation of a complete CNOT gate using the proposed spin potential based architecture and show that the fidelity under ideal conditions can be made acceptably close to one.