35 citations · 60 across the 4 of their papers we have counts for
6 papers
On constant-time quantum annealing and guaranteed approximations for graph optimization problems
Arthur Braida, Simon Martiel, Ioan Todinca
Quantum Annealing (QA) is a computational framework where a quantum system's continuous evolution is used to find the global minimum of an objective function over an unstructured s…
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…
Decoding techniques applied to the compilation of CNOT circuits for NISQ architectures
Timothée Goubault de Brugière, Marc Baboulin, Benoît Valiron +2
Current proposals for quantum compilers require the synthesis and optimization of linear reversible circuits and among them CNOT circuits. Since these circuits represent a signific…
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…
Benchmarking quantum co-processors in an application-centric, hardware-agnostic and scalable way
Simon Martiel, Thomas Ayral, Cyril Allouche
Existing protocols for benchmarking current quantum co-processors fail to meet the usual standards for assessing the performance of High-Performance-Computing platforms. After a sy…
Causal dynamics of discrete manifolds
Pablo Arrighi, Clément Chouteau, Stefano Facchini +1
We extend Cellular Automata to time-varying discrete geometries. In other words we formalize, and prove theorems about, the intuitive idea of a discrete manifold which evolves in t…