35 citations · 63 across the 6 of their papers we have counts for
9 papers · 1 filter
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…
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…
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…