output
20172022
most citedGraph-theoretic Simplification of Quantum Circuits with the ZX-calculus

194 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing 2022Show all

7 papers · 1 filter

cs.LO2022

A programming language characterizing quantum polynomial time

Emmanuel Hainry, Romain Péchoux, Mário Silva

We introduce a first-order quantum programming language, named FOQ, whose terminating programs are reversible. We restrict FOQ to a strict and tractable subset, named PFOQ, of term…

cs.LO2022

Complete and tractable machine-independent characterizations of second-order polytime

Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion +1

The class of Basic Feasible Functionals BFF is the second-order counterpart of the class of first-order functions computable in polynomial time. We present several implicit charact…

quant-ph2022★ 1 cited

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…

quant-ph2022★ 7 cited

LOv-Calculus: A Graphical Language for Linear Optical Quantum Circuits

Alexandre Clément, Nicolas Heurtel, Shane Mansfield +2

We introduce the LOv-calculus, a graphical language for reasoning about linear optical quantum circuits with so-called vacuum state auxiliary inputs. We present the axiomatics of t…

quant-ph2022★ 4 cited

Complete ZX-calculi for the stabiliser fragment in odd prime dimensions

Robert I. Booth, Titouan Carette

We introduce a family of ZX-calculi which axiomatise the stabiliser fragment of quantum theory in odd prime dimensions. These calculi recover many of the nice features of the qubit…

quant-ph2022★ 3 cited

Addition and Differentiation of ZX-diagrams

Emmanuel Jeandel, Simon Perdrix, Margarita Veshchezerova

The ZX-calculus is a powerful framework for reasoning in quantum computing. It provides in particular a compact representation of matrices of interests. A peculiar property of the…

quant-ph2022★ 2 cited

Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-calculus

Alexandre Clément, Simon Perdrix

Coherent control of quantum computations can be used to improve some quantum protocols and algorithms. For instance, the complexity of implementing the permutation of some given un…