60 citations
- Université Paris-SaclayFR43 papers
- Centre National de la Recherche ScientifiqueFR36 papers
- CentraleSupélecFR17 papers
- Institut national de recherche en sciences et technologies du numériqueFR14 papers
- École Normale Supérieure - PSLFR11 papers
- École Normale Supérieure Paris-SaclayFR8 papers
- Laboratoire de Biologie et Pharmacologie AppliquéeFR8 papers
- Laboratoire Lorrain de Recherche en Informatique et ses ApplicationsFR8 papers
- Centre Inria de SaclayFR6 papers
- Institut Universitaire de FranceFR6 papers
- Université de LorraineFR6 papers
- Aix-Marseille UniversitéFR5 papers
8 papers · 2 filters
A single-particle framework for unitary lattice gauge theory in discrete time
Pablo Arnault, Christopher Cedzich
We construct a real-time lattice-gauge-theory-type action for a spin-1/2 matter field of a single particle on a (1+1)-dimensional spacetime lattice. The framework is based on a dis…
A Complete Equational Theory for Quantum Circuits
Alexandre Clément, Nicolas Heurtel, Shane Mansfield +2
We introduce the first complete equational theory for quantum circuits. More precisely, we introduce a set of circuit equations that we prove to be sound and complete: two circuits…
Strong Simulation of Linear Optical Processes
Nicolas Heurtel, Shane Mansfield, Jean Senellart +1
In this paper, we provide an algorithm and general framework for the simulation of photons passing through linear optical interferometers. Given photons at the input of an -…
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…
Classical simulation of quantum circuits with partial and graphical stabiliser decompositions
Aleks Kissinger, John van de Wetering, Renaud Vilmart
Recent developments in classical simulation of quantum circuits make use of clever decompositions of chunks of magic states into sums of efficiently simulable stabiliser states. We…
Gaussian Elimination versus Greedy Methods for the Synthesis of Linear Reversible Circuits
Timothée Goubault de Brugière, Marc Baboulin, Benoît Valiron +2
Linear reversible circuits represent a subclass of reversible circuits with many applications in quantum computing. These circuits can be efficiently simulated by classical compute…