arXiv subjects

François-Marie Le Régent

Publications and source records attributed to François-Marie Le Régent.

8 recordsLinked to original sources

arXiv2026

Benchmarking a machine-learning differential equations solver on a neutral-atom logical processor

We report on a performance comparison between physical and logical computations on a prototypical machine-learning application: solving differential equations using quantum kernel methods. The algorithm is implemented on an atom-based logical quantum processor, both at the physical and logical levels. We show that the kernel estimated from the logical implementation performs better than its physical counterpart on relevant metrics. We observe how such performance improvement can be traced back to specific noise-induced errors detected by the chosen encoding. We apply the computed quantum kernel to the task of solving differential equations, confirming how the superior performance of a logical quantum kernel is retained also at an end-to-end applicative level. Our findings show that experimental validation of end-to-end protocols can already highlight the positive impact of fault-tolerant implementations despite their higher quantum resource count, and guide application-informed architectural choices.

quant-ph↗

arXiv2026

Quantum Maxwell Erasure Decoder for qLDPC codes

We introduce a quantum Maxwell erasure decoder for CSS quantum low-density parity-check (qLDPC) codes that extends peeling with bounded guessing. Guesses are tracked symbolically and can be eliminated by restrictive checks, giving a tunable tradeoff between complexity and performance via a guessing budget: an unconstrained budget recovers Maximum-Likelihood (ML) performance, while a constant budget yields linear-time decoding and approximates ML. We provide theoretical guarantees on asymptotic performance and demonstrate strong performance on bivariate bicycle and quantum Tanner codes.

quant-ph↗

arXiv2025

Awesome Quantum Computing Experiments: Benchmarking Experimental Progress Towards Fault-Tolerant Quantum Computation

Achieving fault-tolerant quantum computation (FTQC) demands simultaneous progress in physical qubit performance and quantum error correction (QEC). This work reviews and benchmarks experimental advancements towards FTQC across leading platforms, including trapped ions, superconducting circuits, neutral atoms, NV centers, and semiconductors. We analyze key physical metrics like coherence times, entanglement error, and system size (qubit count), fitting observed exponential trends to characterize multi-order-of-magnitude improvements over the past two decades. At the logical level, we survey the implementation landscape of QEC codes, tracking realized parameters $[[n, k, d]]$ and complexity from early demonstrations to recent surface and color code experiments. Synthesizing these physical and logical benchmarks reveals substantial progress enabled by underlying hardware improvements, while also outlining persistent challenges towards scalable FTQC. The experimental databases and analysis code underpinning this review are publicly available at https://github.com/francois-marie/awesome-quantum-computing-experiments.

quant-ph↗

arXiv2023

Adiabatic elimination for composite open quantum systems: reduced model formulation and numerical simulations

A numerical method is proposed for simulation of composite open quantum systems. It is based on Lindblad master equations and adiabatic elimination. Each subsystem is assumed to converge exponentially towards a stationary subspace, slightly impacted by some decoherence channels and weakly coupled to the other subsystems. This numerical method is based on a perturbation analysis with an asymptotic expansion. It exploits the formulation of the slow dynamics with reduced dimension. It relies on the invariant operators of the local and nominal dissipative dynamics attached to each subsystem. Second-order expansion can be computed only with local numerical calculations. It avoids computations on the tensor-product Hilbert space attached to the full system. This numerical method is particularly well suited for autonomous quantum error correction schemes. Simulations of such reduced models agree with complete full model simulations for typical gates acting on one and two cat-qubits (Z, ZZ and CNOT) when the mean photon number of each cat-qubit is less than 8. For larger mean photon numbers and gates with three cat-qubits (ZZZ and CCNOT), full model simulations are almost impossible whereas reduced model simulations remain accessible. In particular, they capture both the dominant phase-flip error-rate and the very small bit-flip error-rate with its exponential suppression versus the mean photon number.

quant-ph↗

arXiv2023

Heisenberg formulation of adiabatic elimination for open quantum systems with two time-scales

