Pith. sign in

REVIEW

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 1703.09419 v1 pith:GMCABB5J submitted 2017-03-28 cond-mat.mes-hall

Three-atom magnets with strong substrate coupling: a gateway towards non-collinear spin processing

classification cond-mat.mes-hall
keywords substrateatomsclusterinformationnon-collinearspinconceptscoupling
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

A cluster composed of a few magnetic atoms assembled on the surface of a nonmagnetic substrate is one suitable realization of a bit for future concepts of spin-based information technology. The prevalent approach to achieve magnetic stability of the bit is decoupling the cluster spin from substrate conduction electrons in order to suppress spin-flips destabilizing the bit. However, this route entails less flexibility in tailoring the coupling between the bits which is ultimately needed for spin-processing. Here, we show using a spin-resolved scanning tunneling microscope, that we can write, read, and store spin information for hours in clusters of only three atoms strongly coupled to a substrate featuring a cloud of non-collinearly polarized host atoms, a so called non-collinear giant moment cluster (GMC). The GMC can be driven into a Kondo screened state by simply moving one of its atoms to a different site. Owing to the exceptional atomic tunability of the non-collinear substrate mediated Dzyaloshinskii-Moriya interaction, novel concepts of spin-based information technology get within reach, as we demonstrate by a logical scheme for a four-bit register.

discussion (0)

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