arXiv subjects

Andrea Grimaldi

Publications and source records attributed to Andrea Grimaldi.

At least 19 recordsLinked to original sources

arXiv2026

Entanglement-enhanced optical magnetometry beyond the standard quantum limit

Optical atomic magnetometry is a powerful tool for continuous sensing applications, yet, in the absence of quantum correlations, its sensitivity is limited by the standard quantum limit (SQL) stemming from a trade-off between optical probe imprecision and quantum measurement backaction. Beyond-SQL sensitivity requires quantum correlations that modify these measurement noise sources. Here we demonstrate such sensitivity by using entangled state of the probe light and by engineering correlations between measurement imprecision and backaction. Having first explored SQL in a broad range of frequencies, we demonstrate overcoming the limit by combining variational readout with coupling the magnetometer to one mode of a bipartite entangled light state and conditioning the results on the other entangled mode. Tuning the detected light quadratures and combining the signals from the two measurement channels, we achieve sensitivity beyond the SQL in a broad range of acoustic frequencies which has so far remained inaccessible to quantum-noise-limited optical magnetometry.

quant-ph↗

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

P-dit Probabilistic Ising Machine for Solving the Quadratic Assignment Problem

Combinatorial optimization problems represent a wide range of real-world scenarios where complicated interactions make it difficult to find the best solution. One example is the quadratic assignment problem (QAP), which involves determining the optimal placement of facilities at set locations which minimizes the products of material flow and facility distance. This representation is descriptive of many real-world scenarios, including the aggregate transportation costs of a supply chain. In this work, a probabilistic Ising machine (PIM) approach is implemented using probabilistic d-dimensional variables (p-dits), which are generalized, multi-state and multi-dimensional extensions to probabilistic bits (p-bits). Each p-dit corresponds to a location and stochastically oscillates between facility assignments based on the influence of the other p-dits. We show that with the same runtime and CPU, the PIM finds the best-known solution on 95% of considered instances from the QAP Library dataset, compared to just 36% for the standard Gurobi solver. For the unique largest problem in the library, a 2 to 3 order-of-magnitude decrease is observed in the time needed to reach specific solution qualities. We also show parallelization of our PIM through GPU implementations. A comparison to state-of-the-art QAP solver algorithms shows that they are consistently outperformed by both CPU and GPU implementations of the p-dit Ising machine.

physics.app-ph↗

arXiv2026

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↗

arXiv2026

Magneto-mechanical reservoir computing combining a two-dimensional network of nonlinear mass-spring resonators with magnetic tunnel junctions

Coupled networks of mass-spring resonators have attracted growing attention across multiple fundamental and applied research directions, including reservoir computing for artificial intelligence. This has led to the exploration of platforms capable of tasks such as acoustic-wave classification, smart sensing, predictive maintenance, and adaptive vibration control. This work introduces a multiphysics reservoir based on a two-dimensional network of coupled nonlinear mass-spring resonators. Each mass has a magnetic tunnel junction on top of it, working as spin diode, used as a spintronic read-out. As a proof-of-concept, we have benchmarked this reservoir with the task of vowel-recognition reaching accuracy above 95$\%$. Because the device accepts elastic excitations directly, signal injections are simplified, making it well-suited for realtime sensing and edge computation. We also studied the effect of nonlinearity, demonstrating how it influences the reservoir dynamics, and assessed its robustness under node-to-node variation of the elastic constants.

cond-mat.mes-hall↗

arXiv2025

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↗

arXiv2025

Coherent phase control of two-color continuous variable entangled light

A continuous variable Einstein-Podolsky-Rosen (EPR) state is a resource for secure quantum communication and distributed quantum sensing. Here we present a technique for coherent control of the two-color EPR state generated by a frequency nondegenerate optical parametric oscillator. The scheme allows for robust control of the homodyne detection of each of the two EPR quantum fields separated by 200 nanometers. We apply our control scheme to stabilize and characterize a strong entangled state of two-color light displaying 9 dB of two-mode squeezing in the acoustic frequency range, making it a valuable tool for quantum networking and quantum metrology.

quant-ph↗

arXiv2025

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↗

arXiv2025

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↗

arXiv2025

Extended-variable probabilistic computing with p-dits

Ising machines can solve combinatorial optimization problems by representing them as energy minimization problems. A common implementation is the probabilistic Ising machine (PIM), which uses probabilistic (p-) bits to represent coupled binary spins. However, many real-world problems have complex data representations that do not map naturally into a binary encoding, leading to a significant increase in hardware resources and time-to-solution. Here, we describe a generalized spin model that supports an arbitrary number of spin dimensions, each with an arbitrary real component. We define the probabilistic d-dimensional bit (p-dit) as the base unit of a p-computing implementation of this model. We further describe two restricted forms of p-dits for specific classes of common problems and implement them experimentally on an application-specific integrated circuit (ASIC): (A) isotropic p-dits, which simplify the implementation of categorical variables resulting in ~34x performance improvement compared to a p-bit implementation on an example 3-partition problem. (B) Probabilistic integers (p-ints), which simplify the representation of numeric values and provide ~5x improvement compared to a p-bit implementation of an example integer linear programming (ILP) problem. Additionally, we report a field-programmable gate array (FPGA) p-int-based integer quadratic programming (IQP) solver which shows ~64x faster time-to-solution compared to the best of a series of state-of-the-art software solvers. The generalized formulation of probabilistic variables presented here provides a path to solving large-scale optimization problems on various hardware platforms including digital CMOS.

