Evidence map›Paper›PMID 42399280›Full record

ArticleScientific reports2026

Towards higher order oscillatory Ising machines.

Nafisa Sadaf Prova, Hüsrev Cilasun, Abhimanyu Kumar, Ahmet Efe, Sachin S Sapatnekar, Ulya R Karpuzcu

Abstract read
In one paragraph

Article in Scientific reports, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

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.

2 · The registry

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.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

6 authors.

Nafisa Sadaf ProvaUniversity of Minnesota, Minneapolis, USA. prova026@umn.edu.
Hüsrev CilasunUniversity of Minnesota, Minneapolis, USA.
Abhimanyu KumarUniversity of Minnesota, Minneapolis, USA.
Ahmet EfeUniversity of Minnesota, Minneapolis, USA.
Sachin S SapatnekarUniversity of Minnesota, Minneapolis, USA.
Ulya R KarpuzcuUniversity of Minnesota, Minneapolis, USA.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Ising machines as hardware solvers of combinatorial optimization problems (COPs) can efficiently explore large solution spaces due to their inherent parallelism and physics-based dynamics. Many important COPs such as satisfiability (SAT) assume arbitrary interactions between problem variables, while most Ising machines only support pairwise (second-order) interactions. This necessitates translation of higher-order interactions to pairwise, which typically results in extra variables not corresponding to problem variables, and a larger problem for the Ising machine to solve than the original problem. This in turn can significantly increase time-to-solution and/or degrade solution accuracy. In this paper, considering a representative CMOS-compatible class of Ising machines, we propose a practical design to enable direct hardware support for higher order interactions. By minimizing the overhead of problem translation and mapping, our design can result in up to 4 × lower time-to-solution without compromising solution accuracy.

Identifiers

PMID42399280
PMCPMC13483905

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

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.