194 citations · 1k across the 75 of their papers we have counts for
65 papers · 1 filter
Completeness for flow-preserving rewrite rules
Miriam Backens, Simon Perdrix
Complete sets of graphical rewrite rules enable fully graphical reasoning about quantum computations and have been an area of active research for more than a decade. Many recent ap…
Invariants in Linear Optics
Sébastien Draux, Simon Perdrix, Emmanuel Jeandel +1
Linear optics (LO) prohibits certain transformations. In this paper, we study the conditions for a computation to be possible in LO. We find that there are finitely many polynomial…
Quantum Graph States: Bridging Classical Theory and Quantum Innovation, Workshop Summary
Eric Chitambar, Kenneth Goodenough, Otfried Gühne +5
This workshop brought together experts in classical graph theory and quantum information science to explore the intersection of these fields, with a focus on quantum graph states a…
Diagrammatic Reasoning with Control as a Constructor, Applications to Quantum Circuits
Noé Delorme, Simon Perdrix
Control is a fundamental concept in quantum and reversible computational models. It enables the conditional application of a transformation to a system, depending on the state of a…
Deciding Local Unitary Equivalence of Graph States in Quasi-Polynomial Time
Nathan Claudet, Simon Perdrix
We describe an algorithm with quasi-polynomial runtime for deciding local unitary (LU) equivalence of graph states. The algorithm builds on a recent graphical…
Local equivalence of stabilizer states: a graphical characterisation
Nathan Claudet, Simon Perdrix
Stabilizer states form a ubiquitous family of quantum states that can be graphically represented through the graph state formalism. A fundamental property of graph states is that a…