Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Yinchen Liu

Yinchen Liu

2 indexed papers

Recent (6 mo)
2
With code
0
Influential cites
0
Benchmarked
0

Publications per year

2
26

Top categories

Complexity×2Info Theory×1Quantum Physics×1

Frequent co-authors

Yeyuan Chen1×
Miryam Mi-Ying Huang1×
Er-Cheng Tang1×
Zhengfeng Ji1×
Zhe'ou Zhou1×

Research Timeline

2026
On the Complexity of the Circuit Width Problem

This paper studies the computational complexity of the width parameter in Montanaro's polynomial representation of quantum circuits.

Cubical Sheaf Complexes with Constant Expansion with Applications to Asymptotically Good qLTCs

The authors construct r-dimensional cubical sheaf complexes with positive constant rate, linear distance, and constant soundness for CSS codes.

Highlighted terms show continued research focus across papers

Papers

cs.ITcs.CCquant-phTheoreticalRecentSep 23, 2026

Cubical Sheaf Complexes with Constant Expansion with Applications to Asymptotically Good qLTCs

Yeyuan Chen, Miryam Mi-Ying Huang, Yinchen Liu, Er-Cheng Tang

The authors construct r-dimensional cubical sheaf complexes with positive constant rate, linear distance, and constant soundness for CSS codes.

View →
cs.CCTheoretical
Recent
Jun 16, 2026

On the Complexity of the Circuit Width Problem

Zhengfeng Ji, Yinchen Liu, Zhe'ou Zhou

This paper studies the computational complexity of the width parameter in Montanaro's polynomial representation of quantum circuits.

View →