arXiv subjects

Benoît Vermersch

Publications and source records attributed to Benoît Vermersch.

At least 19 recordsLinked to original sources

arXiv2026

Analytically Continuing the Randomized Measurement Toolbox

We develop a framework for extracting non-polynomial analytic functions of density matrices in randomized measurement experiments by a method of analytical continuation. A central advantage of this approach, dubbed stabilized analytic continuation (SAC), is its robustness to statistical noise arising from finite repetitions of a quantum experiment, making it well-suited to realistic quantum hardware. As a demonstration, we use SAC to estimate the von Neumann entanglement entropy of a numerically simulated quenched Néel state from Rényi entropies estimated via the randomized measurement protocol. We then apply the method to experimental Rényi data from a trapped-ion quantum simulator experiment, extracting subsystem von Neumann entropies at different evolution times. Finally, we briefly note that the SAC framework is readily generalizable to obtain other nonlinear diagnostics, such as the logarithmic negativity and Rényi relative entropies.

quant-ph↗

arXiv2026

Bounded-Error Quantum Simulation via Hamiltonian and Lindbladian Learning

Analog Quantum Simulators offer a route to exploring strongly correlated many-body dynamics beyond classical computation, but their predictive power remains limited by the absence of quantitative error estimation. Establishing rigorous uncertainty bounds is essential for elevating such devices from qualitative demonstrations to quantitative scientific tools. Here we introduce a general framework for bounded-error quantum simulation, which provides predictions for many-body observables with experimentally quantifiable uncertainties. The approach combines Hamiltonian and Lindbladian Learning--a statistically rigorous inference of the coherent and dissipative generators governing the dynamics--with the propagation of their uncertainties into the simulated observables, yielding confidence bounds directly derived from experimental data. We demonstrate this framework on trapped-ion quantum simulators implementing long-range Ising interactions with up to 51 ions, and validate it where classical comparison is possible. We analyze error bounds on two levels. First, we learn an open-system model from experimental data collected in an initial time window of quench dynamics, simulate the corresponding master equation, and quantitatively verify consistency between theoretical predictions and measured dynamics at long times. Second, we establish error bounds directly from experimental measurements alone, without relying on classical simulation--crucial for entering regimes of quantum advantage. The learned models reproduce the experimental evolution within the predicted bounds, demonstrating quantitative reliability and internal consistency. Bounded-error quantum simulation provides a scalable foundation for trusted analog quantum computation, bridging the gap between experimental platforms and predictive many-body physics. The techniques presented here directly extend to digital quantum simulation.

quant-ph↗

arXiv2026

Pairwise Liouvillian learning from randomized measurements: practical aspects and guidelines for operating the protocol in large-scale experiments

We review and numerically study a protocol for Liouvillian learning based on randomized Pauli states and measurements. In particular, in the two-body, long-range interactions, and single-body noise setting, we describe the complete workflow to obtain the coefficients of the Liouvillian in an efficient and pairwise manner, meaning that the required classical memory is independent of the system size. We also provide guidelines for choosing the parameters for data acquisition and postprocessing that minimize the total reconstruction error.

quant-ph↗

arXiv2026

RandomMeas.jl: A Julia Package for Randomized Measurements in Quantum Devices

We introduce $\texttt{RandomMeas$.$jl}$, a modular and high-performance open-source software package written in Julia for implementing and analyzing randomized measurement protocols in quantum computing. Randomized measurements provide a powerful framework for extracting properties of quantum states and processes such as expectation values, entanglement, and fidelities using simple experimental procedures combined with classical post-processing, most prominently via the classical shadow formalism. $\texttt{RandomMeas$.$jl}$ covers the full randomized measurement workflow, from the generation of measurement settings for use on a quantum computer, the optional classical simulation of randomized measurements with tensor networks, to a suite of estimators for physical properties based on classical shadows. The package includes advanced features such as robust and shallow shadow techniques, batch estimators, and built-in statistical uncertainty estimation. Its unified, composable design enables the scalable application and further development of randomized measurements protocols across theoretical and experimental contexts.

quant-ph↗

arXiv2026

The SpinPulse library for transpilation and noise-accurate simulation of spin qubit quantum computers

