most citedFeynmanDD: Quantum Circuit Analysis with Classical Decision Diagrams

8 citations · 8 across the 4 of their papers we have counts for

collaborators

5 papers

quant-ph2026

Long-horizon autoformalization of a core theorem underlying MIP* = RE

Sirui Lu, Ruixuan Deng, David Zhu +2

Landmark mathematical formalizations have taken specialist teams years to complete. We present FormalFlow, a system that coordinates AI proving agents under human supervision to ad…

cs.CC2026

On the Complexity of the Circuit Width Problem

Zhengfeng Ji, Yinchen Liu, Zhe'ou Zhou

Montanaro's polynomial representation expresses amplitudes of quantum circuits over the gates , , , and as normalized gaps of degree-three polynomials over $\mathbb…

quant-ph2026

Optimal Compilation of Syndrome Extraction Circuits for General Quantum LDPC Codes

Kai Zhang, Dingchao Gao, Zhaohui Yang +4

Quantum error correcting codes (QECC) are essential for constructing large-scale quantum computers that deliver faithful results. As strong competitors to the conventional surface…

quant-ph2025

Breaking the Treewidth Barrier in Quantum Circuit Simulation with Decision Diagrams

Bin Cheng, Ziyuan Wang, Ruixuan Deng +2

Classical simulation of quantum circuits is a critical tool for validating quantum hardware and probing the boundary between classical and quantum computational power. Existing sta…

quant-ph2025★ 8 cited

FeynmanDD: Quantum Circuit Analysis with Classical Decision Diagrams

Ziyuan Wang, Bin Cheng, Longxiang Yuan +1

Applications of decision diagrams in quantum circuit analysis have been an active research area. Our work introduces FeynmanDD, a new method utilizing standard and multi-terminal d…