activity
20232025
most citedA Ferroelectric Compute-in-Memory Annealer for Combinatorial Optimization Problems

44 citations · 53 across the 6 of their papers we have counts for

collaborators

6 papers

cs.ET2025

BEOL Ferroelectric Compute-in-Memory Ising Machine for Simulated Bifurcation

Yu Qian, Alptekin Vardar, Konrad Seidel +7

Computationally hard combinatorial optimization problems are pervasive in science and engineering, yet their NP-hard nature renders them increasingly inefficient to solve on conven…

cs.ET2025★ 2 cited

Device-Algorithm Co-Design of Ferroelectric Compute-in-Memory In-Situ Annealer for Combinatorial Optimization Problems

Yu Qian, Xianmin Huang, Ranran Wang +5

Combinatorial optimization problems (COPs) are crucial in many applications but are computationally demanding. Traditional Ising annealers address COPs by directly converting them…

cs.ET2024

Energy Efficient Dual Designs of FeFET-Based Analog In-Memory Computing with Inherent Shift-Add Capability

Zeyu Yang, Qingrong Huang, Yu Qian +3

In-memory computing (IMC) architecture emerges as a promising paradigm, improving the energy efficiency of multiply-and-accumulate (MAC) operations within DNNs by integrating the p…

cs.ET2024★ 1 cited

HyCiM: A Hybrid Computing-in-Memory QUBO Solver for General Combinatorial Optimization Problems with Inequality Constraints

Yu Qian, Zeyu Yang, Kai Ni +3

Computationally challenging combinatorial optimization problems (COPs) play a fundamental role in various applications. To tackle COPs, many Ising machines and Quadratic Unconstrai…

cs.ET2024★ 6 cited

C-Nash: A Novel Ferroelectric Computing-in-Memory Architecture for Solving Mixed Strategy Nash Equilibrium

Yu Qian, Kai Ni, Thomas Kämpfe +2

The concept of Nash equilibrium (NE), pivotal within game theory, has garnered widespread attention across numerous industries. Recent advancements introduced several quantum Nash…

cs.ET2023★ 44 cited

A Ferroelectric Compute-in-Memory Annealer for Combinatorial Optimization Problems

Xunzhao Yin, Yu Qian, Alptekin Vardar +11

Computationally hard combinatorial optimization problems (COPs) are ubiquitous in many applications, including logistical planning, resource allocation, chip design, drug explorati…