Constructing NP#P-complete Problems and #P-Hardness of Circuit Extraction in Phase-Free ZH Calculus

The paper establishes that the problems of StateEq and ContainsEntryk in phase-free ZH calculus are NP#P-complete, and that circuit extraction in phase-free ZH is #P-hard.