Challenging Benchmarks for Diagrammatic Equivalence of Circuits in TPTP and SMT-LIB.
With Julie Cailler and Sophie Tourret.
Published at LPAR 2026.
https://arxiv.org/abs/2608.27087.
Cite this paper with BibTex. @inproceedings{CDT2026, author = {Cailler, Julie and Delorme, No\'{e} and Tourret, Sophie}, title = {Challenging Benchmarks for Diagrammatic Equivalence of Circuits in TPTP and SMT-LIB}, eprint = {2608.27087}, url = {https://arxiv.org/abs/2608.27087}, booktitle = {26th International Conference on Logic for Programming Artificial Intelligence and Reasoning}, series = {LPAR 2026}, year = {2026}, }

Towards Term-based Verification of Diagrammatic Equivalence.
With Julie Cailler, Sophie Tourret, and Simon Perdrix.
Published at IJCAR 2026.
https://arxiv.org/abs/2602.11035.
Cite this paper with BibTex. @inproceedings{CDTP2026, author = {Cailler, Julie and Delorme, No\'{e} and Tourret, Sophie and Perdrix, Simon}, title = {Towards Term-based Verification of Diagrammatic Equivalence}, eprint = {2602.11035}, url = {https://arxiv.org/abs/2602.11035}, booktitle = {13th International Joint Conference on Automated Reasoning}, series = {IJCAR 2026}, year = {2026}, }

Diagrammatic Reasoning with Control as a Constructor, Applications to Quantum Circuits.
With Simon Perdrix.
Published at FoSSaCS 2026.
https://arxiv.org/abs/2508.21756.
Cite this paper with BibTex. @inproceedings{DP2025, author = {Delorme, No\'{e} and Perdrix, Simon}, title = {Diagrammatic Reasoning with Control as a Constructor, Applications to Quantum Circuits}, eprint = {2508.21756}, url = {https://arxiv.org/abs/2508.21756}, booktitle = {29th International Conference on Foundations of Software Science and Computation Structures}, series = {FoSSaCS 2024}, year = {2024}, }

Minimal Equational Theories for Quantum Circuits.
With Alexandre Clément and Simon Perdrix.
Published at LICS 2024.
https://arxiv.org/abs/2311.07476.
Cite this paper with BibTex. @inproceedings{CDP2024, author = {Cl\'{e}ment, Alexandre and Delorme, No\'{e} and Perdrix, Simon}, title = {Minimal Equational Theories for Quantum Circuits}, doi = {10.1145/3661814.3662088}, eprint = {2311.07476}, url = {https://arxiv.org/abs/2311.07476}, booktitle = {39th Annual ACM/IEEE Symposium on Logic in Computer Science}, series = {LICS 2024}, year = {2024} }

Quantum Circuit Completeness: Extensions and Simplifications.
With Alexandre Clément, Simon Perdrix, and Renaud Vilmart.
Published at CSL 2024.
https://arxiv.org/abs/2303.03117.
Cite this paper with BibTex. @inproceedings{CDPV2024, author = {Cl\'{e}ment, Alexandre and Delorme, No\'{e} and Perdrix, Simon and Vilmart, Renaud}, title = {Quantum Circuit Completeness: Extensions and Simplifications}, doi = {10.4230/LIPIcs.CSL.2024.20}, eprint = {2303.03117}, url = {https://arxiv.org/abs/2303.03117}, booktitle = {32nd EACSL Annual Conference on Computer Science Logic}, series = {CSL 2024}, year = {2024}, }