Jean Francois Couturier

Dr. Jean Francois Couturier


Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 December 2014 in Algorithmica
Verified
Journal Article
Closed access
PDF file
MCManfred Cochefert
Manfred Cochefert
JCJean Francois Couturier
Jean Francois Couturier
PGPetr A. Golovach
Petr A. Golovach
DKDieter Kratsch
Dieter Kratsch
DPDaniël Paulusma
Daniël Paulusma

1 October 2018 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
MCManfred Cochefert
Manfred Cochefert
JCJean Francois Couturier
Jean Francois Couturier
PGPetr A. Golovach
Petr A. Golovach
DKDieter Kratsch
Dieter Kratsch
DPDaniël Paulusma
Daniël Paulusma
ASAnthony Stewart
Anthony Stewart

21 December 2022
Verified
Book Chapter
Closed access
PDF file
Gilberto Javier DíazGilberto Javier Díaz
Gilberto Javier Díaz
Carlos Jaime Barrios HernándezCarlos Jaime Barrios Hernández
Carlos Jaime Barrios Hernández
LSLuiz Angelo Steffenel
Luiz Angelo Steffenel
JCJean Francois Couturier
Jean Francois Couturier

27 June 2016
Verified
Conference Paper
Closed access
ASAlexandre Schneider
Alexandre Schneider
JCJean Francois Couturier
Jean Francois Couturier
In the NUM3D Platform, we search to integrate the knowledge about possibilities of additive manufacturing processes and characteristics of materials. The development of our various activities has highlighted a new Tetraptic CPMF (Control/Process/Material/Form). We develop around this knowledge rules, a Decision Support Tool for Additive Manufacturing (DSTforAM) able to determine an optimal solution for the composition of the CPMF based on the predetermined constraint of the requirements specification.

27 August 2016 in arXiv
Verified
Preprint
Open access
PDF file
MCManfred Cochefert
Manfred Cochefert
JCJean Francois Couturier
Jean Francois Couturier
PGPetr A. Golovach
Petr A. Golovach
DKDieter Kratsch
Dieter Kratsch
DPDaniël Paulusma
Daniël Paulusma
ASAnthony Stewart
Anthony Stewart
A graph H is a square root of a graph G if G can be obtained from H by adding an edge between any two vertices in H that are of distance 2. The Square Root problem is that of deciding whether a given graph admits a square root. This problem is only known to be NP-complete for chordal graphs and polynomial-time solvable for non-trivial minor-closed graph classes and a very limited number of other graph classes. We prove that Square Root is O(n)-time solvable for graphs of maximum degree 5 and O(n^4)-time solvable for graphs of maximum degree at most 6.

9 September 2025 in Quantum Reports
Verified
Journal Article
Open access
PDF file
Gilberto Javier DíazGilberto Javier Díaz
Gilberto Javier Díaz
LSLuiz Angelo Steffenel
Luiz Angelo Steffenel
Carlos Jaime Barrios HernándezCarlos Jaime Barrios Hernández
Carlos Jaime Barrios Hernández
JCJean Francois Couturier
Jean Francois Couturier
Software quantum simulators are essential tools for designing and testing quantum algorithms on classical computing architectures, especially given the current limitations of physical quantum hardware. This work focuses on studying and evaluating memory management strategies for scalable quantum state simulation. We examine full-state representation, dynamic state pruning, shared-memory parallelization with OpenMP, distributed memory execution using MPI, and error-bounded floating-point compression with ZFP. These techniques are implemented in a prototype simulator and assessed using the quantum Fourier transform as a benchmark, with performance compared against leading open-source simulators such as Intel-QS, QuEST, and qsim. The results show the trade-offs between computational overhead and memory efficiency, and demonstrate that hybrid approaches combining distributed memory and compression can significantly extend the number of qubits that can be simulated. This work contributes practical insights for improving the scalability of software quantum simulators on classical hardware through optimized memory usage.