Simon Martiel
Research Subjects
Simon Martiel has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Pablo Arrighi
Aix-Marseille University
4 shared publications - Cyril Allouche
Atos, 4980 Les Clayes-sous-Bois, le-de-France, France
2 shared publications - Simon Perdrix
Université de Lorraine, CNRS, Inria, LORIA
2 shared publications Ali Javadi-Abhari
IBM Quantum, IBM T. J. Watson Research Center, Yorktown Heights, NY 10598, USA
1 shared publication- Antonio Mezzacapo
IBM T.J. Watson Research Center
1 shared publication - Arthur Braida
Independent Researcher
1 shared publication
Latest Publications
- 22 June 2025
- Published by Springer Nature
- p. 54-70
Universal Graph Theory Operations for Graph State Preparation
- 22 June 2025
- Published by Springer Nature
- p. 54-70
Universal Graph Theory Operations for Graph State Preparation
- Top Cited PapersOpen Access
- 20 June 2025
- Published by American Association for the Advancement of Science (AAAS) in Science Advances
- Vol. 11 (25) , eadu9991
Chemistry beyond the scale of exact diagonalization on a quantum-centric supercomputer
A universal quantum computer can simulate diverse quantum systems, with electronic structure for chemistry offering challenging problems for practical use cases around the hundred-qubit mark. Although current quantum processors have reached this size, deep circuits and a large number of measurements lead to prohibitive runtimes for quantum computers in isolation. Here, we demonstrate the use of classical distributed computing to offload all but an intrinsically quantum component of a workflow for electronic structure simulations. Using a Heron superconducting processor and the supercomputer Fugaku, we simulate the ground-state dissociation of N 2 and the ground state properties of [2Fe-2S] and [4Fe-4S] clusters, with circuits up to 77 qubits and 10,570 gates. The proposed algorithm processes quantum samples to produce upper bounds for the ground-state energy and sparse approximations to the ground-state wave functions. Our results suggest that, for current error rates, a quantum-centric supercomputing architecture can tackle challenging chemistry problems beyond sizes amenable to exact diagonalization.
- 20 June 2025
- Published by American Association for the Advancement of Science (AAAS) in Science Advances
- Vol. 11 (25) , eadu9991
Top Cited PapersOpen AccessChemistry beyond the scale of exact diagonalization on a quantum-centric supercomputer
A universal quantum computer can simulate diverse quantum systems, with electronic structure for chemistry offering challenging problems for practical use cases around the hundred-qubit mark. Although current quantum processors have reached this size, deep circuits and a large number of measurements lead to prohibitive runtimes for quantum computers in isolation. Here, we demonstrate the use of classical distributed computing to offload all but an intrinsically quantum component of a workflow for electronic structure simulations. Using a Heron superconducting processor and the supercomputer Fugaku, we simulate the ground-state dissociation of N 2 and the ground state properties of [2Fe-2S] and [4Fe-4S] clusters, with circuits up to 77 qubits and 10,570 gates. The proposed algorithm processes quantum samples to produce upper bounds for the ground-state energy and sparse approximations to the ground-state wave functions. Our results suggest that, for current error rates, a quantum-centric supercomputing architecture can tackle challenging chemistry problems beyond sizes amenable to exact diagonalization.
- Open Access
- 13 February 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Quantum Computing
- Vol. 6 (2) , 1-24
Shallower CNOT Circuits on Realistic Quantum Hardware
We focus on the depth optimization of CNOT circuits on hardware with limited connectivity. We adapt the algorithm from Kutin et al. that implements any n -qubit CNOT circuit in depth at most 5n on a Linear Nearest Neighbor architecture. Our proposal is a block version of Kutin et al.’s algorithm that is scalable with the number of interactions available in the hardware: the more interactions we have, the less the depth. We derive better theoretical upper bounds and provide a simple implementation of the algorithm. Overall, we achieve better depth complexity for CNOT circuits on some realistic quantum hardware like a grid or a ladder. For instance, the execution of an n -qubit CNOT circuit on a grid can be done in depth 4n+8 .
- 13 February 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Quantum Computing
- Vol. 6 (2) , 1-24
Open AccessShallower CNOT Circuits on Realistic Quantum Hardware
We focus on the depth optimization of CNOT circuits on hardware with limited connectivity. We adapt the algorithm from Kutin et al. that implements any n -qubit CNOT circuit in depth at most 5n on a Linear Nearest Neighbor architecture. Our proposal is a block version of Kutin et al.’s algorithm that is scalable with the number of interactions available in the hardware: the more interactions we have, the less the depth. We derive better theoretical upper bounds and provide a simple implementation of the algorithm. Overall, we achieve better depth complexity for CNOT circuits on some realistic quantum hardware like a grid or a ladder. For instance, the execution of an n -qubit CNOT circuit on a grid can be done in depth 4n+8 .
- Open Access
- 24 February 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Quantum Computing
- Vol. 5 (1) , 1-29
Optimal Hadamard Gate Count for Clifford+ T Synthesis of Pauli Rotations Sequences
The Clifford+ T gate set is commonly used to perform universal quantum computation. In such setup the T gate is typically much more expensive to implement in a fault-tolerant way than Clifford gates. To improve the feasibility of fault-tolerant quantum computing it is then crucial to minimize the number of T gates. Many algorithms, yielding effective results, have been designed to address this problem. It has been demonstrated that performing a pre-processing step consisting of reducing the number of Hadamard gates in the circuit can help to exploit the full potential of these algorithms and thereby lead to a substantial T -count reduction. Moreover, minimizing the number of Hadamard gates also restrains the number of additional qubits and operations resulting from the gadgetization of Hadamard gates, a procedure used by some compilers to further reduce the number of T gates. In this work we tackle the Hadamard gate reduction problem, and propose an algorithm for synthesizing a sequence of π /4 Pauli rotations with a minimal number of Hadamard gates. Based on this result, we present an algorithm which optimally minimizes the number of Hadamard gates lying between the first and the last T gate of the circuit.
- 24 February 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Quantum Computing
- Vol. 5 (1) , 1-29
Open AccessOptimal Hadamard Gate Count for Clifford+ T Synthesis of Pauli Rotations Sequences
The Clifford+ T gate set is commonly used to perform universal quantum computation. In such setup the T gate is typically much more expensive to implement in a fault-tolerant way than Clifford gates. To improve the feasibility of fault-tolerant quantum computing it is then crucial to minimize the number of T gates. Many algorithms, yielding effective results, have been designed to address this problem. It has been demonstrated that performing a pre-processing step consisting of reducing the number of Hadamard gates in the circuit can help to exploit the full potential of these algorithms and thereby lead to a substantial T -count reduction. Moreover, minimizing the number of Hadamard gates also restrains the number of additional qubits and operations resulting from the gadgetization of Hadamard gates, a procedure used by some compilers to further reduce the number of T gates. In this work we tackle the Hadamard gate reduction problem, and propose an algorithm for synthesizing a sequence of π /4 Pauli rotations with a minimal number of Hadamard gates. Based on this result, we present an algorithm which optimally minimizes the number of Hadamard gates lying between the first and the last T gate of the circuit.
- Open Access
Architecture aware compilation of quantum circuits via lazy synthesis
Qubit routing is a key problematic related to quantum circuit compilation. It consists in rewriting a quantum circuit by adding the least possible number of instructions to make the circuit compliant with some architecture's connectivity constraints. Usually, this problem is tackled via either SWAP insertion techniques or re-synthesis of portions of the circuit using architecture aware synthesis algorithms. In this work, we propose a meta-heuristic that couples the iterative approach of SWAP insertion techniques with greedy architecture aware synthesis routines. We propose two new compilation algorithms based on this meta-heuristic and compare their performances to state-of-the-art quantum circuit compilation techniques for several standard classes of quantum circuits and show significant reduction in the entangling gate overhead due to compilation.
Open AccessArchitecture aware compilation of quantum circuits via lazy synthesis
Qubit routing is a key problematic related to quantum circuit compilation. It consists in rewriting a quantum circuit by adding the least possible number of instructions to make the circuit compliant with some architecture's connectivity constraints. Usually, this problem is tackled via either SWAP insertion techniques or re-synthesis of portions of the circuit using architecture aware synthesis algorithms. In this work, we propose a meta-heuristic that couples the iterative approach of SWAP insertion techniques with greedy architecture aware synthesis routines. We propose two new compilation algorithms based on this meta-heuristic and compare their performances to state-of-the-art quantum circuit compilation techniques for several standard classes of quantum circuits and show significant reduction in the entangling gate overhead due to compilation.
- 1 February 2022
- Published by Elsevier in Science of Computer Programming
- Vol. 214
Decoding techniques applied to the compilation of CNOT circuits for NISQ architectures
- 1 February 2022
- Published by Elsevier in Science of Computer Programming
- Vol. 214
Decoding techniques applied to the compilation of CNOT circuits for NISQ architectures
- 6 August 2021
- Published by Springer Nature in Quantum Information Processing
- Vol. 20 (8) , 1-20
Anti-crossings and spectral gap during quantum adiabatic evolution
- 6 August 2021
- Published by Springer Nature in Quantum Information Processing
- Vol. 20 (8) , 1-20
Anti-crossings and spectral gap during quantum adiabatic evolution
- Open Access
- 17 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Quantum Engineering
- Vol. 2, 1-11
Benchmarking Quantum Coprocessors in an Application-Centric, Hardware-Agnostic, and Scalable Way
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 synthetic review of these protocols---whether at the gate, circuit or application level---we introduce a new benchmark, dubbed Atos Q-score (TM), that is application-centric, hardware-agnostic and scalable to quantum advantage processor sizes and beyond. The Q-score measures the maximum number of qubits that can be used \emph{effectively} to solve the MaxCut combinatorial optimization problem with the Quantum Approximate Optimization Algorithm. We give a robust definition of the notion of effective performance by introducing an improved approximation ratio based on the scaling of random and optimal algorithms. We illustrate the behavior of Q-score using perfect and noisy simulations of quantum processors. Finally, we provide an open-source implementation of Q-score that makes it easy to compute the Q-score of any quantum hardware.
- 17 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Quantum Engineering
- Vol. 2, 1-11
Open AccessBenchmarking Quantum Coprocessors in an Application-Centric, Hardware-Agnostic, and Scalable Way
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 synthetic review of these protocols---whether at the gate, circuit or application level---we introduce a new benchmark, dubbed Atos Q-score (TM), that is application-centric, hardware-agnostic and scalable to quantum advantage processor sizes and beyond. The Q-score measures the maximum number of qubits that can be used \emph{effectively} to solve the MaxCut combinatorial optimization problem with the Quantum Approximate Optimization Algorithm. We give a robust definition of the notion of effective performance by introducing an improved approximation ratio based on the scaling of random and optimal algorithms. We illustrate the behavior of Q-score using perfect and noisy simulations of quantum processors. Finally, we provide an open-source implementation of Q-score that makes it easy to compute the Q-score of any quantum hardware.
- 24 October 2019
- Published by Springer Nature in Natural Computing
- Vol. 19 (1) , 157-178
Reversible causal graph dynamics: invertibility, block representation, vertex-preservation
- 24 October 2019
- Published by Springer Nature in Natural Computing
- Vol. 19 (1) , 157-178
Reversible causal graph dynamics: invertibility, block representation, vertex-preservation
- Open Access
Causal dynamics of discrete manifolds
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 time, subject to two natural constraints: the evolution does not propagate information too fast; and it acts everywhere the same. For this purpose we develop a correspondence between complexes and labeled graphs. In particular we reformulate the properties that characterize discrete manifolds amongst complexes, solely in terms of graphs. In dimensions $n<4$, over bounded-star graphs, it is decidable whether a Cellular Automaton maps discrete manifolds into discrete manifolds.Open AccessCausal dynamics of discrete manifolds
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 time, subject to two natural constraints: the evolution does not propagate information too fast; and it acts everywhere the same. For this purpose we develop a correspondence between complexes and labeled graphs. In particular we reformulate the properties that characterize discrete manifolds amongst complexes, solely in terms of graphs. In dimensions $n<4$, over bounded-star graphs, it is decidable whether a Cellular Automaton maps discrete manifolds into discrete manifolds.