Evidence map›Paper›PMID 37739944›Full record

ArticleNature communications2023

Efficient combinatorial optimization by quantum-inspired parallel annealing in analogue memristor crossbar.

Mingrui Jiang, Keyi Shan, Chengping He, Can Li

Abstract read
In one paragraph

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 14 papers.

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

14 citing papers in PubMed.

  1. Review
  2. Review
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Review
  10. Article
  11. Article
  12. Article
  13. Article
  14. 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

4 authors.

Mingrui JiangDepartment of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong SAR, China.ORCID http://orcid.org/0009-0000-2364-3904
Keyi ShanDepartment of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong SAR, China.
Chengping HeDepartment of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong SAR, China.
Can LiDepartment of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong SAR, China. canl@hku.hk.ORCID http://orcid.org/0000-0003-3795-2008

Funding

Croucher Foundation 23102360National Natural Science Foundation of China (National Science Foundation of China) 62122005Research Grants Council, University Grants Committee (RGC, UGC) 27210321Research Grants Council, University Grants Committee (RGC, UGC) T45-701/22-R
6 · The paper itself

Abstract

Combinatorial optimization problems are prevalent in various fields, but obtaining exact solutions remains challenging due to the combinatorial explosion with increasing problem size. Special-purpose hardware such as Ising machines, particularly memristor-based analog Ising machines, have emerged as promising solutions. However, existing simulate-annealing-based implementations have not fully exploited the inherent parallelism and analog storage/processing features of memristor crossbar arrays. This work proposes a quantum-inspired parallel annealing method that enables full parallelism and improves solution quality, resulting in significant speed and energy improvement when implemented in analog memristor crossbars. We experimentally solved tasks, including unweighted and weighted Max-Cut and traveling salesman problem, using our integrated memristor chip. The quantum-inspired parallel annealing method implemented in memristor-based hardware has demonstrated significant improvements in time- and energy-efficiency compared to previously reported simulated annealing and Ising machine implemented on other technologies. This is because our approach effectively exploits the natural parallelism, analog conductance states, and all-to-all connection provided by memristor technology, promising its potential for solving complex optimization problems with greater efficiency.

Identifiers

PMID37739944
PMCPMC10516914

What OpenQuestion holds

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