activity
20242026
collaborators

5 papers

cs.CR2026

Think Locally Before Computing Jointly: Efficient Secure Multi-Party Computation via Maximizing Local Processing

Mingfei Yu, Chenglu Jin, Giovanni De Micheli

Secure multi-party computation (MPC) lets parties evaluate a function over private inputs without revealing them. In garbled-circuit (GC) protocols, prior optimization has largely…

quant-ph2026

Quantum Circuit Synthesis Using an Exact T Library

Hanyu Wang, Mingfei Yu, Xinrui Wu +1

In fault-tolerant quantum circuit synthesis, T gates supplied via magic states dominate space-time cost, while Clifford gates incur negligible overhead. Conventional flows minimize…

cs.LG2026

TRAM: Training Approximate Multiplier Structures for Low-Power AI Accelerators

Chang Meng, Hanyu Wang, Yuyang Ye +3

Reducing power consumption in AI accelerators is increasingly important. Approximate computing can reduce power consumption while keeping the accuracy loss small. Since multipliers…

cs.CR2025

Cut Tracing with E-Graphs for Boolean FHE Circuit Synthesis

Julien de Castelnau, Mingfei Yu, Giovanni De Micheli

Fully Homomorphic Encryption (FHE) is a promising privacy-preserving technology enabling secure computation over encrypted data. A major limitation of current FHE schemes is their…

cs.ET2024

Unleashing the Power of T1-cells in SFQ Arithmetic Circuits

Rassul Bairamkulov, Mingfei Yu, Giovanni De Micheli

Rapid single-flux quantum (RSFQ), a leading cryogenic superconductive electronics (SCE) technology, offers extremely low power dissipation and high speed. However, implementing RSF…