Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Bulletin of the American Physical Society

Benchmarking State Of The Art Ising Machines

Matthew Kowalsky, Tameem Albash, Itay Hen, Daniel A. Lidar

Published Mar 16, 2021• 1 citation
OpenAlex

Related papers

A brief state-of-the-art review of Ising machines: algorithms and hardware

Leleu Timothee

生産研究•Jan 1, 2020•0 citations

Benchmarking the Poor Man's Ising Machine

Gautham Umasankar, Parth S Shah, Nitin Chandrachoodan +1 more

We demonstrate the use of a Time-Multiplexed Opto-Electronic Oscillator based Coherent Ising Machine(CIM) to solve Maxcut Problems. Time multiplexing helps reduce system complexity and size, with good scaling against problem size. Benchmarks against state-of-the-art classical solvers show comparable performance, with encouraging results for further improvements.

IEEE/LEOS Summer Topical Meetings•Jul 1, 2021•3 citations

100 years of the Ising model

Zoe Budrikis

Nature Reviews Physics•Sep 5, 2024•14 citations

Higher-order neuromorphic Ising machines—autoencoders and Fowler-Nordheim annealers are all you need for scalability

Faiek Ahsan, Saptarshi Maiti, Zihao Chen +8 more

We report that an autoencoder-based neuromorphic architecture, combined with Fowler-Nordheim annealing, is sufficient to implement scalable higher-order Ising machines. We show that these machines can consistently produce state-of-the-art solutions with high reliability and with competitive time-to-solution metrics. The autoencoder captures higher-order interactions by decomposing Ising clauses and Ising spins into encoder-decoder layers of spiking neurons, thereby keeping the resource complexity independent of the interaction order for sparse problems. An annealing process based on the dynamics of Fowler-Nordheim quantum mechanical tunneling extrapolates between an $${{\mathcal{O}}}(1/t)$$ annealing schedule and an $${{\mathcal{O}}}(1/\log (t))$$ annealing schedule. This not only ensures fast convergence towards high-quality solutions but also guarantees asymptotic convergence to the Ising ground state. To demonstrate the advantages of the proposed higher-order neuromorphic Ising machine, we systematically solved benchmark combinatorial optimization problems such as MAX-CUT and MAX-SAT, comparing the results to those obtained using a second-order Ising machine employing the same annealing process. The authors demonstrate that an autoencoder-based neuromorphic architecture combined with Fowler-Nordheim annealing, is sufficient to implement scalable higher-order Ising machines. They show that these machines can consistently produce state-of-the-art solutions with high reliability and competitive time-to-solution metrics.

arXiv:2506.19964•Nature Communications•Apr 16, 2026•4 citations

A spatial-photonic Ising machine to solve the two-way\n number-partitioning problem

Vikram Ramesh, Vighnesh Natarajan, Anil Prabhakar

We evaluate the performance of different algorithms in minimizing the Hamiltonian of a spatial-photonic Ising machine (SPIM). We then encode the number-partitioning problem on the SPIM and adiabatically arrive at good solutions for the problem for over 16000 spins, with a time complexity that only scales linearly with problem size. Finally, we benchmark our machine performance against the classical solver, Gurobi, and also a D-Wave 5000+ quantum annealer. With just one spatial light modulator, and and adiabatic evolution scheme for the phase, our results surpass current state-of-the-art SPIMs. We reduce hardware costs, and can solve larger problems more efficiently.

arXiv:2110.01616•Oct 3, 2021•3 citations

New perspectives on the Ising model

F. Mancini

arXiv:cond-mat/0506117•The European Physical Journal B•Jun 1, 2005•14 citations
We report that an autoencoder-based neuromorphic architecture, combined with Fowler-Nordheim annealing, is sufficient to implement scalable higher-order Ising machines. We show that these machines can consistently produce state-of-the-art solutions with high reliability and with competitive time-to-solution metrics. The autoencoder captures higher-order interactions by decomposing Ising clauses and Ising spins into encoder-decoder layers of spiking neurons, thereby keeping the resource complexity independent of the interaction order for sparse problems. An annealing process based on the dynamics of Fowler-Nordheim quantum mechanical tunneling extrapolates between an O(1/t){{\mathcal{O}}}(1/t)O(1/t) annealing schedule and an O(1/log⁡(t)){{\mathcal{O}}}(1/\log (t))O(1/log(t)) annealing schedule. This not only ensures fast convergence towards high-quality solutions but also guarantees asymptotic convergence to the Ising ground state. To demonstrate the advantages of the proposed higher-order neuromorphic Ising machine, we systematically solved benchmark combinatorial optimization problems such as MAX-CUT and MAX-SAT, comparing the results to those obtained using a second-order Ising machine employing the same annealing process. The authors demonstrate that an autoencoder-based neuromorphic architecture combined with Fowler-Nordheim annealing, is sufficient to implement scalable higher-order Ising machines. They show that these machines can consistently produce state-of-the-art solutions with high reliability and competitive time-to-solution metrics.
We evaluate the performance of different algorithms in minimizing the Hamiltonian of a spatial-photonic Ising machine (SPIM). We then encode the number-partitioning problem on the SPIM and adiabatically arrive at good solutions for the problem for over 16000 spins, with a time complexity that only scales linearly with problem size. Finally, we benchmark our machine performance against the classical solver, Gurobi, and also a D-Wave 5000+ quantum annealer. With just one spatial light modulator, and and adiabatic evolution scheme for the phase, our results surpass current state-of-the-art SPIMs. We reduce hardware costs, and can solve larger problems more efficiently.