SearcharxivSearch

arXiv subjects

Eleonora Raimondo

Publications and source records attributed to Eleonora Raimondo.

18 recordsLinked to original sources

Fractional parametric resonance in spintronic diodes

Parametric pumping is a powerful tool for the excitation, amplification, and processing of oscillations and waves of different nature. In general, parametric resonance can occur when the pumping frequency $f_p$ and eigenfrequency of a linear mode (or wave) $f_0$ satisfy the relation $f_p$=2$f_0$/n (n=1,2,3,...). While such parametric resonance is well known in mechanical, superconductive, and quantum systems, in magnetic and spintronic systems only the lowest (n=1) parametric resonance at double the spin wave mode frequency $f_p$=2$f_0$ was thoroughly studied and explored. Here, using a theoretical analysis based on both micromagnetic simulations and an analytical model, we show the emergence of resonances at fractional frequencies $f_p$=2$f_0$/n (with n>10) in spintronic diodes driven by the simultaneous action of ac spin-transfer torque (STT, current densities < $10^6$ A/cm2) and voltage-controlled magnetic anisotropy (VCMA, effective anisotropy fields < 50 mT). The analytical model shows that parametric magnetization dynamics is irreducible to the standard Mathieu model of a parametric oscillator and demonstrates the crucial role of VCMA-driven mode frequency modulation: together with parametric coupling, it results in higher-order odd (n=3,5,7,...) fractional resonances, observed above certain VCMA pumping threshold, while simultaneous action with linear STT drive produces thresholdless even (n=4,6,8,...) resonances. This higher-order parametric dynamics is not restricted to VCMA pumping and opens new directions for the application of spintronic diodes for nonlinear signal processing and electromagnetic energy harvesting.

cond-mat.mes-hall

A scalable and resource-efficient pipelined p-computer for probabilistic Ising machines

Probabilistic Ising machines (PIMs) based on probabilistic bits offer a hardware-friendly route to solve combinatorial optimization problems, but most digital implementations achieve high throughput by exploiting sparse interactions. This limits their applicability to dense problems, for which memory bandwidth and data movement become the dominant bottlenecks. Here, we show a resource-efficient pipelined Field-Programmable Gate Array architecture enabling high-throughput execution of fully-connected PIMs while maintaining scalability and modularity. This architecture design combines a deeply pipelined (>20 stages) probabilistic bit update path, which overlaps spin evaluation and local-field updates, with a bandwidth-aware on-chip memory organization for the coupling and bias matrices. The architecture supports 512 p-bits with 16-bit fixed-point coefficients and 1024 and 2048 p-bits with 10-bit and 2-bit coefficients, respectively, and operates at up to 300 MHz. At fixed degree of parallelization, it delivers an order-of-magnitude higher update rate than an optimized non-pipelined baseline, while improving the time-area trade-off for dense workloads. Validation on portfolio optimization and low-density parity-check decoding shows close agreement with software references and substantial reductions in time-to-solution relative to the non-pipelined design, establishing pipelining as an effective route to scalable digital probabilistic computing for dense optimization problems.

eess.SY

Physics-Inspired Probabilistic Computing for Extremely Large-Scale MIMO Detection in Future 6G Wireless Systems

Extremely large-scale multiple-input multiple-output (XL-MIMO) architectures are a key enabler of forthcoming 6G wireless communication networks by allowing high data rates through massive spatial multiplexing. Here, we approach these problems with physics-inspired unconventional computing based on Ising machines (IMs). For binary modulation, probabilistic IMs (PIMs) and oscillator-based IMs achieve optimal ML detection with systems up to 2048x2048 antennas with only 100 iterations, matching optimal sphere decoder performance for computationally treatable sizes and outperforming the minimum mean-square error (MMSE) industrial standard. For M-QAM up to 256, a generalized PIM-inspired framework, based on d-dimensional probabilistic variables (p-dits) that directly encode QAM symbols, shows low bit-error-rate across sizes up to 256x256 antennas, outperforming or matching MMSE with reduced algorithmic complexity. Unlike the binary mapping, the p-dit interaction matrix is independent of the QAM order, enabling adaptive MIMO modulation. These results show a promising scalable paradigm for XL MIMO detection in future 6G networks.

