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

5 papers · 2 filters

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

Quantum Algorithms and Oracles with the Scalable ZX-calculus

Titouan Carette, Yohann D'Anello, Simon Perdrix

The ZX-calculus was introduced as a graphical language able to represent specific quantum primitives in an intuitive way. The recent completeness results have shown the theoretical…

quant-ph2021★ 1 cited

Coherent control and distinguishability of quantum channels via PBS-diagrams

Cyril Branciard, Alexandre Clément, Mehdi Mhalla +1

We introduce a graphical language for coherent control of general quantum channels inspired by practical quantum optical setups involving polarising beam splitters (PBS). As standa…

quant-ph2021

Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory

Titouan Carette, Marc de Visme, Simon Perdrix

Graphical languages, like quantum circuits or ZX-calculus, have been successfully designed to represent (memoryless) quantum computations acting on a finite number of qubits. Meanw…