activity
20042022
most citedReducing the Depth of Linear Reversible Quantum Circuits

35 citations · 87 across the 10 of their papers we have counts for

collaborators
Showing cs.LOShow all

9 papers · 1 filter

cs.LO2021

Proceedings 17th International Conference on Quantum Physics and Logic

Benoît Valiron, Shane Mansfield, Pablo Arrighi +1

This volume contains the proceedings of the 17th International Conference on Quantum Physics and Logic (QPL 2020), which was held June 2-6, 2020. Quantum Physics and Logic is an an…

cs.LO2021

Reasoning about Recursive Quantum Programs

Zhaowei Xu, Mingsheng Ying, Benoît Valiron

Most modern (classical) programming languages support recursion. Recursion has also been successfully applied to the design of several quantum algorithms and introduced in a couple…

cs.LO2021

An Interactive Proof of Termination for a Concurrent -calculus with References and Explicit Substitutions

Yann Hamdaoui, Benoît Valiron

In this paper we introduce a typed, concurrent -calculus with references featuring explicit substitutions for variables and references. Alongside usual safety properties, we rec…

cs.LO2019

Realizability in the Unitary Sphere

Alejandro Díaz-Caro, Mauricio Guillermo, Alexandre Miquel +1

In this paper we present a semantics for a linear algebraic lambda-calculus based on realizability. This semantics characterizes a notion of unitarity in the system, answering a lo…

cs.LO2018

From Symmetric Pattern-Matching to Quantum Control (Extended Version)

Amr Sabry, Benoît Valiron, Juliana Kaizer Vizzotto

One perspective on quantum algorithms is that they are classical algorithms having access to a special kind of memory with exotic properties. This perspective suggests that, even i…

cs.LO2016

Generating reversible circuits from higher-order functional programs

Benoit Valiron

Boolean reversible circuits are boolean circuits made of reversible elementary gates. Despite their constrained form, they can simulate any boolean function. The synthesis and vali…