most citedEquivalence Checking of Quantum Circuits via Path-Sum and Weighted Model Counting

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

collaborators

5 papers

quant-ph2026

Two-copy distillability of one-copy-undistillable negative-partial-transpose states in every dimension

Gelo Noel M. Tabia, Kai-Siang Chen, Min-Hsiu Hsieh

Whether entanglement with a negative partial transpose (NPT) can be undistillable is a longstanding open problem. In the canonical family of DiVincenzo \textit{et al.}, the one-cop…

cs.SC2026★ 2 cited

Equivalence Checking of Quantum Circuits via Path-Sum and Weighted Model Counting

Wei-Jia Huang, Christophe Chareton, Yu-Fang Chen +4

Equivalence checking of quantum circuits is a central verification task in quantum computing, ensuring the correctness of circuit optimizations, hardware mappings, and compilation…

cs.LO2024★ 1 cited

AutoQ 2.0: From Verification of Quantum Circuits to Verification of Quantum Programs (Technical Report)

Yu-Fang Chen, Kai-Min Chung, Min-Hsiu Hsieh +4

We present a verifier of quantum programs called AutoQ 2.0. Quantum programs extend quantum circuits (the domain of AutoQ 1.0) by classical control flow constructs, which enable us…

quant-ph2024★ 1 cited

Equivalence Checking of Parameterised Quantum Circuits

Xin Hong, Wei-Jia Huang, Wei-Chen Chien +4

Parameterised quantum circuits (PQCs) hold great promise for demonstrating quantum advantages in practical applications of quantum computation. Examples of successful applications…

quant-ph2024

Incorporating Zero-Probability Constraints to Device-Independent Randomness Expansion

Chun-Yu Chen, Kai-Siang Chen, Kai-Min Chung +3

One of the distinguishing features of quantum theory is that its measurement outcomes are usually unpredictable or, equivalently, random. Moreover, this randomness is certifiable w…