cs.IT

Trainable Neuromorphic Spintronic Hardware Via Analog Finite-Difference Gradient Methods

Spintronic nano-neurons offer a promising route towards energy-efficient, high-performance hardware neural networks thanks to their inherent low-input nonlinear dynamics. However, training such networks remains a major bottleneck as it depends on oversimplified models of device behaviour and is highly sensitive to device variability. Here, we introduce a hardware architecture that overcomes these limitations by enabling on-device generation of gradients. First, we introduce theoretically and demonstrate experimentally that magnetic tunnel junctions can generate tunable and complex nonlinear responses. Building on this, we implement an analogue finite-difference approach to enable on-chip training in spintronic neural networks with one and two hidden layers. We experimentally implemented device in the loop backpropagation in a magnetic tunnel junction based neural network, achieving a classification accuracy of 93.3% despite pronounced device variability. During training, the gradients generated by the proposed analog neurons closely match the values derived numerically, without incurring computational overhead. Via physical simulations, we also demonstrate that this approach can be scaled up to support training in deep architectures. Our results pave the way for reliable, trainable and fully analogue spintronic neural networks, opening up new possibilities for next-generation, energy-efficient artificial intelligence hardware.

cond-mat.mes-hall

Field-programmable dynamics in a soft magnetic actuator enabling true random number generation and reservoir computing

Complex and even chaotic dynamics, though prevalent in many natural and engineered systems, has been largely avoided in the design of electromechanical systems due to concerns about wear and controlability. Here, we demonstrate that complex dynamics might be particularly advantageous in soft robotics, offering new functionalities beyond motion not easily achievable with traditional actuation methods. We designed and realized resilient magnetic soft actuators capable of operating in a tunable dynamic regime for tens of thousands cycles without fatigue. We experimentally demonstrated the application of these actuators for true random number generation and stochastic computing. {W}e validate soft robots as physical reservoirs capable of performing Mackey--Glass time series prediction. These findings show that exploring the complex dynamics in soft robotics would extend the application scenarios in soft computing, human-robot interaction and collaborative robots as we demonstrate with biomimetic blinking and randomized voice modulation.

cs.RO

Adaptive Ising machine based on phase-locking of an auto-oscillator to a bi-harmonic external driving with noise

We introduce a universal theory of phase auto-oscillators driven by a bi harmonic signal (having frequency components close to single and double of the free-running oscillator frequency) with noise. With it, we show how deterministic phase locking and stochastic phase slips can be continuously tuned by varying the relative amplitudes and frequencies of the driving components. Using, as an example, a spin-torque nano-oscillator, we numerically validate this theory by implementing a deterministic Ising machine paradigm, a probabilistic one, and dual-mode operation of the two. This demonstration introduces the concept of adaptive Ising machines (AIM), a unified oscillator-based architecture that dynamically combines both regimes within the same hardware platform by properly tuning the amplitudes of the bi-harmonic driving relative to the noise strength. Benchmarking on different classes of combinatorial optimization problems, the AIM exhibits complementary performance compared to oscillator based Ising machines and probabilistic Ising machines, with adaptability to the specific problem class. This work introduces the first OIM capable of transitioning between deterministic and probabilistic computation taking advantage of a proper design of the trade-off between the strength of phase-locking of an auto-oscillator to a bi harmonic external driving and noise, opening a path toward scalable, CMOS compatible hardware for hybrid optimization and inference.

cond-mat.mes-hall

Pushing the Boundary of Quantum Advantage in Hard Combinatorial Optimization with Probabilistic Computers

Recent demonstrations on specialized benchmarks have reignited excitement for quantum computers, yet whether they can deliver an advantage for practical real-world problems remains an open question. Here, we show that probabilistic computers (p-computers), when co-designed with hardware to implement powerful Monte Carlo algorithms, provide a compelling and scalable classical pathway for solving hard optimization problems. We focus on two key algorithms applied to 3D spin glasses: discrete-time simulated quantum annealing (DT-SQA) and adaptive parallel tempering (APT). We benchmark these methods against the performance of a leading quantum annealer on the same problem instances. For DT-SQA, we find that increasing the number of replicas improves residual energy scaling, in line with expectations from extreme value theory. We then show that APT, when supported by non-local isoenergetic cluster moves, exhibits a more favorable scaling and ultimately outperforms DT-SQA. We demonstrate these algorithms are readily implementable in modern hardware, projecting that custom Field Programmable Gate Arrays (FPGA) or specialized chips can leverage massive parallelism to accelerate these algorithms by orders of magnitude while drastically improving energy efficiency. Our results establish a new, rigorous classical baseline, clarifying the landscape for assessing a practical quantum advantage and presenting p-computers as a scalable platform for real-world optimization challenges.