physics.app-ph↗

arXiv2025

Hybrid quantum network for sensing in the acoustic frequency range

Ultimate limits for sensing of fields and forces are set by the quantum noise of a sensor. Entanglement allows for suppression of such noise and for achieving sensitivity beyond standard quantum limits. Applicability of quantum optical sensing is often restricted by fixed wavelengths of available photonic quantum sources. Another ubiquitous limitation is associated with challenges of achieving quantum-noise-limited sensitivity in the acoustic noise frequency range relevant for a number of applications. Here we demonstrate a novel tool for broadband quantum sensing by performing quantum state processing that can be applied to a wide range of the optical spectrum, and by suppressing quantum noise over an octave in the acoustic frequency range. An atomic spin ensemble is strongly coupled to one of the frequency-tunable beams of an Einstein-Podolsky-Rosen (EPR) source of light. The other EPR beam of light, entangled with the first one, is tuned to a disparate wavelength. Engineering the spin ensemble to act as a negative- or positive-mass oscillator we demonstrate frequency-dependent quantum noise reduction for measurements at the disparate wavelength. The tunability of the spin ensemble allows to target quantum noise in a variety of systems with dynamics ranging from kHz to MHz. As an example of the broadband quantum noise reduction in the acoustic frequency range, we analyse the applicability of our approach to gravitational wave detectors. Other possible applications include continuous-variable quantum repeaters and distributed quantum sensing.

quant-ph↗

arXiv2025

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↗

arXiv2023

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↗

arXiv2023

A full-stack view of probabilistic computing with p-bits: devices, architectures and algorithms

The transistor celebrated its 75${}^\text{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.

cs.ET↗

arXiv2022

Physics-inspired Ising Computing with Ring Oscillator Activated p-bits

The nearing end of Moore's Law has been driving the development of domain-specific hardware tailored to solve a special set of problems. Along these lines, probabilistic computing with inherently stochastic building blocks (p-bits) have shown significant promise, particularly in the context of hard optimization and statistical sampling problems. p-bits have been proposed and demonstrated in different hardware substrates ranging from small-scale stochastic magnetic tunnel junctions (sMTJs) in asynchronous architectures to large-scale CMOS in synchronous architectures. Here, we design and implement a truly asynchronous and medium-scale p-computer (with $\approx$ 800 p-bits) that closely emulates the asynchronous dynamics of sMTJs in Field Programmable Gate Arrays (FPGAs). Using hard instances of the planted Ising glass problem on the Chimera lattice, we evaluate the performance of the asynchronous architecture against an ideal, synchronous design that performs parallelized (chromatic) exact Gibbs sampling. We find that despite the lack of any careful synchronization, the asynchronous design achieves parallelism with comparable algorithmic scaling in the ideal, carefully tuned and parallelized synchronous design. Our results highlight the promise of massively scaled p-computers with millions of free-running p-bits made out of nanoscale building blocks such as stochastic magnetic tunnel junctions.

cs.AR↗

arXiv2022

Massively Parallel Probabilistic Computing with Sparse Ising Machines

Inspired by the developments in quantum computing, building domain-specific classical hardware to solve computationally hard problems has received increasing attention. Here, by introducing systematic sparsification techniques, we demonstrate a massively parallel architecture: the sparse Ising Machine (sIM). Exploiting sparsity, sIM achieves ideal parallelism: its key figure of merit - flips per second - scales linearly with the number of probabilistic bits (p-bit) in the system. This makes sIM up to 6 orders of magnitude faster than a CPU implementing standard Gibbs sampling. Compared to optimized implementations in TPUs and GPUs, sIM delivers 5-18x speedup in sampling. In benchmark problems such as integer factorization, sIM can reliably factor semiprimes up to 32-bits, far larger than previous attempts from D-Wave and other probabilistic solvers. Strikingly, sIM beats competition-winning SAT solvers (by 4-700x in runtime to reach 95% accuracy) in solving 3SAT problems. Even when sampling is made inexact using faster clocks, sIM can find the correct ground state with further speedup. The problem encoding and sparsification techniques we introduce can be applied to other Ising Machines (classical and quantum) and the architecture we present can be used for scaling the demonstrated 5,000-10,000 p-bits to 1,000,000 or more through analog CMOS or nanodevices.

cs.ET↗

arXiv2022

Spintronics-compatible approach to solving maximum satisfiability problems with probabilistic computing, invertible logic and parallel tempering

The search of hardware-compatible strategies for solving NP-hard combinatorial optimization problems (COPs) is an important challenge of today s computing research because of their wide range of applications in real world optimization problems. Here, we introduce an unconventional scalable approach to face maximum satisfiability problems (Max-SAT) which combines probabilistic computing with p-bits, parallel tempering, and the concept of invertible logic gates. We theoretically show the spintronic implementation of this approach based on a coupled set of Landau-Lifshitz-Gilbert equations, showing a potential path for energy efficient and very fast (p-bits exhibiting ns time scale switching) architecture for the solution of COPs. The algorithm is benchmarked with hard Max-SAT instances from the 2016 Max-SAT competition (e.g., HG-4SAT-V150-C1350-1.cnf which can be described with 2851 p-bits), including weighted Max-SAT and Max-Cut problems.

cond-mat.mes-hall↗