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 cs.LOShow all

4 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…

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…

cs.LO2020★ 1 cited

Computational Adequacy for Substructural Lambda Calculi

Vladimir Zamdzhiev

Substructural type systems, such as affine (and linear) type systems, are type systems which impose restrictions on copying (and discarding) of variables, and they have found many…