We introduce SpinPulse, an open-source python package for simulating spin qubit-based quantum computers at the pulse-level. SpinPulse models the specific physics of spin qubits, particularly through the inclusion of classical non-Markovian noise. This enables realistic simulations of native gates and quantum circuits, in order to support hardware development. In SpinPulse, a quantum circuit is first transpiled into the native gate set of our model and then converted to a pulse sequence. This pulse sequence is subsequently integrated numerically in the presence of a simulated noisy experimental environment. We showcase workflows including transpilation, pulse-level compilation, hardware benchmarking, quantum error mitigation, and large-scale simulations via integration with the tensor-network library quimb. We expect SpinPulse to be a valuable open-source tool for the quantum computing community, fostering efforts to devise high-fidelity quantum circuits and improved strategies for quantum error mitigation and correction.

quant-ph↗

arXiv2025

Learning mixed quantum states in large-scale experiments

We present and test a protocol to learn the matrix-product operator (MPO) representation of an experimentally prepared quantum state. The protocol takes as an input classical shadows corresponding to local randomized measurements, and outputs the tensors of a MPO which maximizes a suitably-defined fidelity with the experimental state. The tensor optimization is carried out sequentially, similarly to the well-known density matrix renormalization group algorithm. Our approach is provably efficient under certain technical conditions which are expected to be met in short-range correlated states and in typical noisy experimental settings. Under the same conditions, we also provide an efficient scheme to estimate fidelities between the learned and the experimental states. We experimentally demonstrate our protocol by learning entangled quantum states of up to $N = 96$ qubits in a superconducting quantum processor. Our method upgrades classical shadows to large-scale quantum computation and simulation experiments.

quant-ph↗

arXiv2025

Simulated non-Markovian Noise Resilience of Silicon-Based Spin Qubits with Surface Code Error Correction

We investigate the resilience of silicon-based spin qubits against non-Markovian noise within the framework of quantum error correction. We consider a realistic non-Markovian noise model that affects both the Larmor frequency and exchange energy of qubits, allowing accurate simulations of noisy quantum circuits. We employ numerical emulation to assess the performance of the distance-3 rotated surface code and its XZZX variant, using a logical qubit coherence time metric based on Ramsey-like experiments. Our numerical results suggest that quantum error correction converts non-Markovian physical noise into Markovian logical noise, resulting in a quartic dependence of coherence time between physical and logical qubits. Additionally, we analyze the effects of spatial noise correlations and sparse architectures, substantiating the robustness of quantum error correction in silicon-based spin qubit systems.

quant-ph↗

arXiv2024

Universal quantum processors in spin systems via robust local pulse sequences

We propose a protocol to realize quantum simulation and computation in spin systems with long-range interactions. Our approach relies on the local addressing of single spins with external fields parametrized by Walsh functions. This enables a mapping from a class of target Hamiltonians, defined by the graph structure of their interactions, to pulse sequences. We then obtain a recipe to implement arbitrary two-body Hamiltonians and universal quantum circuits. Performance guarantees are provided in terms of bounds on Trotter errors and total number of pulses. Additionally, Walsh pulse sequences are shown to be robust against various types of pulse errors, in contrast to previous hybrid digital-analog schemes of quantum computation. We demonstrate and numerically benchmark our protocol with examples from the dynamics of spin models, quantum error correction and quantum optimization algorithms.

quant-ph↗

arXiv2024

Observing the quantum Mpemba effect in quantum simulations

The non-equilibrium physics of many-body quantum systems harbors various unconventional phenomena. In this study, we experimentally investigate one of the most puzzling of these phenomena -- the quantum Mpemba effect, where a tilted ferromagnet restores its symmetry more rapidly when it is farther from the symmetric state compared to when it is closer. We present the first experimental evidence of the occurrence of this effect in a trapped-ion quantum simulator. The symmetry breaking and restoration are monitored through entanglement asymmetry, probed via randomized measurements, and postprocessed using the classical shadows technique. Our findings are further substantiated by measuring the Frobenius distance between the experimental state and the stationary thermal symmetric theoretical state, offering direct evidence of subsystem thermalization.

quant-ph↗

arXiv2024

Robust estimation of the Quantum Fisher Information on a quantum processor

