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 quant-phShow all

13 papers · 1 filter

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…

quant-ph2021★ 38 cited

Contextuality and Wigner negativity are equivalent for continuous-variable quantum measurements

Robert I. Booth, Ulysse Chabaud, Pierre-Emmanuel Emeriau

Quantum computers will provide considerable speedups with respect to their classical counterparts. However, the identification of the innately quantum features that enable these sp…

quant-ph2021★ 5 cited

Outcome determinism in measurement-based quantum computation with qudits

Robert I. Booth, Aleks Kissinger, Damian Markham +2

In measurement-based quantum computing (MBQC), computation is carried out by a sequence of measurements and corrections on an entangled state. Flow, and related concepts, are power…

quant-ph2021★ 12 cited

Hybrid quantum-classical circuit simplification with the ZX-calculus

Agustín Borgna, Simon Perdrix, Benoît Valiron

We present a complete optimization procedure for hybrid quantum-classical circuits with classical parity logic. While common optimization techniques for quantum algorithms focus on…

quant-ph2021★ 4 cited

Flow conditions for continuous variable measurement-based quantum computing

Robert I. Booth, Damian Markham

In measurement-based quantum computing (MBQC), computation is carried out by a sequence of measurements and corrections on an entangled state. Flow, and related concepts, are power…

quant-ph2019★ 10 cited

SZX-calculus: Scalable Graphical Quantum Reasoning

Titouan Carette, Dominic Horsman, Simon Perdrix

We introduce the Scalable ZX-calculus (SZX-calculus for short), a formal and compact graphical language for the design and verification of quantum computations. The SZX-calculus is…

quant-ph2019★ 194 cited

Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus

Ross Duncan, Aleks Kissinger, Simon Perdrix +1

We present a completely new approach to quantum circuit optimisation, based on the ZX-calculus. We first interpret quantum circuits as ZX-diagrams, which provide a flexible, lower-…

quant-ph2018★ 1 cited

The rational fragment of the ZX-calculus

Emmanuel Jeandel

We introduce here a new axiomatisation of the rational fragment of the ZX-calculus, a diagrammatic language for quantum mechanics. Compared to the previous axiomatisation introduce…

quant-ph2017★ 6 cited

Towards a Minimal Stabilizer ZX-calculus

Miriam Backens, Simon Perdrix, Quanlong Wang

The stabilizer ZX-calculus is a rigorous graphical language for reasoning about quantum mechanics. The language is sound and complete: one can transform a stabilizer ZX-diagram int…