202 citations · 613 across the 35 of their papers we have counts for
36 papers
Spacetime mitigation of logical errors
Laurin E. Fischer, Ali Javadi-Abhari, Simon Martiel +1
Error detection can suppress noise at a lower sampling cost than probabilistic error cancellation (PEC), but leaves residual logical errors. We combine the two approaches to mitiga…
Sampling hard circuits with verifiably high fidelity
Simon Martiel, Jay-U Chung, Alireza Seif +9
Sampling-based proposals are prominent candidates for demonstrating quantum computations beyond the reach of classical supercomputers. However, it has been difficult to combine the…
Entanglement from Expansion: High Rank-Width in Deterministic Graphs
Tristan Cam, Cyril Gavoille, Yvan Le Borgne +1
Entanglement in quantum graph states is intrinsically linked to rank-width, a graph complexity measure introduced by Oum and Seymour. In this work, we enable the preparation of max…
Graphical and algebraic methods for Boolean factoring
Simon Martiel, Priyanka Mukhopadhyay
The problem of factoring Boolean polynomials has significant applications in both classical and quantum computing technology. In this paper we have developed novel algorithms for f…
Observation of Improved Accuracy over Classical Sparse Ground-State Solvers using a Quantum Computer
William Kirby, Bibek Pokharel, Javier Robledo Moreno +25
Demonstrating quantum advantage over classical algorithms for ground state energy problems is an outstanding open problem in quantum computation. We experimentally demonstrate that…
Big cats: entanglement in 120 qubits and beyond
Ali Javadi-Abhari, Simon Martiel, Alireza Seif +2
Entanglement is the quintessential quantum phenomenon and a key enabler of quantum algorithms. The ability to faithfully entangle many distinct particles is often used as a benchma…
Low-overhead error detection with spacetime codes
Simon Martiel, Ali Javadi-Abhari
We introduce a low-overhead approach for detecting errors in arbitrary Clifford circuits on arbitrary qubit connectivities. Our method is based on the framework of spacetime codes,…
Pauli Network Circuit Synthesis with Reinforcement Learning
Ayushi Dubal, David Kremer, Simon Martiel +3
We introduce a Reinforcement Learning (RL)-based method for re-synthesis of quantum circuits containing arbitrary Pauli rotations alongside Clifford operations. By collapsing each…
Circuit Depth Reduction for Executable Hamiltonian Dynamics of Covalent Inhibitor Reactivity on Quantum Hardware
Marek Kowalik, Sam Genway, Vedangi Pathak +8
Quantum chemistry applications in the noisy intermediate-scale quantum era require end-to-end approaches that balance algorithmic fidelity with practical executability on existing…
Quantum computing with Qiskit
Ali Javadi-Abhari, Matthew Treinish, Kevin Krsulich +9
We describe Qiskit, a software development kit for quantum information science. We discuss the key design decisions that have shaped its development, and examine the software archi…
Chemistry Beyond the Scale of Exact Diagonalization on a Quantum-Centric Supercomputer
Javier Robledo-Moreno, Mario Motta, Holger Haas +14
A universal quantum computer can simulate diverse quantum systems, with electronic structure for chemistry offering challenging problems for practical use cases around the hundred-…
Faster and shorter synthesis of Hamiltonian simulation circuits
Timothée Goubault de Brugière, Simon Martiel
We devise greedy heuristics tailored for synthesizing quantum circuits that implement a specified set of Pauli rotations. Our heuristics are designed to minimize either the count o…
Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
Yuri Alexeev, Maximilian Amsler, Paul Baity +124
Computational models are an essential tool for the design, characterization, and discovery of novel materials. Hard computational tasks in materials science stretch the limits of e…
Tight Lieb-Robinson Bound for approximation ratio in Quantum Annealing
Arthur Braida, Simon Martiel, Ioan Todinca
Quantum annealing (QA) holds promise for optimization problems in quantum computing, especially for combinatorial optimization. This analog framework attracts attention for its pot…
Speeding up quantum circuits simulation using ZX-Calculus
Tristan Cam, Simon Martiel
We present a simple and efficient way to reduce the contraction cost of a tensor network to simulate a quantum circuit. We start by interpreting the circuit as a ZX-diagram. We the…
Anti-crossings occurrence as exponentially closing gaps in Quantum Annealing
Arthur Braida, Simon Martiel, Ioan Todinca
This paper explores the phenomenon of avoided level crossings in quantum annealing, a promising framework for quantum computing that may provide a quantum advantage for certain tas…
Shallower CNOT circuits on realistic quantum hardware
Timothée Goubault de Brugière, Simon Martiel
We focus on the depth optimization of CNOT circuits on hardwares with limited connectivity. We adapt the algorithm from Kutin et al. that implements any -qubit CNOT circuit in d…
Optimal Hadamard gate count for Clifford synthesis of Pauli rotations sequences
Vivien Vandaele, Simon Martiel, Simon Perdrix +1
The Clifford gate set is commonly used to perform universal quantum computation. In such setup the gate is typically much more expensive to implement in a fault-tolerant wa…
A graph-state based synthesis framework for Clifford isometries
Timothée Goubault de Brugière, Simon Martiel, Christophe Vuillot
We tackle the problem of Clifford isometry compilation, i.e, how to synthesize a Clifford isometry into an executable quantum circuit. We propose a simple framework for synthesis t…
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…
Phase polynomials synthesis algorithms for NISQ architectures and beyond
Vivien Vandaele, Simon Martiel, Timothée Goubault de Brugière
We present a framework for the synthesis of phase polynomials that addresses both cases of full connectivity and partial connectivity for NISQ architectures. In most cases, our alg…