We present the experimental measurement, on a quantum processor, of a series of polynomial lower bounds that converge to the quantum Fisher information (QFI), a fundamental quantity for certifying multipartite entanglement that is useful for metrological applications. We combine advanced methods of the randomized measurement toolbox to obtain estimators that are robust against drifting errors caused uniquely during the randomized measurement protocol. We estimate the QFI for Greenberg-Horne-Zeilinger states, observing genuine multipartite entanglement. Then, we prepare the ground state of the transverse field Ising model at the critical point using a variational circuit. We estimate its QFI and investigate the interplay between state optimization and noise induced by increasing the circuit depth.

quant-ph↗

arXiv2024

Many-body entropies and entanglement from polynomially-many local measurements

Estimating global properties of many-body quantum systems such as entropy or bipartite entanglement is a notoriously difficult task, typically requiring a number of measurements or classical post-processing resources growing exponentially in the system size. In this work, we address the problem of estimating global entropies and mixed-state entanglement via partial-transposed (PT) moments, and show that efficient estimation strategies exist under the assumption that all the spatial correlation lengths are finite. Focusing on one-dimensional systems, we identify a set of approximate factorization conditions (AFCs) on the system density matrix which allow us to reconstruct entropies and PT moments from information on local subsystems. This yields a simple and efficient strategy for entropy and entanglement estimation. Our method could be implemented in different ways, depending on how information on local subsystems is extracted. Focusing on randomized measurements (RMs), providing a practical and common measurement scheme, we prove that our protocol only requires polynomially-many measurements and post-processing operations, assuming that the state to be measured satisfies the AFCs. We prove that the AFCs hold for finite-depth quantum-circuit states and translation-invariant matrix-product density operators, and provide numerical evidence that they are satisfied in more general, physically-interesting cases, including thermal states of local Hamiltonians. We argue that our method could be practically useful to detect bipartite mixed-state entanglement for large numbers of qubits available in today's quantum platforms.

quant-ph↗

arXiv2023

Enhanced estimation of quantum properties with common randomized measurements

We present a technique for enhancing the estimation of quantum state properties by incorporating approximate prior knowledge about the quantum state of interest. This method involves performing randomized measurements on a quantum processor and comparing the results with those obtained from a classical computer that stores an approximation of the quantum state. We provide unbiased estimators for expectation values of multi-copy observables and present performance guarantees in terms of variance bounds which depend on the prior knowledge accuracy. We demonstrate the effectiveness of our approach through numerical experiments estimating polynomial approximations of the von Neumann entropy and quantum state fidelities.

quant-ph↗

arXiv2023

Fermionic quantum processing with programmable neutral atom arrays

Simulating the properties of many-body fermionic systems is an outstanding computational challenge relevant to material science, quantum chemistry, and particle physics. Although qubit-based quantum computers can potentially tackle this problem more efficiently than classical devices, encoding non-local fermionic statistics introduces an overhead in the required resources, limiting their applicability on near-term architectures. In this work, we present a fermionic quantum processor, where fermionic models are locally encoded in a fermionic register and simulated in a hardware-efficient manner using fermionic gates. We consider in particular fermionic atoms in programmable tweezer arrays and develop different protocols to implement non-local tunneling gates, guaranteeing Fermi statistics at the hardware level. We use this gate set, together with Rydberg-mediated interaction gates, to find efficient circuit decompositions for digital and variational quantum simulation algorithms, illustrated here for molecular energy estimation. Finally, we consider a combined fermion-qubit architecture, where both the motional and internal degrees of freedom of the atoms are harnessed to efficiently implement quantum phase estimation, as well as to simulate lattice gauge theory dynamics.

quant-ph↗

arXiv2022

Entanglement phase diagrams from partial transpose moments

We present experimentally and numerically accessible quantities that can be used to differentiate among various families of random entangled states. To this end, we analyze the entanglement properties of bipartite reduced states of a tripartite pure state. We introduce a ratio of simple polynomials of low-order moments of the partially transposed reduced density matrix and show that this ratio takes well-defined values in the thermodynamic limit for various families of entangled states. This allows to sharply distinguish entanglement phases, in a way that can be understood from a quantum information perspective based on the spectrum of the partially transposed density matrix. We analyze in particular the entanglement phase diagram of Haar random states, states resulting form the evolution of chaotic Hamiltonians, stabilizer states, which are outputs of Clifford circuits, Matrix Product States, and fermionic Gaussian states. We show that for Haar random states the resulting phase diagram resembles the one obtained via the negativity and that for all the cases mentioned above a very distinctive behaviour is observed. Our results can be used to experimentally test necessary conditions for different types of mixed-state randomness, in quantum states formed in quantum computers and programmable quantum simulators.

