CMOS-compatible Ising and Potts Annealing Using Single
Photon Avalanche Diodes

Nelson, Zachary; Theogarajan, Luke

doi:10.21203/rs.3.rs-2313657/v1

Cited by 4 publications

(2 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Estimates of sMTJs-based p-bits suggest they can create a random bit using 2 fJ per operation [18]. Recently, a CMOS-compatible single photon avalanche diodebased implementation of p-bits showed similar, amplifierfree operation [84] and the search for the most scalable, energy-efficient hardware p-bit using alternative phenomena continues.…”

Section: Mixed-signalmentioning

confidence: 99%

A Full-Stack View of Probabilistic Computing With p-Bits: Devices, Architectures, and Algorithms

Chowdhury

Grimaldi

Aadit

et al. 2023

IEEE J. Explor. Solid-State Comput. Devices Circuits

View full text Add to dashboard Cite

The transistor celebrated its 75 th birthday in 2022. The continued scaling of the transistor defined by Moore's Law continues, albeit at a slower pace. Meanwhile, computing demands and energy consumption required by modern artificial intelligence (AI) algorithms have skyrocketed. As an alternative to scaling transistors for general-purpose computing, the integration of transistors with unconventional technologies has emerged as a promising path for domain-specific computing. In this article, we provide a full-stack review of probabilistic computing with p-bits as a representative example of the energy-efficient and domain-specific computing movement. We argue that p-bits could be used to build energy-efficient probabilistic systems, tailored for probabilistic algorithms and applications. From hardware, architecture, and algorithmic perspectives, we outline the main applications of probabilistic computers ranging from probabilistic machine learning and AI to combinatorial optimization and quantum simulation. Combining emerging nanodevices with the existing CMOS ecosystem will lead to probabilistic computers with orders of magnitude improvements in energy efficiency and probabilistic sampling, potentially unlocking previously unexplored regimes for powerful probabilistic algorithms.

show abstract

Section: Mixed-signalmentioning

confidence: 99%

A Full-Stack View of Probabilistic Computing With p-Bits: Devices, Architectures, and Algorithms

Chowdhury

Grimaldi

Aadit

et al. 2023

IEEE J. Explor. Solid-State Comput. Devices Circuits

View full text Add to dashboard Cite

show abstract

“…Recently, Ising machines, efficient solvers specialized in Quadratic Unconstrained Binary Optimization (QUBO) problems have become available [43][44][45][46][47]. Ising machines include quantum annealing machines, which are non-Neumann-type computers that physically exploit quantum effects to accelerate computation [46].…”

Section: Introductionmentioning

confidence: 99%

ISAAQ: Ising Machine Assisted Quantum Compiler

Naito¹,

Hasegawa²,

Matsuda³

et al. 2023

Preprint

View full text Add to dashboard Cite

It is imperative to compile quantum circuits for Noisy Intermediate-Scale Quantum (NISQ) devices because of the limited connectivity of physical qubits and the high error rates of gate operations. One of the most critical steps in quantum circuit compilation is qubit routing, an NP-Hard problem that involves placing and moving logical qubits to minimize compilation overhead. In this study, we propose ISing mAchine Assisted Quantum compiler (ISAAQ) to perform qubit routing with Ising machines, which can efficiently solve Quadratic Unconstrained Binary Optimization (QUBO) problems. ISAAQ accurately estimates the compilation costs by updating itself using previous compilation results, and accelerates qubit routing by solving QUBO problems in parallel with multiple Ising machines. In addition, ISAAQ exploits a cost-reduction method that implements commutative logical Controlled-NOT (CNOT) gates with fewer physical CNOT gates, which is particularly effective for planar devices when implementing original gates. Experimental results on both IBM QX5 and IBM QX20 show that ISAAQ outperforms the heuristic methods available in Qiskit and tket, as well as an existing QUBO method, requiring fewer physical CNOT gates for most benchmark circuits. ISAAQ performs particularly well on large circuits, demonstrating its strong scalability with respect to the number of logical CNOT gates.

show abstract

Memory-compatible perpendicular magnetic tunnel junctions under bi-directional strobe write pulses: A method for generating true random number bits at high speed

Sun

2024

Journal of Applied Physics

View full text Add to dashboard Cite

We propose an operation method of generating true random number bits with a perpendicular magnetic tunnel junction (pMTJ) already in use as a memory element in spin-transfer-torque driven magnetic random access memory technology. This method uses a set of regularly spaced (or intentionally irregularly spaced), minimum width, and bi-directional fast strobe-write pulses, with read operations after each write. The resulting bit-stream’s statistical properties are analyzed, and a few digital logic operation following the read is described that could significantly improve the resulting bit-streams variance and stability, insulating those from the raw variations of pMTJs.

show abstract

CMOS-compatible Ising and Potts Annealing Using Single Photon Avalanche Diodes

Cited by 4 publications

References 33 publications

A Full-Stack View of Probabilistic Computing With p-Bits: Devices, Architectures, and Algorithms

A Full-Stack View of Probabilistic Computing With p-Bits: Devices, Architectures, and Algorithms

ISAAQ: Ising Machine Assisted Quantum Compiler

Memory-compatible perpendicular magnetic tunnel junctions under bi-directional strobe write pulses: A method for generating true random number bits at high speed

Contact Info

Product

Resources

About