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 2021Show all

6 papers · 1 filter

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…

math.CO2021★ 10 cited

Linear-sized independent sets in random cographs and increasing subsequences in separable permutations

Frédérique Bassino, Mathilde Bouvel, Michael Drmota +4

This paper is interested in independent sets (or equivalently, cliques) in uniform random cographs. We also study their permutation analogs, namely, increasing subsequences in unif…

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…

cs.LO2021★ 3 cited

A tier-based typed programming language characterizing Feasible Functionals

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

The class of Basic Feasible Functionals BFF is the type-2 counterpart of the class FP of type-1 functions computable in polynomial time. Several characterizations have been sug…