Consider an open quantum system governed by a Gorini, Kossakowski, Sudarshan, Lindblad (GKSL) master equation with two times-scales: a fast one, exponentially converging towards a linear subspace of quasi-equilibria; a slow one resulting from perturbations (small arbitrary decoherence and Hamiltonian dynamics). Usually adiabatic elimination is performed in the Schrödinger picture. We propose here an Heisenberg formulation where the invariant operators attached to the fast decay dynamics towards the quasi-equilibria subspace play a key role. Based on geometric singular perturbations, asympotic expansions of the Heisenberg slow dynamics and of the fast invariant linear subspaces are proposed. They exploit Carr's approximation lemma from center-manifold and bifurcation theory. Second-order expansions are detailed and shown to ensure preservation, up to second-order terms, of the trace and complete positivity for the slow dynamics on a slow time-scale. Such expansions can be exploited numerically.

quant-ph↗

arXiv2021

Tracking the Footprints of Spin Fluctuations: A MultiMethod, MultiMessenger Study of the Two-Dimensional Hubbard Model

The Hubbard model represents the fundamental model for interacting quantum systems and electronic correlations. Using the two-dimensional half-filled Hubbard model at weak coupling as a testing ground, we perform a comparative study of a comprehensive set of state of the art quantum many-body methods. Upon cooling into its insulating antiferromagnetic ground-state, the model hosts a rich sequence of distinct physical regimes with crossovers between a high-temperature incoherent regime, an intermediate temperature metallic regime and a low-temperature insulating regime with a pseudogap created by antiferromagnetic fluctuations. We assess the ability of each method to properly address these physical regimes and crossovers through the computation of several observables probing both quasiparticle properties and magnetic correlations, with two numerically exact methods (diagrammatic and determinantal quantum Monte Carlo) serving as a benchmark. By combining computational results and analytical insights, we elucidate the nature and role of spin fluctuations in each of these regimes. Based on this analysis, we explain how quasiparticles can coexist with increasingly long-range antiferromagnetic correlations, and why dynamical mean-field theory is found to provide a remarkably accurate approximation of local quantities in the metallic regime. We also critically discuss whether imaginary time methods are able to capture the non-Fermi liquid singularities of this fully nested system.

cond-mat.str-el↗

arXiv2021

Quantum Divide and Compute: Exploring The Effect of Different Noise Sources

Our recent work (Ayral et al., 2020 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)) showed the first implementation of the Quantum Divide and Compute (QDC) method, which allows to break quantum circuits into smaller fragments with fewer qubits and shallower depth. QDC can thus deal with the limited number of qubits and short coherence times of noisy, intermediate-scale quantum processors. This article investigates the impact of different noise sources -- readout error, gate error and decoherence -- on the success probability of the QDC procedure. We perform detailed noise modeling on the Atos Quantum Learning Machine, allowing us to understand tradeoffs and formulate recommendations about which hardware noise sources should be preferentially optimized. We describe in detail the noise models we used to reproduce experimental runs on IBM's Johannesburg processor. This work also includes a detailed derivation of the equations used in the QDC procedure to compute the output distribution of the original quantum circuit from the output distribution of its fragments. Finally, we analyze the computational complexity of the QDC method for the circuit under study via tensor-network considerations, and elaborate on the relation the QDC method with tensor-network simulation methods.

quant-ph↗

arXiv2020

Quantum Divide and Compute: Hardware Demonstrations and Noisy Simulations

Noisy, intermediate-scale quantum computers come with intrinsic limitations in terms of the number of qubits (circuit "width") and decoherence time (circuit "depth") they can have. Here, for the first time, we demonstrate a recently introduced method that breaks a circuit into smaller subcircuits or fragments, and thus makes it possible to run circuits that are either too wide or too deep for a given quantum processor. We investigate the behavior of the method on one of IBM's 20-qubit superconducting quantum processors with various numbers of qubits and fragments. We build noise models that capture decoherence, readout error, and gate imperfections for this particular processor. We then carry out noisy simulations of the method in order to account for the observed experimental results. We find an agreement within 20% between the experimental and the simulated success probabilities, and we observe that recombining noisy fragments yields overall results that can outperform the results without fragmentation.

quant-ph↗