963 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Institut national de recherche en sciences et technologies du numériqueFR300 papers
- Université de LorraineFR277 papers
- Centre National de la Recherche ScientifiqueFR269 papers
- Centre Inria de l'Université de LorraineFR87 papers
- Sorbonne UniversitéFR26 papers
- Institut Élie Cartan de LorraineFR19 papers
- Université Paris-SaclayFR18 papers
- MOCQUA: Modèles de calcul émergentsFR17 papers
- Laboratoire d'Informatique de Paris-NordFR16 papers
- Université Sorbonne Paris NordFR16 papers
- Institut de Recherche en Informatique de ToulouseFR13 papers
- National Institute of InformaticsJP13 papers
53 papers · 1 filter
Simpler Presentations for Many Fragments of Quantum Circuits
Colin Blake
Equational reasoning is central to quantum circuit optimisation and verification: one replaces subcircuits by provably equivalent ones using a fixed set of rewrite rules viewed as…
A Complete Equational Presentation of Qudit Circuits via Polycontrolled PROPs
Colin Blake
High-dimensional quantum computation needs a native circuit-level equational theory for qudits. We give the first finite schematic equational theory that is sound and complete for…
Inserting Planar-Measured Qubits into MBQC Patterns while Preserving Flow
Miriam Backens, Thomas Perez
In the one-way model of measurement-based quantum computation (MBQC), computation proceeds via single-qubit measurements on a resource state. Flow conditions ensure that the overal…
Deciding Local Unitary Equivalence of Graph States in Quasi-Polynomial Time
Nathan Claudet, Simon Perdrix
We describe an algorithm with quasi-polynomial runtime for deciding local unitary (LU) equivalence of graph states. The algorithm builds on a recent graphical…
Ancilla-free Quantum Adder with Sublinear Depth
Maxime Remaud, Vivien Vandaele
We present the first exact quantum adder with sublinear depth and no ancilla qubits. Our construction is based on classical reversible logic only and employs low-depth implementati…
Local equivalence of stabilizer states: a graphical characterisation
Nathan Claudet, Simon Perdrix
Stabilizer states form a ubiquitous family of quantum states that can be graphically represented through the graph state formalism. A fundamental property of graph states is that a…
Lower T-count with faster algorithms
Vivien Vandaele
Among the cost metrics characterizing a quantum circuit, the -count stands out as one of the most crucial as its minimization is particularly important in various areas of quant…
LDPC-cat codes for low-overhead quantum computing in 2D
Diego Ruiz, Jérémie Guillaud, Anthony Leverrier +2
Quantum low-density parity-check (qLDPC) codes are a promising construction for drastically reducing the overhead of fault-tolerant quantum computing (FTQC) architectures. However,…
Covering a Graph with Minimal Local Sets
Nathan Claudet, Simon Perdrix
Local sets, a graph structure invariant under local complementation, have been originally introduced in the context of quantum computing for the study of quantum entanglement withi…
Vertex-minor universal graphs for generating entangled quantum subsystems
Maxime Cautrès, Nathan Claudet, Mehdi Mhalla +3
We study the notion of -stabilizer universal quantum state, that is, an -qubit quantum state, such that it is possible to induce any stabilizer state on any qubits, by us…
Minimal Equational Theories for Quantum Circuits
Alexandre Clément, Noé Delorme, Simon Perdrix
We introduce the first minimal and complete equational theory for quantum circuits. Hence, we show that any true equation on quantum circuits can be derived from simple rules, all…
Robust sparse IQP sampling in constant depth
Louis Paletta, Anthony Leverrier, Alain Sarlette +2
Between NISQ (noisy intermediate scale quantum) approaches without any proof of robust quantum advantage and fully fault-tolerant quantum computation, we propose a scheme to achiev…
Homological Quantum Rotor Codes: Logical Qubits from Torsion
Christophe Vuillot, Alessandro Ciani, Barbara M. Terhal
We formally define homological quantum rotor codes which use multiple quantum rotors to encode logical information. These codes generalize homological or CSS quantum codes for qubi…
Optimal Hadamard gate count for Clifford synthesis of Pauli rotations sequences
Vivien Vandaele, Simon Martiel, Simon Perdrix +1
The Clifford gate set is commonly used to perform universal quantum computation. In such setup the gate is typically much more expensive to implement in a fault-tolerant wa…
A graph-state based synthesis framework for Clifford isometries
Timothée Goubault de Brugière, Simon Martiel, Christophe Vuillot
We tackle the problem of Clifford isometry compilation, i.e, how to synthesize a Clifford isometry into an executable quantum circuit. We propose a simple framework for synthesis t…
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…
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…
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…
Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-calculus
Alexandre Clément, Simon Perdrix
Coherent control of quantum computations can be used to improve some quantum protocols and algorithms. For instance, the complexity of implementing the permutation of some given un…
Quantum Expectation Transformers for Cost Analysis
Martin Avanzini, Georg Moser, Romain Péchoux +2
We introduce a new kind of expectation transformer for a mixed classical-quantum programming language. Our semantic approach relies on a new notion of a cost structure, which we in…
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…
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…