quant-ph↗

arXiv2022

Entanglement barrier and its symmetry resolution: theory and experiment

The operator entanglement (OE) is a key quantifier of the complexity of a reduced density matrix. In out-of-equilibrium situations, e.g. after a quantum quench of a product state, it is expected to exhibit an entanglement barrier. The OE of a reduced density matrix initially grows linearly as entanglement builds up between the local degrees of freedom, it then reaches a maximum, and ultimately decays to a small finite value as the reduced density matrix converges to a simple stationary state through standard thermalization mechanisms. Here, by performing a new data analysis of the published experimental results of [Brydges et al., Science 364, 260 (2019)], we obtain the first experimental measurement of the OE of a subsystem reduced density matrix in a quantum many-body system. We employ the randomized measurements toolbox and we introduce and develop a new efficient method to post-process experimental data in order to extract higher-order density matrix functionals and access the OE. The OE thus obtained displays the expected barrier as long as the experimental system is large enough. For smaller systems, we observe a barrier with a double-peak structure, whose origin can be interpreted in terms of pairs of quasi-particles being reflected at the boundary of the qubit chain. As $U(1)$ symmetry plays a key role in our analysis, we introduce the notion of symmetry resolved operator entanglement (SROE), in addition to the total OE. To gain further insights into the SROE, we provide a thorough theoretical analysis of this new quantity in chains of non-interacting fermions, which, in spite of their simplicity, capture most of the main features of OE and SROE. In particular, we uncover three main physical effects: the presence of a barrier in any charge sector, a time delay for the onset of the growth of SROE, and an effective equipartition between charge sectors.

quant-ph↗

arXiv2022

Fermionic correlation functions from randomized measurements in programmable atomic quantum devices

We provide a measurement protocol to estimate 2- and 4-point fermionic correlations in ultra-cold atom experiments. Our approach is based on combining random atomic beam splitter operations, which can be realized with programmable optical landscapes, with high-resolution imaging systems such as quantum gas microscopes. We illustrate our results in the context of the variational quantum eigensolver algorithm for solving quantum chemistry problems.

cond-mat.quant-gas↗

arXiv2022

The randomized measurement toolbox

Increasingly sophisticated programmable quantum simulators and quantum computers are opening unprecedented opportunities for exploring and exploiting the properties of highly entangled complex quantum systems. The complexity of large quantum systems is the source of their power, but also makes them difficult to control precisely or characterize accurately using measured classical data. We review recently developed protocols for probing the properties of complex many-qubit systems using measurement schemes that are practical using today's quantum platforms. In all these protocols, a quantum state is repeatedly prepared and measured in a randomly chosen basis; then a classical computer processes the measurement outcomes to estimate the desired property. The randomization of the measurement procedure has distinct advantages; for example, a single data set can be employed multiple times to pursue a variety of applications, and imperfections in the measurements are mapped to a simplified noise model that can more easily be mitigated. We discuss a range of use cases that have already been realized in quantum devices, including Hamiltonian simulation tasks, probes of quantum chaos, measurements of nonlocal order parameters, and comparison of quantum states produced in distantly separated laboratories. By providing a workable method for translating a complex quantum state into a succinct classical representation that preserves a rich variety of relevant physical properties, the randomized measurement toolbox strengthens our ability to grasp and control the quantum world.

quant-ph↗

arXiv2022

Probing many-body quantum chaos with quantum simulators

The spectral form factor (SFF), characterizing statistics of energy eigenvalues, is a key diagnostic of many-body quantum chaos. In addition, partial spectral form factors (PSFFs) can be defined which refer to subsystems of the many-body system. They provide unique insights into energy eigenstate statistics of many-body systems, as we show in an analysis on the basis of random matrix theory and of the eigenstate thermalization hypothesis. We propose a protocol that allows the measurement of the SFF and PSFFs in quantum many-body spin models, within the framework of randomized measurements. Aimed to probe dynamical properties of quantum many-body systems, our scheme employs statistical correlations of local random operations which are applied at different times in a single experiment. Our protocol provides a unified testbed to probe many-body quantum chaotic behavior, thermalization and many-body localization in closed quantum systems which we illustrate with numerical simulations for Hamiltonian and Floquet many-body spin-systems.

quant-ph↗