18 citations · 65 across the 19 of their papers we have counts for
4 papers · 1 filter
Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of Quantum Computing
Renaud Vilmart
The "Sum-Over-Paths" formalism is a way to symbolically manipulate linear maps that describe quantum systems, and is a tool that is used in formal verification of such systems. We…
Quantum Circuit Completeness: Extensions and Simplifications
Alexandre Clément, Noé Delorme, Simon Perdrix +1
Although quantum circuits have been ubiquitous for decades in quantum computing, the first complete equational theory for quantum circuits has only recently been introduced. Comple…
Compositionality of planar perfect matchings
Titouan Carette, Etienne Moutot, Thomas Perez +1
We exhibit a strong connection between the matchgate formalism introduced by Valiant and the ZW-calculus of Coecke and Kissinger. This connection provides a natural compositional f…
Complete Graphical Language for Hermiticity-Preserving Superoperators
Titouan Carette, Timothée Hoffreumon, Émile Larroque +1
Universal and complete graphical languages have been successfully designed for pure state quantum mechanics, corresponding to linear maps between Hilbert spaces, and mixed states q…