59 citations · 79 across the 7 of their papers we have counts for
3 papers · 1 filter
An Effective Quantum Hoare Logic for Hybrid Quantum Programs with Unbounded Loops
Christophe Chareton, Jad Issa, Romain Péchoux
While quantum hardware remains limited, hybrid quantum-classical algorithms with complex control structures, including unbounded loops, are emerging, posing new challenges for quan…
Hybrid Path-Sums for Hybrid Quantum Programs
Christophe Chareton, Jad Issa, Mathieu Nguyen +2
As quantum computing becomes an emerging reality, designing efficient quantum programming capabilities is becoming more and more important. Particularly, the debugging and validati…
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…