Simon Martiel

Atos (France) — France

Computer Science · Physical Sciences

11h-index528citations48works24.52yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Quantum Computing Algorithms and Architecture(29), Quantum Information and Cryptography(19), Quantum-Dot Cellular Automata(12), Cellular Automata and Applications(11), DNA and Biological Computing(6)

Publications48 total

Big cats: entanglement in 120 qubits and beyond
arXiv (Cornell University)·2025Open Access
Chemistry beyond the scale of exact diagonalization on a quantum-centric supercomputer
Science Advances·2025· 50 citedOpen Access
Low-overhead error detection with spacetime codes
arXiv (Cornell University)·2025· 2 citedOpen Access
A graph-state based synthesis framework for Clifford isometries
Quantum·2025· 1 citedOpen Access
Universal Graph Theory Operations for Graph State Preparation
Lecture notes in computer science·2025Open Access
Efficient Hamiltonian Simulation: A Utility Scale Perspective for Covalent Inhibitor Reactivity Prediction
arXiv (Cornell University)·2024Open Access
Shallower CNOT Circuits on Realistic Quantum Hardware
ACM Transactions on Quantum Computing·2024· 1 citedOpen Access
Quantum-centric supercomputing for materials science: A perspective on challenges and future directions
Future Generation Computer Systems·2024· 66 citedOpen Access
Quantum computing with Qiskit
arXiv (Cornell University)·2024· 166 citedOpen Access
Chemistry Beyond the Scale of Exact Diagonalization on a Quantum-Centric Supercomputer
arXiv (Cornell University)·2024· 24 citedOpen Access
Tight Lieb–Robinson Bound for approximation ratio in quantum annealing
npj Quantum Information·2024· 4 citedOpen Access
Faster and shorter synthesis of Hamiltonian simulation circuits
arXiv (Cornell University)·2024· 3 citedOpen Access
Avoided level crossings with exponentially closing gaps in quantum annealing
Physical review. A/Physical review, A·2024· 1 cited
Optimal Hadamard Gate Count for Clifford+ <i>T</i> Synthesis of Pauli Rotations Sequences
ACM Transactions on Quantum Computing·2023· 9 citedOpen Access
Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
arXiv (Cornell University)·2023· 4 citedOpen Access
Tight Lieb-Robinson Bound for approximation ratio in Quantum Annealing
arXiv (Cornell University)·2023Open Access
Speeding up quantum circuits simulation using ZX-Calculus
arXiv (Cornell University)·2023· 3 citedOpen Access
Anti-crossings occurrence as exponentially closing gaps in Quantum Annealing
arXiv (Cornell University)·2023Open Access
Shallower CNOT circuits on realistic quantum hardware
arXiv (Cornell University)·2023Open Access
Optimal Hadamard gate count for Clifford$+T$ synthesis of Pauli rotations sequences
arXiv (Cornell University)·2023Open Access
page 1 of 3Next →

Frequent Co-authors

Timothée Goubault de Brugière(13), Pablo Arrighi(9), Ali Javadi-Abhari(7), Arthur Braida(7), Ioan Todinca(6), Petar Jurcevic(4), William Kirby(4), Antonio Mezzacapo(4), Mário Motta(4), Marc Baboulin(4), Benoît Valiron(4), Cyril Allouche(4), Vivien Vandaele(4), Simon Perdrix(4), Christophe Vuillot(4), Maika Takita(3), Vincent Nesme(3), Benjamin S. Hanson(3), Vladimir Pavlović(3), Alex Bullivant(3)