quant-ph

250 Magnetic Tunnel Junctions-Based Probabilistic Ising Machine

In combinatorial optimization, probabilistic Ising machines (PIMs) have gained significant attention for their acceleration of Monte Carlo sampling with the potential to reduce time-to-solution in finding approximate ground states. However, to be viable in real applications, further improvements in scalability and energy efficiency are necessary. One of the promising paths toward achieving this objective is the development of a co-design approach combining different technology layers including device, circuits and algorithms. Here, we experimentally demonstrate a fully connected PIM architecture based on 250 spin-transfer torque magnetic tunnel junctions (STT-MTJs), interfaced with an FPGA. Our computing approach integrates STT-MTJ-based tunable true random number generators with advanced annealing techniques, enabling the solution of problems with any topology and size. For sparsely connected graphs, the massive parallel architecture of our PIM enables a cluster parallel update method that overcomes the serial limitations of Gibbs sampling, leading to a 10 times acceleration without hardware changes. Furthermore, we prove experimentally that the simulated quantum annealing boosts solution quality 20 times over conventional simulated annealing while also increasing robustness to MTJ variability. Short pulse switching measurements indicate that STT-MTJ-based PIMs can potentially be 10 times faster and 10 times more energy-efficient than graphic processing units, which paves the way for future large-scale, high-performance, and energy-efficient unconventional computing hardware implementations.

cond-mat.mtrl-sci

High-performance and reliable probabilistic Ising machine based on simulated quantum annealing

Probabilistic computing with pbits is emerging as a computational paradigm for machine learning and for facing combinatorial optimization problems (COPs) with the so-called probabilistic Ising machines (PIMs). From a hardware point of view, the key elements that characterize a PIM are the random number generation, the nonlinearity, the network of coupled pbits, and the energy minimization algorithm. Regarding the latter, in this work we show that PIMs using the simulated quantum annealing (SQA) schedule exhibit better performance as compared to simulated annealing and parallel tempering in solving a number of COPs, such as maximum satisfiability problems, planted Ising problem, and travelling salesman problem. Additionally, we design and simulate the architecture of a fully connected CMOS based PIM able to run the SQA algorithm having a spin-update time of 8 ns with a power consumption of 0.22 mW. Our results also show that SQA increases the reliability and the scalability of PIMs by compensating for device variability at an algorithmic level enabling the development of their implementation combining CMOS with different technologies such as spintronics. This work shows that the characteristics of the SQA are hardware agnostic and can be applied in the co-design of any hybrid analog digital Ising machine implementation. Our results open a promising direction for the implementation of a new generation of reliable and scalable PIMs.

cond-mat.mes-hall

Integrated probabilistic computer using voltage-controlled magnetic tunnel junctions as its entropy source

Probabilistic Ising machines (PIMs) provide a path to solving many computationally hard problems more efficiently than deterministic algorithms on von Neumann computers. Stochastic magnetic tunnel junctions (S-MTJs), which are engineered to be thermally unstable, show promise as entropy sources in PIMs. However, scaling up S-MTJ-PIMs is challenging, as it requires fine control of a small magnetic energy barrier across large numbers of devices. In addition, non-spintronic components of S-MTJ-PIMs to date have been primarily realized using general-purpose processors or field-programmable gate arrays. Reaching the ultimate performance of spintronic PIMs, however, requires co-designed application-specific integrated circuits (ASICs), combining CMOS with spintronic entropy sources. Here we demonstrate an ASIC in 130 nm foundry CMOS, which implements integer factorization as a representative hard optimization problem, using PIM-based invertible logic gates realized with 1143 probabilistic bits. The ASIC uses stochastic bit sequences read from an adjacent voltage-controlled (V-) MTJ chip. The V-MTJs are designed to be thermally stable in the absence of voltage, and generate random bits on-demand in response to 10 ns pulses using the voltage-controlled magnetic anisotropy effect. We experimentally demonstrate the chip's functionality and provide projections for designs in advanced nodes, illustrating a path to millions of probabilistic bits on a single CMOS+V-MTJ chip.

