35 citations
- Centre National de la Recherche ScientifiqueFR5 papers
- Laboratoire Lorrain de Recherche en Informatique et ses ApplicationsFR4 papers
- Laboratoire d'Informatique de GrenobleFR3 papers
- Université de LorraineFR3 papers
- Institut national de recherche en sciences et technologies du numériqueFR2 papers
- MOCQUA: Modèles de calcul émergentsFR2 papers
- Aix-Marseille UniversitéFR1 paper
- Atos (France)FR1 paper
- CentraleSupélecFR1 paper
- Centre Inria de l'Université de LorraineFR1 paper
- Château GombertFR1 paper
- École Nationale Supérieure des Mines de NancyFR1 paper
7 papers · 1 filter
Small k-pairable states
Nathan Claudet, Mehdi Mhalla, Simon Perdrix
A -pairable -qubit state is a resource state that allows Local Operations and Classical Communication (LOCC) protocols to generate EPR-pairs among any -disjoint pairs of t…
Reducing the Depth of Linear Reversible Quantum Circuits
Timothée Goubault de Brugière, Marc Baboulin, Benoît Valiron +2
In quantum computing the decoherence time of the qubits determines the computation time available and this time is very limited when using current hardware. In this paper we minimi…
Outcome determinism in measurement-based quantum computation with qudits
Robert I. Booth, Aleks Kissinger, Damian Markham +2
In measurement-based quantum computing (MBQC), computation is carried out by a sequence of measurements and corrections on an entangled state. Flow, and related concepts, are power…
Coherent control and distinguishability of quantum channels via PBS-diagrams
Cyril Branciard, Alexandre Clément, Mehdi Mhalla +1
We introduce a graphical language for coherent control of general quantum channels inspired by practical quantum optical setups involving polarising beam splitters (PBS). As standa…
Qualifying quantum approaches for hard industrial optimization problems. A case study in the field of smart-charging of electric vehicles
Constantin Dalyac, Loïc Henriet, Emmanuel Jeandel +4
In order to qualify quantum algorithms for industrial NP-Hard problems, comparing them to available polynomial approximate classical algorithms and not only to exact ones -- expone…
Quantum XYZ Product Codes
Anthony Leverrier, Simon Apers, Christophe Vuillot
We study a three-fold variant of the hypergraph product code construction, differing from the standard homological product of three classical codes. When instantiated with 3 classi…