A functionally reversible probabilistic computing architecture enabled by interactions of current-controlled magnetic devices
Abstract
Probabilistic computers replace logic gates with networks of interacting random variables, creating bidirectional systems that can back-derive inputs from outputs. Such architectures enable efficient generation of random samples, implementations of novel algorithms, and natural solutions to classically hard problems such as prime factorization. We present a new physical implementation for these networks: ferromagnetic disks whose magnetization switching process is triggered by current pulses, skewed by external magnetic fields, and randomized by ambient thermal noise. We show that geometry-dependent magnetostatic interactions between these magnetic cells lead to system behavior that emulates deterministic logic gates. Furthermore, by chaining multiple "gates," we achieve a highly accurate bidirectional one-bit full-adder, a proof of concept for complex multi-gate logic functions with reversible information flow. This analog magnetic probabilistic computer methodology improves on other implementations in speed, tunability, and energy efficiency, thereby enabling a powerful new pathway towards practical solution of classically hard problems.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.