38 citations
- Laboratoire Lorrain de Recherche en Informatique et ses ApplicationsFR13 papers
- Centre National de la Recherche ScientifiqueFR12 papers
- Université de LorraineFR12 papers
- Institut national de recherche en sciences et technologies du numériqueFR6 papers
- Sorbonne UniversitéFR4 papers
- Université Paris-SaclayFR4 papers
- University of EdinburghGB3 papers
- CentraleSupélecFR2 papers
- Centre Inria de l'Université de LorraineFR2 papers
- Future EarthCA2 papers
- Japanese-French Laboratory for InformaticsJP2 papers
- Laboratoire Méthodes FormellesFR2 papers
13 papers
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…
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…
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…
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…
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…
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…