Pith. sign in

REVIEW 1 cited by

Analog Coupled Oscillator Based Weighted 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 1906.06312 v2 pith:XAFMMFEV submitted 2019-06-14 physics.comp-ph

classification physics.comp-ph
keywords oscillatorcoupledsystemanaloganalysiscircuitcomputingising
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We report on an analog computing system with coupled non-linear oscillators which is capable of solving complex combinatorial optimization problems using the weighted Ising model. The circuit is composed of a fully-connected 4-node LC oscillator network with low-cost electronic components and compatible with traditional integrated circuit technologies. We present the theoretical modeling, experimental characterization, and statistical analysis our system, demonstrating single-run ground state accuracies of 98% on randomized MAX-CUT problem sets with binary weights and 84% with 5-bit weight resolutions. Solutions are obtained within 5 oscillator cycles, and the time-to-solution has been demonstrated to scale directly with oscillator frequency. We present scaling analysis which suggests that large coupled oscillator networks may be used to solve computationally intensive problems faster and more efficiently than conventional algorithms. The proof-of-concept system presented here provides the foundation for realizing such larger scale systems using existing hardware technologies and could pave the way towards an entirely novel computing paradigm.

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