21 citations · 46 across the 10 of their papers we have counts for
10 papers
The Convergence Frontier: Integrating Machine Learning and High Performance Quantum Computing for Next-Generation Drug Discovery
Narjes Ansari, César Feniou, Nicolaï Gouraud +13
Integrating quantum mechanics into drug discovery marks a decisive shift from empirical trial-and-error toward quantitative precision. However, the prohibitive cost of ab initio mo…
Logarithmic-depth quantum state preparation of polynomials
Baptiste Claudon, Alexis Lucas, Jean-Philip Piquemal +2
Quantum state preparation is a central primitive in many quantum algorithms, yet it is generally resource intensive, with efficient constructions known only for structured families…
Experimental Realization of the Markov Chain Monte Carlo Algorithm on a Quantum Computer
Baptiste Claudon, Sergi Ramos-Calderer, Jean-Philip Piquemal
Quantum algorithms present a quadratically improved complexity over classical ones for certain sampling tasks. For instance, the Quantum Amplitude Estimation (QAE) algorithm promis…
Real-Space Chemistry on Quantum Computers: A Fault-Tolerant Algorithm with Adaptive Grids and Transcorrelated Extension
César Feniou, Christopher Cherfan, Julien Zylberman +3
First-quantized, real-space formulations of quantum chemistry on quantum computers are appealing: qubit count scales logarithmically with spatial resolution, and Coulomb operators…
Quantum Circuits for the Metropolis-Hastings Algorithm
Baptiste Claudon, Pablo Rodenas-Ruiz, Jean-Philip Piquemal +1
Szegedy's quantization of a reversible Markov chain provides a quantum walk whose spectral gap is quadratically larger than that of the classical walk. Quantum computers are theref…
Quantum Speedup for Nonreversible Markov Chains
Baptiste Claudon, Jean-Philip Piquemal, Pierre Monmarché
Quantum algorithms can potentially solve a handful of problems more efficiently than their classical counterparts. In that context, it has been discussed that Markov chains problem…
A simple algorithm to reflect through eigenspaces of unitaries
Baptiste Claudon
Reflections are omnipresent tools in quantum algorithms. We consider the task of reflecting through the eigenspace of an implementable unitary. Such reflections are generally desig…
Polylogarithmic-depth controlled-NOT gates without ancilla qubits
Baptiste Claudon, Julien Zylberman, César Feniou +3
Controlled operations are fundamental building blocks of quantum algorithms. Decomposing -control-NOT gates () into arbitrary single-qubit and CNOT gates, is a crucial b…
Sparse Quantum State Preparation for Strongly Correlated Systems
C. Feniou, O. Adjoua, B. Claudon +3
Quantum Computing allows, in principle, the encoding of the exponentially scaling many-electron wave function onto a linearly scaling qubit register, offering a promising solution…
Greedy Gradient-free Adaptive Variational Quantum Algorithms on a Noisy Intermediate Scale Quantum Computer
César Feniou, Muhammad Hassan, Baptiste Claudon +4
Hybrid quantum-classical adaptive Variational Quantum Eigensolvers (VQE) hold the potential to outperform classical computing for simulating many-body quantum systems. However, pra…