Pith. sign in

REVIEW

Programmable skyrmion logic gates based on skyrmion tunneling

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2205.08198 v1 pith:CETNGI4J submitted 2022-05-17 cond-mat.mes-hall

Programmable skyrmion logic gates based on skyrmion tunneling

classification cond-mat.mes-hall
keywords logicskyrmionsdesigngatesprogrammableskyrmiondevicesfully
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Magnetic skyrmions are promising candidates as elementary nanoscale bits in logic-in-memory devices, intrinsically merging high density memory and computing capabilities. Here we exploit the dynamics of skyrmions interacting with anisotropy energy barriers patterned by ion irradiation to design programmable logic gates. Using micromagnetic simulations with experimental parameters, we show that a fine tuning of the barrier height and width allows the selective tunneling of skyrmions between parallel nanotracks triggered by skyrmion-skyrmion interaction. This can be leveraged to design skyrmion De-multiplexer (DMux) logic gate which works solely using skyrmions as logic inputs. By cascading and connecting demultiplexer gates with a specific topology, we develop a fully programmable logic gate capable of producing any possible logic output as a sum of all minterms generated by a given set of inputs without requiring any complex additional electric/magnetic interconversion. The proposed design is fully conservative and cascadable and paves a new pathway for full skyrmionic-based logic-in-memory devices.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.