activity
20032026
most citedGraph-theoretic Simplification of Quantum Circuits with the ZX-calculus

194 citations · 1k across the 75 of their papers we have counts for

collaborators
Showing 2025Show all

5 papers · 1 filter

quant-ph2025

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…

quant-ph2025

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…

quant-ph2025

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…

cs.LO2025

Quantum Control and General Recursion beyond the Unitary Case

Kathleen Barsse, Romain Péchoux, Simon Perdrix

Coherent control, aka quantum control, is a central concept in quantum computing that is attracting increasing attention from both the quantum foundations and quantum software comm…

quant-ph2025★ 1 cited

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…