Andrea Grimaldi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Andrea Grimaldi has a total of 66 co-authors. Here are the top co-authors by number of shared publications:
- Giovanni Finocchio
Department of Mathematical and Computer Sciences, Physical Sciences and Earth Sciences, University of Messina, Messina, Italy
15 shared publications - Eleonora Raimondo
Istituto Nazionale di Geofisica e Vulcanologia, Rome, Italy
8 shared publications - Kerem Yunus Camsari
Department of Electrical and Computer Engineering University of California 93106 Santa Barbara Santa Barbara CA USA
6 shared publications - Mario Carpentieri
Department of Electrical and Information Engineering, Politecnico di Bari, Bari, Italy
5 shared publications - Navid Anjum Aadit
Department of Electrical and Computer Engineering, University of California, Santa Barbara, USA
5 shared publications - Davi R. Rodrigues
Department of Electrical and Information Engineering, Politecnico di Bari, Bari, Italy
4 shared publications
Latest Publications
- Open Access
- 11 October 2026
- Published by Wiley in Advanced Science
- p. e78214
Hardware‐Native Gaussian Sampling With Probabilistic Ising Machines for Modern Communication Paradigms
Modern communication systems increasingly shift computation to edge devices, where post quantum signing, generative AI and semantic communication must operate under strict energy, latency and memory constraints. A central bottleneck in these workloads is Gaussian sampling. In Falcon class signatures, sampling accounts for about 25% of operations and about 65% of signing time. In diffusion inference, repeated Gaussian injection across denoising steps makes edge deployment costly. Here we show that probabilistic Ising machines provide a hardware native route to random Gaussian distributions with both tunable variance and sampling density with two independent parameters. We compare fully digital field‐programmable gate array (FPGA) and FPGA‐spintronic implementations with software implementation. At matched sampling precision, the proposed FPGA sampler reduces the dynamic power and logic utilization of the Gaussian‐sampling core by approximately 4.0‐fold and 4.4‐fold, respectively, relative to the isolated Falcon core. A projected ASIC implementation in 28 nm CMOS is estimated to consume approximately 8 mW. Image generation quality quantified with well‐established metrics is preserved in an open‐source diffusion pipeline. These results establish probabilistic Ising machines as an efficient and scalable platform for Gaussian sampling in post quantum cryptography, edge generative inference and semantic communication.
- 11 October 2026
- Published by Wiley in Advanced Science
- p. e78214
Open AccessHardware‐Native Gaussian Sampling With Probabilistic Ising Machines for Modern Communication Paradigms
Modern communication systems increasingly shift computation to edge devices, where post quantum signing, generative AI and semantic communication must operate under strict energy, latency and memory constraints. A central bottleneck in these workloads is Gaussian sampling. In Falcon class signatures, sampling accounts for about 25% of operations and about 65% of signing time. In diffusion inference, repeated Gaussian injection across denoising steps makes edge deployment costly. Here we show that probabilistic Ising machines provide a hardware native route to random Gaussian distributions with both tunable variance and sampling density with two independent parameters. We compare fully digital field‐programmable gate array (FPGA) and FPGA‐spintronic implementations with software implementation. At matched sampling precision, the proposed FPGA sampler reduces the dynamic power and logic utilization of the Gaussian‐sampling core by approximately 4.0‐fold and 4.4‐fold, respectively, relative to the isolated Falcon core. A projected ASIC implementation in 28 nm CMOS is estimated to consume approximately 8 mW. Image generation quality quantified with well‐established metrics is preserved in an open‐source diffusion pipeline. These results establish probabilistic Ising machines as an efficient and scalable platform for Gaussian sampling in post quantum cryptography, edge generative inference and semantic communication.
- Open Access
- 25 August 2026
- Published by Wiley in Advanced Intelligent Systems
- Vol. 8 (11) , e70521
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 a fixed degree of parallelization, it delivers an order‐of‐magnitude higher update rate than an optimized nonpipelined 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 nonpipelined design, establishing pipelining as an effective route to scalable digital probabilistic computing for dense optimization problems.
- 25 August 2026
- Published by Wiley in Advanced Intelligent Systems
- Vol. 8 (11) , e70521
Open AccessA 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 a fixed degree of parallelization, it delivers an order‐of‐magnitude higher update rate than an optimized nonpipelined 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 nonpipelined design, establishing pipelining as an effective route to scalable digital probabilistic computing for dense optimization problems.
- 29 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Nanotechnology
- Vol. 25 (1536125X) , 180-187
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 real time 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.
- 29 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Nanotechnology
- Vol. 25 (1536125X) , 180-187
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 real time 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.
- Top Cited PapersOpen Access
- 17 April 2026
- Published by Springer Nature in Nature Communications
- Vol. 17 (1)
250 magnetic tunnel junctions-based probabilistic Ising machine
In combinatorial optimization, probabilistic Ising machines 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 advances in scalability and energy efficiency are necessary. Here, we experimentally demonstrate a scalable probabilistic Ising machine based on 250 spin-transfer-torque magnetic tunnel junctions. Our computing approach integrates spintronic tunable true random number generators with advanced annealing techniques. For sparsely connected graphs, the proposed massive parallel architecture 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 device variability. In addition, we propose a next generation chiplet-based architecture for future large-scale, high-performance, and energy-efficient unconventional computing hardware.
- 17 April 2026
- Published by Springer Nature in Nature Communications
- Vol. 17 (1)
Top Cited PapersOpen Access250 magnetic tunnel junctions-based probabilistic Ising machine
In combinatorial optimization, probabilistic Ising machines 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 advances in scalability and energy efficiency are necessary. Here, we experimentally demonstrate a scalable probabilistic Ising machine based on 250 spin-transfer-torque magnetic tunnel junctions. Our computing approach integrates spintronic tunable true random number generators with advanced annealing techniques. For sparsely connected graphs, the proposed massive parallel architecture 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 device variability. In addition, we propose a next generation chiplet-based architecture for future large-scale, high-performance, and energy-efficient unconventional computing hardware.
- Open Access
- 26 March 2026
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 136 (17) , 177201
Adaptive Ising machine based on phase locking of an auto-oscillator to a biharmonic external driving with noise
An auto-oscillator driven by a harmonic signal at about twice its free-running frequency is characterized by a bistable phase dynamics where the two states are separated by π radians. This phase bistability enables an oscillator to emulate a single Ising spin, providing a fundamental building block for the oscillator-based Ising machines (OIM). At the same time, a driving signal close to the oscillator free-running frequency locks the oscillator’s phase at a single value, playing the role of a magnetic field bias in ensembles of real spins. We introduce a universal theory of phase auto-oscillators driven by a biharmonic 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 biharmonic driving relative to the noise strength. Benchmarking on different classes of combinatorial optimization problems, the AIM exhibits complementary performance compared to OIMs and probabilistic Ising machines, with adaptability to the specific problem class. This Letter 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 biharmonic external driving and noise, opening a path toward scalable, CMOS-compatible hardware for hybrid optimization and inference.
- 26 March 2026
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 136 (17) , 177201
Open AccessAdaptive Ising machine based on phase locking of an auto-oscillator to a biharmonic external driving with noise
An auto-oscillator driven by a harmonic signal at about twice its free-running frequency is characterized by a bistable phase dynamics where the two states are separated by π radians. This phase bistability enables an oscillator to emulate a single Ising spin, providing a fundamental building block for the oscillator-based Ising machines (OIM). At the same time, a driving signal close to the oscillator free-running frequency locks the oscillator’s phase at a single value, playing the role of a magnetic field bias in ensembles of real spins. We introduce a universal theory of phase auto-oscillators driven by a biharmonic 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 biharmonic driving relative to the noise strength. Benchmarking on different classes of combinatorial optimization problems, the AIM exhibits complementary performance compared to OIMs and probabilistic Ising machines, with adaptability to the specific problem class. This Letter 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 biharmonic external driving and noise, opening a path toward scalable, CMOS-compatible hardware for hybrid optimization and inference.
- Open Access
- 6 February 2026
- Published by American Physical Society (APS) in Physical Review Applied
- Vol. 25 (2)
Constrained parallel tempering in traveling-salesman problems with circular neighborhoods
. Combinatorial optimization problems such as the traveling-salesman problem (TSP) are central to many applications ranging from physics to mechanical engineering, such as toolpath planning, robotic navigation, and drone routing. In this work, we propose the concept of constrained parallel tempering (CPT), an energy-minimization algorithm implemented on probabilistic Ising machines (PIMs) with probabilistic bits (p-bits) tailored for constrained problems. CPT separates the constraint and target components of the encoding into distinct energy terms with independent sampling temperatures, improving convergence and reducing computational overhead compared with traditional parallel tempering. We demonstrate the effectiveness of CPT on a benchmark of a TSP instance and extend the method to a more general formulation, the TSP with circular neighborhoods (TSPCNs), where each node is defined as a region, not a point. This model reflects real-world flexibility in robotic and drone-based applications. A hybrid deterministic–Monte Carlo refinement is then used to handle the continuous solution space of TSPCNs. Additionally, we present a hardware-friendly approach to generate Gaussian-distributed random numbers using a PIM with p-bits. Our results suggest that CPT-PIM frameworks offer an approach with better scalability and potentially low-power implementation for embedding intelligent decision-making into edge computing applications.
- 6 February 2026
- Published by American Physical Society (APS) in Physical Review Applied
- Vol. 25 (2)
Open AccessConstrained parallel tempering in traveling-salesman problems with circular neighborhoods
. Combinatorial optimization problems such as the traveling-salesman problem (TSP) are central to many applications ranging from physics to mechanical engineering, such as toolpath planning, robotic navigation, and drone routing. In this work, we propose the concept of constrained parallel tempering (CPT), an energy-minimization algorithm implemented on probabilistic Ising machines (PIMs) with probabilistic bits (p-bits) tailored for constrained problems. CPT separates the constraint and target components of the encoding into distinct energy terms with independent sampling temperatures, improving convergence and reducing computational overhead compared with traditional parallel tempering. We demonstrate the effectiveness of CPT on a benchmark of a TSP instance and extend the method to a more general formulation, the TSP with circular neighborhoods (TSPCNs), where each node is defined as a region, not a point. This model reflects real-world flexibility in robotic and drone-based applications. A hybrid deterministic–Monte Carlo refinement is then used to handle the continuous solution space of TSPCNs. Additionally, we present a hardware-friendly approach to generate Gaussian-distributed random numbers using a PIM with p-bits. Our results suggest that CPT-PIM frameworks offer an approach with better scalability and potentially low-power implementation for embedding intelligent decision-making into edge computing applications.
- 24 October 2025
- Published by American Physical Society (APS) in Physical Review Applied
- Vol. 24 (4)
P -dits: Probabilistic d -dimensional bits for extended-variable probabilistic computing
- 24 October 2025
- Published by American Physical Society (APS) in Physical Review Applied
- Vol. 24 (4)
P -dits: Probabilistic d -dimensional bits for extended-variable probabilistic computing
- Open Access
- 16 October 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 1-10
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 their advantage for real-world problems remains an open question. Here, we show that probabilistic computers, co-designed with hardware to implement Monte Carlo algorithms, provide a scalable classical pathway for solving hard optimization problems. We focus on two algorithms applied to three-dimensional spin glasses: discrete-time simulated quantum annealing and adaptive parallel tempering. We benchmark these methods against a leading quantum annealer. For simulated quantum annealing, increasing replicas improves residual energy scaling, consistent with extreme value theory. Adaptive parallel tempering, supported by non-local isoenergetic cluster moves, scales more favorably and outperforms simulated quantum annealing. Field Programmable Gate Arrays or specialized chips can implement these algorithms in modern hardware, leveraging massive parallelism to accelerate them while improving energy efficiency. Our results establish a rigorous classical baseline for assessing practical quantum advantage and present probabilistic computers as a scalable platform for real-world optimization challenges.
- 16 October 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 1-10
Open AccessPushing the boundary of quantum advantage in hard combinatorial optimization with probabilistic computers
Recent demonstrations on specialized benchmarks have reignited excitement for quantum computers, yet their advantage for real-world problems remains an open question. Here, we show that probabilistic computers, co-designed with hardware to implement Monte Carlo algorithms, provide a scalable classical pathway for solving hard optimization problems. We focus on two algorithms applied to three-dimensional spin glasses: discrete-time simulated quantum annealing and adaptive parallel tempering. We benchmark these methods against a leading quantum annealer. For simulated quantum annealing, increasing replicas improves residual energy scaling, consistent with extreme value theory. Adaptive parallel tempering, supported by non-local isoenergetic cluster moves, scales more favorably and outperforms simulated quantum annealing. Field Programmable Gate Arrays or specialized chips can implement these algorithms in modern hardware, leveraging massive parallelism to accelerate them while improving energy efficiency. Our results establish a rigorous classical baseline for assessing practical quantum advantage and present probabilistic computers as a scalable platform for real-world optimization challenges.
- Open Access
- 1 October 2025
- Published by American Physical Society (APS) in Physical Review X
- Vol. 15 (4)
High-Performance and Reliable Probabilistic Ising Machine Based on Simulated Quantum Annealing
Probabilistic computing with p-bits 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 probabilistic bits, and the energy-minimization algorithm. Regarding the energy-minimization algorithm 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, the planted Ising problem, and the traveling salesman problem. Additionally, we design and simulate the architecture of a fully connected CMOS-based PIM that is 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 codesign 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.
- 1 October 2025
- Published by American Physical Society (APS) in Physical Review X
- Vol. 15 (4)
Open AccessHigh-Performance and Reliable Probabilistic Ising Machine Based on Simulated Quantum Annealing
Probabilistic computing with p-bits 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 probabilistic bits, and the energy-minimization algorithm. Regarding the energy-minimization algorithm 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, the planted Ising problem, and the traveling salesman problem. Additionally, we design and simulate the architecture of a fully connected CMOS-based PIM that is 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 codesign 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.
- 10 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Nanotechnology
- Vol. 23 (1536125X) , 704-717
A Review of Ising Machines Implemented in Conventional and Emerging Technologies
Ising machines have received growing interest as efficient and hardware-friendly solvers for combinatorial optimization problems (COPs). They search for the absolute or approximate ground states of the Ising model with a proper annealing process. In contrast to Ising machines built with superconductive or optical circuits, complementary metal–oxide–semiconductor (CMOS) Ising machines offer inexpensive fabrication, high scalability, and easy integration with mainstream semiconductor chips. As low-energy and CMOS-compatible emerging technologies, spintronics and phase-transition devices offer functionalities that can enhance the scalability and sampling performance of Ising machines. In this article, we survey various approaches in the process flow for solving COPs using CMOS, hybrid CMOSspintronic, and phase-transition devices. First, the methods for formulating COPs as Ising problems and embedding Ising formulations to the topology of the Ising machine are reviewed. Then, Ising machines are classified by their underlying operational principles and reviewed from a perspective of hardware implementation. CMOS solutions are advantageous with denser connectivity, whereas hybrid CMOS-spintronic and phase-transition device-based solutions show great potential in energy efficiency and high performance. Finally, the challenges and prospects are discussed for the Ising formulation, embedding process, and implementation of Ising machines.
- 10 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Nanotechnology
- Vol. 23 (1536125X) , 704-717
A Review of Ising Machines Implemented in Conventional and Emerging Technologies
Ising machines have received growing interest as efficient and hardware-friendly solvers for combinatorial optimization problems (COPs). They search for the absolute or approximate ground states of the Ising model with a proper annealing process. In contrast to Ising machines built with superconductive or optical circuits, complementary metal–oxide–semiconductor (CMOS) Ising machines offer inexpensive fabrication, high scalability, and easy integration with mainstream semiconductor chips. As low-energy and CMOS-compatible emerging technologies, spintronics and phase-transition devices offer functionalities that can enhance the scalability and sampling performance of Ising machines. In this article, we survey various approaches in the process flow for solving COPs using CMOS, hybrid CMOSspintronic, and phase-transition devices. First, the methods for formulating COPs as Ising problems and embedding Ising formulations to the topology of the Ising machine are reviewed. Then, Ising machines are classified by their underlying operational principles and reviewed from a perspective of hardware implementation. CMOS solutions are advantageous with denser connectivity, whereas hybrid CMOS-spintronic and phase-transition device-based solutions show great potential in energy efficiency and high performance. Finally, the challenges and prospects are discussed for the Ising formulation, embedding process, and implementation of Ising machines.