physics.app-ph

A design of magnetic tunnel junctions for the deployment of neuromorphic hardware for edge computing

The electrically readable complex dynamics of robust and scalable magnetic tunnel junctions (MTJs) offer promising opportunities for advancing neuromorphic computing. In this work, we present an MTJ design with a free layer and two polarizers capable of computing the sigmoidal activation function and its gradient at the device level. This design enables both feedforward and backpropagation computations within a single device, extending neuromorphic computing frameworks previously explored in the literature by introducing the ability to perform backpropagation directly in hardware. Our algorithm implementation reveals two key findings: (i) the small discrepancies between the MTJ-generated curves and the exact software-generated curves have a negligible impact on the performance of the backpropagation algorithm, (ii) the device implementation is highly robust to inter-device variation and noise, and (iii) the proposed method effectively supports transfer learning and knowledge distillation. To demonstrate this, we evaluated the performance of an edge computing network using weights from a software-trained model implemented with our MTJ design. The results show a minimal loss of accuracy of only 0.1% for the Fashion MNIST dataset and 2% for the CIFAR-100 dataset compared to the original software implementation. These results highlight the potential of our MTJ design for compact, hardware-based neural networks in edge computing applications, particularly for transfer learning.

physics.app-ph

Nanoscale spin rectifiers for harvesting ambient radiofrequency energy

Radiofrequency harvesting using ambient wireless energy could be used to reduce the carbon footprint of electronic devices. However, ambient radiofrequency energy is weak (less than -20 dBm), and thermodynamic limits and high-frequency parasitic impedance restrict the performance of state-of-the-art radiofrequency rectifiers. Nanoscale spin rectifiers based on magnetic tunnel junctions have recently demonstrated high sensitivity, but suffer from a low a.c.-to-d.c. conversion efficiency (less than 1%). Here, we report a sensitive spin rectifier rectenna that can harvest ambient radiofrequency signals between -62 and -20 dBm. We also develop an on-chip co-planar waveguide-based spin rectifier array with a large zero-bias sensitivity (around 34,500 mV/mW) and high efficiency (7.81%). Self-parametric excitation driven by voltage-controlled magnetic anisotropy is a key mechanism that contributes to the performance of the spin-rectifier array. We show that these spin rectifiers can wirelessly power a sensor at a radiofrequency power of -27 dBm.

cond-mat.mtrl-sci

A magneto-mechanical accelerometer based on magnetic tunnel junctions

Accelerometers have widespread applications and are an essential component in many areas such as automotive, consumer electronics and industrial applications. Most commercial accelerometers are based on micro-electromechanical system (MEMS) that are limited in downscaling and power consumption. Spintronics-based accelerometers have been proposed as alternatives, however, current proposals suffer from design limitations that result in reliability issues and high cost. Here we propose spintronic accelerometers with magnetic tunnel junctions (MTJs) as building block, which map accelerations into a measurable voltage across the MTJ terminals. The device exploits elastic and dipolar coupling as a sensing mechanism and the spintronic diode effect for the direct read out of the acceleration. The proposed technology represents a potentially competitive and scalable solution to current capacitive MEMS-based approaches that could lead to a step forward in many of the commercial applications.

physics.app-ph

Manipulation of magnetic solitons under the influence of DMI gradients

