ArticleNature communications2023
Efficient optimization with higher-order ising machines.
Article in Nature communications, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 11 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
11 citing papers in PubMed.
- Precision meets speed through an FPGA-based natively sparse Ising machine for combinatorial optimization.Nature communications · 2026Article
- Towards higher order oscillatory Ising machines.Scientific reports · 2026Article
- Higher-order neuromorphic Ising machines-autoencoders and Fowler-Nordheim annealers are all you need for scalability.Nature communications · 2026Article
- Metrics for spin-based computing.Nature reviews. Physics · 2026Article
- A hardware demonstration of a universal programmable RRAM-based probabilistic computer for molecular docking.Nature communications · 2025Article
- Article
- Explosive neural networks via higher-order interactions in curved statistical manifolds.Nature communications · 2025Article
- All-to-all reconfigurability with sparse and higher-order Ising machines.Nature communications · 2024Article
- Computing high-degree polynomial gradients in memory.Nature communications · 2024Article
- Direct design of ground-state probabilistic logic using many-body interactions for probabilistic computing.Scientific reports · 2024Article
- Computing with oscillators from theoretical underpinnings to applications and demonstrators.Npj unconventional computing · 2024Review
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
6 authors.
Funding
Abstract
A prominent approach to solving combinatorial optimization problems on parallel hardware is Ising machines, i.e., hardware implementations of networks of interacting binary spin variables. Most Ising machines leverage second-order interactions although important classes of optimization problems, such as satisfiability problems, map more seamlessly to Ising networks with higher-order interactions. Here, we demonstrate that higher-order Ising machines can solve satisfiability problems more resource-efficiently in terms of the number of spin variables and their connections when compared to traditional second-order Ising machines. Further, our results show on a benchmark dataset of Boolean k-satisfiability problems that higher-order Ising machines implemented with coupled oscillators rapidly find solutions that are better than second-order Ising machines, thus, improving the current state-of-the-art for Ising machines.
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.