default search action
Renaud Vilmart
Person information
- affiliation: Inria, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j2]Renaud Vilmart:
Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of Quantum Computing. Log. Methods Comput. Sci. 20(1) (2024) - [c16]Alexandre Clément
, Noé Delorme
Quantum Circuit Completeness: Extensions and Simplifications. CSL 2024: 20:1-20:23 - 2023
- [c15]Renaud Vilmart:
Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Dyadic Fragments of Quantum Computation. CSL 2023: 36:1-36:17 - [c14]Titouan Carette, Etienne Moutot, Thomas Perez, Renaud Vilmart:
Compositionality of Planar Perfect Matchings: A Universal and Complete Fragment of ZW-Calculus. ICALP 2023: 120:1-120:17 - [c13]Titouan Carette, Timothée Hoffreumon, Émile Larroque, Renaud Vilmart:
Complete Graphical Language for Hermiticity-Preserving Superoperators. LICS 2023: 1-22 - [p1]Christophe Chareton, Dongho Lee, Benoît Valiron, Renaud Vilmart, Sébastien Bardin, Zhaowei Xu:
Formal Methods for Quantum Algorithms. Handb. Formal Anal. Verification Cryptogr. 2023: 319-422 - [i10]Titouan Carette, Timothée Hoffreumon
Complete Graphical Language for Hermiticity-Preserving Superoperators. CoRR abs/2302.04212 (2023) - [i9]Alexandre Clément, Noé Delorme, Simon Perdrix, Renaud Vilmart:
Simple Complete Equational Theories for Quantum Circuits with Ancillae or Partial Trace. CoRR abs/2303.03117 (2023) - [i8]Renaud Vilmart:
Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of Quantum Computing. CoRR abs/2307.14223 (2023) - 2022
- [c12]Aleks Kissinger, John van de Wetering
Classical Simulation of Quantum Circuits with Partial and Graphical Stabiliser Decompositions. TQC 2022: 5:1-5:13 - [i7]Renaud Vilmart:
Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Clifford Hierarchy. CoRR abs/2205.02600 (2022) - [i6]Kostia Chardonnet, Marc de Visme, Benoît Valiron, Renaud Vilmart:
The Many-Worlds Calculus: Representing Quantum Control. CoRR abs/2206.10234 (2022) - [i5]Kostia Chardonnet, Benoît Valiron, Renaud Vilmart:
Geometry of Interaction for ZX-Diagrams. CoRR abs/2206.10916 (2022) - 2021
- [c11]Renaud Vilmart
The Structure of Sum-Over-Paths, its Consequences, and Completeness for Clifford. FoSSaCS 2021: 531-550 - [c10]Kostia Chardonnet, Benoît Valiron
Geometry of Interaction for ZX-Diagrams. MFCS 2021: 30:1-30:16 - [c9]Renaud Vilmart:
Quantum Multiple-Valued Decision Diagrams in Graphical Calculi. MFCS 2021: 89:1-89:15 - [i4]Renaud Vilmart:
Quantum Multiple-Valued Decision Diagrams in Graphical Calculi. CoRR abs/2107.01186 (2021) - [i3]Christophe Chareton, Sébastien Bardin, Dongho Lee, Benoît Valiron, Renaud Vilmart, Zhaowei Xu:
Formal Methods for Quantum Programs: A Survey. CoRR abs/2109.06493 (2021) - 2020
- [j1]Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart:
Completeness of the ZX-Calculus. Log. Methods Comput. Sci. 16(2) (2020)
2010 – 2019
- 2019
- [b1]Renaud Vilmart:
ZX-Calculi for Quantum Computing and their Completeness. (ZX-Calculs pour l'Informatique Quantique et leur Complétude). University of Lorraine, Nancy, France, 2019 - [c8]Titouan Carette, Emmanuel Jeandel
Completeness of Graphical Languages for Mixed States Quantum Mechanics. ICALP 2019: 108:1-108:15 - [c7]Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart:
A Generic Normal Form for ZX-Diagrams and Application to the Rational Angle Completeness. LICS 2019: 1-10 - [c6]Renaud Vilmart:
A Near-Minimal Axiomatisation of ZX-Calculus for Pure Qubit Quantum Mechanics. LICS 2019: 1-10 - [i2]Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart:
Completeness of the ZX-Calculus. CoRR abs/1903.06035 (2019) - 2018
- [c5]Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart:
A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics. LICS 2018: 559-568 - [c4]Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart:
Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics. LICS 2018: 569-578 - [c3]Renaud Vilmart:
A ZX-Calculus with Triangles for Toffoli-Hadamard, Clifford+T, and Beyond. QPL 2018: 313-344 - 2017
- [c2]Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart, Quanlong Wang:
ZX-Calculus: Cyclotomic Supplementarity and Incompleteness for Clifford+T Quantum Mechanics. MFCS 2017: 11:1-11:13 - [c1]Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart:
Y-Calculus: A language for real Matrices derived from the ZX-Calculus. QPL 2017: 23-57 - [i1]Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart, Quanlong Wang:
Generalised Supplementarity and new rule for Empty Diagrams to Make the ZX-Calculus More Expressive. CoRR abs/1702.01945 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: