1 citations · 1 across the 3 of their papers we have counts for
8 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…
Shadow Pauli Flow: Characterising Determinism in MBQCs involving Pauli Measurements
Mehdi Mhalla, Simon Perdrix, Luc Sanselme
We introduce a new characterisation of determinism in Measurement-Based Quantum Computing (MBQC). The one-way model consists in performing local measurements over a large entangled…
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…
Covering a Graph with Minimal Local Sets
Nathan Claudet, Simon Perdrix
Local sets, a graph structure invariant under local complementation, have been originally introduced in the context of quantum computing for the study of quantum entanglement withi…