20 citations · 53 across the 11 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
quant-ph2026
Fanout Complexity of Symmetric Boolean Functions in
Boyan Xu, Lvzhou Li
Whether can compute remains open. Computing is equivalent to implementing under reduct…
cs.ET2026
On the completeness of transformation rules in reversible logic synthesis
Shiguang Feng, Zongxing Xiong, Lvzhou Li
Transformation rules play a central role in reversible circuit optimization, template-based rewriting, and equivalence checking, and establishing their completeness is a fundamenta…
quant-ph2026
Agnostic learning of qudit stabilizer states
Wentao Qi, Boyan Xu, Shiguang Feng +1
Learning a classical description of a quantum state is a fundamental task in quantum computation. Among the most important classes of quantum states are stabilizer states, which pl…