Evidence map›Paper›PMID 39951528›Full record

ArticleScience advances2025

Finding independent sets in large-scale graphs with a coherent Ising machine.

Hiroki Takesue, Kensuke Inaba, Toshimori Honjo, Yasuhiro Yamada, Takuya Ikuta, Yuya Yonezu, Takahiro Inagaki, Takeshi Umeki, Ryoichi Kasahara

Abstract read
In one paragraph

Article in Science advances, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 5 papers.

0numbers the graph read from it
0cells of the map it votes in
5citing 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

5 citing papers in PubMed.

  1. Optical Ising machine.National science review · 2026
    Article
  2. Article
  3. Article
  4. A versatile coherent Ising computing platform.Light, science & applications · 2026
    Article
  5. Article
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

9 authors.

Hiroki TakesueNTT Basic Research Laboratories, NTT Corporation, 3-1 Morinosato Wakamiya, Atsugi, Kanagawa 243-0198, Japan.ORCID 0000-0003-1253-9049
Kensuke InabaNTT Basic Research Laboratories, NTT Corporation, 3-1 Morinosato Wakamiya, Atsugi, Kanagawa 243-0198, Japan.ORCID 0000-0003-1182-4198
Toshimori HonjoNTT Basic Research Laboratories, NTT Corporation, 3-1 Morinosato Wakamiya, Atsugi, Kanagawa 243-0198, Japan.ORCID 0000-0002-2176-9842
Yasuhiro YamadaNTT Basic Research Laboratories, NTT Corporation, 3-1 Morinosato Wakamiya, Atsugi, Kanagawa 243-0198, Japan.ORCID 0000-0002-5372-2141
Takuya IkutaNTT Basic Research Laboratories, NTT Corporation, 3-1 Morinosato Wakamiya, Atsugi, Kanagawa 243-0198, Japan.ORCID 0000-0003-3371-9583
Yuya YonezuNTT Basic Research Laboratories, NTT Corporation, 3-1 Morinosato Wakamiya, Atsugi, Kanagawa 243-0198, Japan.ORCID 0000-0001-9024-5551
Takahiro InagakiNTT Basic Research Laboratories, NTT Corporation, 3-1 Morinosato Wakamiya, Atsugi, Kanagawa 243-0198, Japan.ORCID 0000-0003-1322-8744
Takeshi UmekiNTT Device Technology Laboratories, NTT Corporation, 3-1 Morinosato Wakamiya, Atsugi, Kanagawa 243-0198, Japan.ORCID 0000-0002-5787-5911
Ryoichi KasaharaNTT Device Technology Laboratories, NTT Corporation, 3-1 Morinosato Wakamiya, Atsugi, Kanagawa 243-0198, Japan.ORCID 0000-0002-9325-6667

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Combinatorial optimizers using physical systems, or "Ising machines," have been intensively studied as a way of computation that is more efficient than current digital computers. Here, we demonstrate that a coherent Ising machine (CIM) based on degenerate optical parametric oscillator (DOPO) pulses can find solutions to large-scale maximum independent set problems, which is an essential optimization problem that is closely related to real-world optimization tasks. We implemented a stable external field for each Ising spin as an interaction between a DOPO pulse and a group of ferromagnetically coupled auxiliary pulses. Consequently, the CIM delivered independent sets for dense graphs with up to 40,000 nodes. We compared the performance of the CIM with that of optimized simulated annealing algorithm implemented on a digital computer and found that the CIM outperformed the central processing unit (CPU) in terms of the time needed to obtain good approximate solutions when the graph size exceeded several thousand nodes.

Identifiers

PMID39951528
PMCPMC11827628

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC
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.