Evidence map›Paper›PMID 38499524›Full record

ArticleNature communications2024

Ferroelectric compute-in-memory annealer for combinatorial optimization problems.

Xunzhao Yin, Yu Qian, Alptekin Vardar, Marcel Günther, Franz Müller, Nellie Laleni, Zijian Zhao, Zhouhang Jiang, Zhiguo Shi, Yiyu Shi and 4 more

Open access · goldAbstract read
In one paragraph

Article in Nature communications, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 4 papers.

0numbers the graph read from it
0cells of the map it votes in
4citing papers in PubMed
8.1field-weighted citation impact, top 2% of its field
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

4 citing papers in PubMed, 39 citations in OpenAlex.

  1. Article
  2. Article
  3. In-memory ferroelectric differentiator.Nature communications · 2025
    Article
  4. 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

14 authors at 4 institutions in 4 countries.

Xunzhao Yin *Zhejiang University, Hangzhou, China.ORCID http://orcid.org/0000-0003-4656-9545
Yu Qian *Zhejiang University, Hangzhou, China.ORCID http://orcid.org/0000-0002-0885-2748
Alptekin VardarFraunhofer IPMS, Dresden, Germany.
Marcel GüntherFraunhofer IPMS, Dresden, Germany.
Franz MüllerFraunhofer IPMS, Dresden, Germany.ORCID http://orcid.org/0000-0002-6564-9121
Nellie LaleniFraunhofer IPMS, Dresden, Germany.
Zijian ZhaoUniversity of Notre Dame, Notre Dame, USA.
Zhouhang JiangUniversity of Notre Dame, Notre Dame, USA.
Zhiguo ShiZhejiang University, Hangzhou, China.
Yiyu ShiUniversity of Notre Dame, Notre Dame, USA.ORCID http://orcid.org/0000-0002-6788-9823
Xiao GongNational University of Singapore, Singapore, Singapore.ORCID http://orcid.org/0000-0002-9243-1937
Cheng ZhuoZhejiang University, Hangzhou, China. czhuo@zju.edu.cn.ORCID http://orcid.org/0000-0002-2610-7522
Thomas KämpfeFraunhofer IPMS, Dresden, Germany. thomas.kaempfe@ipms.fraunhofer.de.ORCID http://orcid.org/0000-0002-4672-8676
Kai NiUniversity of Notre Dame, Notre Dame, USA. kni@nd.edu.ORCID http://orcid.org/0000-0002-3628-3431
Fraunhofer Institute for Photonic Microsystems · DEUniversity of Notre Dame · USZhejiang University · CNNational University of Singapore · SG

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Computationally hard combinatorial optimization problems (COPs) are ubiquitous in many applications. Various digital annealers, dynamical Ising machines, and quantum/photonic systems have been developed for solving COPs, but they still suffer from the memory access issue, scalability, restricted applicability to certain types of COPs, and VLSI-incompatibility, respectively. Here we report a ferroelectric field effect transistor (FeFET) based compute-in-memory (CiM) annealer for solving larger-scale COPs efficiently. Our CiM annealer converts COPs into quadratic unconstrained binary optimization (QUBO) formulations, and uniquely accelerates in-situ the core vector-matrix-vector (VMV) multiplication operations of QUBO formulations in a single step. Specifically, the three-terminal FeFET structure allows for lossless compression of the stored QUBO matrix, achieving a remarkably 75% chip size saving when solving Max-Cut problems. A multi-epoch simulated annealing (MESA) algorithm is proposed for efficient annealing, achieving up to 27% better solution and ~ 2X speedup than conventional simulated annealing. Experimental validation is performed using the first integrated FeFET chip on 28nm HKMG CMOS technology, indicating great promise of FeFET CiM array in solving general COPs.

Identifiers

PMID38499524
PMCPMC10948773
OpenAlexW4392897316

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.