Renaud Vilmart

Log. Methods Comput. Sci., 2024

Quantum Circuit Completeness: Extensions and Simplifications.

[BibT_eX]

[DOI]

Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2023

Simple Complete Equational Theories for Quantum Circuits with Ancillae or Partial Trace.

[BibT_eX]

[DOI]

CoRR, 2023

Complete Graphical Language for Hermiticity-Preserving Superoperators.

[BibT_eX]

[DOI]

LICS, 2023

Compositionality of Planar Perfect Matchings: A Universal and Complete Fragment of ZW-Calculus.

[BibT_eX]

[DOI]

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Dyadic Fragments of Quantum Computation.

[BibT_eX]

[DOI]

Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

Formal Methods for Quantum Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Formal Analysis and Verification in Cryptography, 2023

2022

The Many-Worlds Calculus: Representing Quantum Control.

[BibT_eX]

[DOI]

CoRR, 2022

Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Clifford Hierarchy.

[BibT_eX]

[DOI]

CoRR, 2022

Classical Simulation of Quantum Circuits with Partial and Graphical Stabiliser Decompositions.

[BibT_eX]

[DOI]

Aleks Kissinger

John van de Wetering

Proceedings of the 17th Conference on the Theory of Quantum Computation, 2022

2021

Formal Methods for Quantum Programs: A Survey.

[BibT_eX]

[DOI]

CoRR, 2021

Quantum Multiple-Valued Decision Diagrams in Graphical Calculi.

[BibT_eX]

[DOI]

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Geometry of Interaction for ZX-Diagrams.

[BibT_eX]

[DOI]

Kostia Chardonnet

Benoît Valiron

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

The Structure of Sum-Over-Paths, its Consequences, and Completeness for Clifford.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2021

2020

Completeness of the ZX-Calculus.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2020

2019

ZX-Calculi for Quantum Computing and their Completeness. (ZX-Calculs pour l'Informatique Quantique et leur Complétude).

[BibT_eX]

[DOI]

PhD thesis, 2019

A Near-Minimal Axiomatisation of ZX-Calculus for Pure Qubit Quantum Mechanics.

[BibT_eX]

[DOI]

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

A Generic Normal Form for ZX-Diagrams and Application to the Rational Angle Completeness.

[BibT_eX]

[DOI]

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

Completeness of Graphical Languages for Mixed States Quantum Mechanics.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

A ZX-Calculus with Triangles for Toffoli-Hadamard, Clifford+T, and Beyond.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 15th International Conference on Quantum Physics and Logic, 2018

Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics.

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics.

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017

Generalised Supplementarity and new rule for Empty Diagrams to Make the ZX-Calculus More Expressive.

[BibT_eX]

[DOI]

CoRR, 2017

Y-Calculus: A language for real Matrices derived from the ZX-Calculus.

[BibT_eX]

[DOI]