Jean-François Couturier
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jean-François Couturier has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Carlos Jaime Barrios Hernandez
Grupo de Investigación Computo Avanzado y a Gran Escala - CAGE Bucaramanga Santander 680006 Universidad Industrial de Santander
3 shared publications - Daniël Paulusma
Durham University, Durham, UK
3 shared publications - Dieter Kratsch
Laboratoire d'Informatique Théorique et Appliquée Université de Lorraine 57045 Metz Cedex 01 France
3 shared publications - Gilberto Díaz
Universidad Industrial de Santander
3 shared publications - Luiz Angelo Steffenel
Université de Reims Champagne-Ardenne
3 shared publications - Petr A. Golovach
Department of Informatics, University of Bergen
3 shared publications
Latest Publications
- Open Access
- 9 September 2025
- Published by MDPI AG in Quantum Reports
- Vol. 7 (3) , 41
Memory Management Strategies for Software Quantum Simulators
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.
- 9 September 2025
- Published by MDPI AG in Quantum Reports
- Vol. 7 (3) , 41
Open AccessMemory Management Strategies for Software Quantum Simulators
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.
- Open Access
- 19 September 2024
- Published by MDPI AG in Preprints.org
How to Build a Software Quantum Simulator
Software quantum simulators are the most accessible tools for designing and testing quantum algorithms. This paper presents a comprehensive approach to building a software-based quantum simulator based on classical computing architectures. We explore fundamental quantum computing concepts, including state vector representations, quantum gates, and memory management techniques. The simulator prototype implements various memory optimization strategies, such as full-state representation, dynamic state pruning, and shared memory parallelization with OpenMP and distributed memory models using MPI. Additionally, data compression techniques, like ZFP, are explored to enhance simulation performance by reducing memory footprint. The results are validated through performance comparisons with leading open-source quantum simulators, such as Intel-QS, QuEST, and qsim. Our findings highlight the trade-offs between computational overhead and memory efficiency. This demonstrates that a hybrid approach using distributed memory and compression offers the best scalability for simulating large quantum systems. This work provides a foundation for developing efficient quantum simulators supporting more complex quantum algorithms on classical hardware.
- 19 September 2024
- Published by MDPI AG in Preprints.org
Open AccessHow to Build a Software Quantum Simulator
Software quantum simulators are the most accessible tools for designing and testing quantum algorithms. This paper presents a comprehensive approach to building a software-based quantum simulator based on classical computing architectures. We explore fundamental quantum computing concepts, including state vector representations, quantum gates, and memory management techniques. The simulator prototype implements various memory optimization strategies, such as full-state representation, dynamic state pruning, and shared memory parallelization with OpenMP and distributed memory models using MPI. Additionally, data compression techniques, like ZFP, are explored to enhance simulation performance by reducing memory footprint. The results are validated through performance comparisons with leading open-source quantum simulators, such as Intel-QS, QuEST, and qsim. Our findings highlight the trade-offs between computational overhead and memory efficiency. This demonstrates that a hybrid approach using distributed memory and compression offers the best scalability for simulating large quantum systems. This work provides a foundation for developing efficient quantum simulators supporting more complex quantum algorithms on classical hardware.
- 1 October 2018
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 248, 93-101
Computing square roots of graphs with low maximum degree
- 1 October 2018
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 248, 93-101
Computing square roots of graphs with low maximum degree
- Open Access
Squares of Low Maximum Degree
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.
Open AccessSquares of Low Maximum Degree
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.
- 27 June 2016
- Published by U-turn Press LLC
Development of a Decision Support Tool for Additive Manufacturing
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 June 2016
- Published by U-turn Press LLC
Development of a Decision Support Tool for Additive Manufacturing
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.
- 25 December 2014
- Published by Springer Nature in Algorithmica
- Vol. 74 (2) , 602-629
Parameterized Algorithms for Finding Square Roots
- 25 December 2014
- Published by Springer Nature in Algorithmica
- Vol. 74 (2) , 602-629
Parameterized Algorithms for Finding Square Roots