59 citations · 79 across the 7 of their papers we have counts for
7 papers
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…
Quantum Circuit Equivalence Checking: A Tractable Bridge From Unitary to Hybrid Circuits
Jérome Ricciardi, Sébastien Bardin, Christophe Chareton +1
Equivalence checking of hybrid quantum circuits is of primary importance, given that quantum circuit transformations are omnipresent along the quantum compiler chain. While some ap…
Formal Methods for Quantum Programs: A Survey
Christophe Chareton, Sébastien Bardin, Dongho Lee +3
While recent progress in quantum hardware open the door for significant speedup in certain key areas (cryptography, biology, chemistry, optimization, machine learning, etc), quantu…
A Deductive Verification Framework for Circuit-building Quantum Programs
Christophe Chareton, Sébastien Bardin, François Bobot +2
While recent progress in quantum hardware open the door for significant speedup in certain key areas, quantum algorithms are still hard to implement right, and the validation of su…