Magnetic solitons are promising for applications due to their intrinsic properties such as small size, topological stability, ultralow power manipulation and potentially ultrafast operations. To date, research has focused on the manipulation of skyrmions, domain walls, and vortices by applied currents. The discovery of new methods to control magnetic parameters, such as the interfacial Dzyaloshinskii-Moriya interaction (DMI) by strain, geometry design, temperature gradients, and applied voltages promises new avenues for energetically efficient manipulation of magnetic structures. The latter has shown significant progress in 2d material-based technology. In this work, we present a comprehensive study using numerical and analytical methods of the stability and motion of different magnetic textures under the influence of DMI gradients. Our results show that under the influence of linear DMI gradients, Néel and Bloch-type skyrmions and radial vortex exhibit motion with finite skyrmion Hall angle, while the circular vortex undergoes expulsion dynamics. This work provides a deeper and crucial understanding of the stability and gradient-driven dynamics of magnetic solitons, and paves the way for the design of alternative low-power sources of magnetization manipulation in the emerging field of 2d materials.

cond-mat.mes-hall

Evaluating spintronics-compatible implementations of Ising machines

The commercial and industrial demand for the solution of hard combinatorial optimization problems push forward the development of efficient solvers. One of them is the Ising machine which can solve combinatorial problems mapped to Ising Hamiltonians. In particular, spintronic hardware implementations of Ising machines can be very efficient in terms of area and performance, and are relatively low-cost considering the potential to create hybrid CMOS-spintronic technology. Here, we perform a comparison of coherent and probabilistic paradigms of Ising machines on several hard Max-Cut instances, analyzing their scalability and performance at software level. We show that probabilistic Ising machines outperform coherent Ising machines in terms of the number of iterations required to achieve the problem s solution. Nevertheless, high frequency spintronic oscillators with sub-nanosecond synchronization times could be very promising as ultrafast Ising machines. In addition, considering that a coherent Ising machine acts better for Max-Cut problems because of the absence of the linear term in the Ising Hamiltonian, we introduce a procedure to encode Max-3SAT to Max-Cut. We foresee potential synergic interplays between the two paradigms.

cond-mat.other

Temperature gradient-driven magnetic skyrmion motion

The static and dynamic properties of skyrmions have recently received increased attention due to the potential application of skyrmions as information carriers and for unconventional computing. While the current-driven dynamics has been explored deeply, both theoretically and experimentally, the theory of temperature gradient-induced dynamics - Skyrmion-Caloritronics - is still at its early stages of development. Here, we move the topic forward by identifying the role of entropic torques due to the temperature dependence of magnetic parameters. Our results show that, skyrmions move towards higher temperatures in single-layer ferromagnets with interfacial Dzyaloshinski-Moriya interactions, whereas, in multilayers, they move to lower temperatures. We analytically and numerically demonstrate that the opposite behaviors are due to different scaling relations of the material parameters as well as a non-negligible magnetostatic field gradient in multilayers. We also find a spatially dependent skyrmion Hall angle in multilayers hosting hybrid skyrmions due to variations of the thickness dependent chirality as the skyrmion moves along the temperature gradient.

cond-mat.mes-hall

Computing with injection-locked spintronic diodes

Spintronic diodes (STDs) are emerging as a technology for the realization of high-performance microwave detectors. The key advantages of such devices are their high sensitivity, capability to work at low input power, and compactness. In this work, we show a possible use of STDs for neuromorphic computing expanding the realm of their functionalities to implement analog multiplication, which is a key operation in convolutional neural networks (CNN). In particular, we introduce the concept of degree of rectification (DOR) in injection-locked STDs. Micromagnetic simulations are used to design and identify the working range of the STDs for the implementation of the DOR. Previous experimental data confirm the applicability of the proposed solution, which is tested in image processing and in a CNN that recognizes handwritten digits.

cond-mat.mes-hall

Reliability of Neural Networks Based on Spintronic Neurons

Spintronic technology is emerging as a direction for the hardware implementation of neurons and synapses of neuromorphic architectures. In particular, a single spintronic device can be used to implement the nonlinear activation function of neurons. Here, we propose how to implement spintronic neurons with a sigmoidal and ReLU-like activation functions. We then perform a numerical experiment showing the robustness of neural networks made by spintronic neurons all having different activation functions to emulate device-to-device variations in a possible hardware implementation of the network. Therefore, we consider a vanilla neural network implemented to recognize the categories of the Mixed National Institute of Standards and Technology database, and we show an average accuracy of 98.87 % in the test dataset which is very close to the 98.89% as obtained for the ideal case (all neurons have the same sigmoid activation function). Similar results are also obtained with neurons having a ReLU-like activation function.

cond-mat.mes-hall