Pith. sign in

REVIEW 1 cited by

Experiments with an oscillator based Ising machine

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2502.03167 v2 pith:MJZNYC4H submitted 2025-02-05 cs.ET nlin.AO

classification cs.ETnlin.AO
keywords isingmachineoscillatorsexperimentalmachinesoscillatorsomeunconventional
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Interest in non-algorithmic, unconventional computing is rising in recent years due to more and more apparent short comings of classic stored-program digital computers, such as energy efficiency, degree of parallelism in computations, clock frequency limitations, integration density, silicon utilization, etc. One notable such unconventional approach are oscillator based Ising machines, i.e., systems consisting of a number of oscillators which can be coupled in order to create an analogue for some problem to be solved, while the actual information is encoded in the phase relationships of these oscillators with respect to some reference (typically one of these oscillators). It has been shown that machines of this type are capable of solving NP-hard problems such as max-cut, etc. In the following an experimental Ising machine is presented together with experimental results obtained from this machine.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Geometric Theory of Ising Machines

    cs.ET 2025-07 conditional novelty 6.0 of 10

    Ising circuits can express affine nearest-neighbor classifiers with parallelepiped centroids, and removing their spurious local minima is a linear programming problem.

Pith tools