Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2510.08467

Stability of digital and analog quantum simulations under noise

Jian Rao, Jens Eisert, Tommaso Guaita

Published Oct 9, 2025• 0 citations
arXivHTMLPDF

Abstract

Quantum simulation is a central application of near-term quantum devices, pursued in both analog and digital architectures. A key challenge for both paradigms is the effect of imperfections and noise on predictive power. In this work, we present a rigorous and physically transparent comparison of the stability of digital and analog quantum simulators under a variety of perturbative noise models. We provide rigorous worst- and average-case error bounds for noisy quantum simulation of local observables. We find that the two paradigms show comparable scaling in the worst case, while exhibiting different forms of enhanced error cancellation on average. We further analyze Gaussian and Brownian noise processes, deriving concentration bounds that capture typical deviations beyond worst-case guarantees. These results provide a unified framework for quantifying the robustness of noisy quantum simulations and identify regimes where digital methods have intrinsic advantages and when we can see similar behavior.

DOI
10.48550/arxiv.2510.08467

Related papers

Stability of digital and analog quantum simulations under noise

Jens Eisert, Jayant Rao, Tommaso Guaita

Abstract Quantum simulation is a central application of near-term quantum devices, pursued in both analog and digital architectures. A key challenge for both paradigms is the effect of imperfections and noise on predictive power. In this work, we present a rigorous and physically transparent comparison of the stability of digital and analog quantum simulators under a variety of perturbative noise models. We provide rigorous worst- and average-case error bounds for noisy quantum simulation of local observables. We find that the two paradigms show comparable scaling in the worst case, while exhibiting different forms of enhanced error cancellation on average. We further analyze Gaussian and Brownian noise processes, deriving concentration bounds that capture typical deviations beyond worst-case guarantees. These results provide a unified framework for quantifying the robustness of noisy quantum simulations and identify regimes where digital methods have intrinsic advantages and when we can see similar behavior.

•Jun 22, 2026•0 citations

Stochastic Error Cancellation in Analog Quantum Simulation

Yiyi Cai, Yu Tong, John P. Preskill

Analog quantum simulation is a promising path towards solving classically intractable problems in many-body physics on near-term quantum devices. However, the presence of noise limits the size of the system and the length of time that can be simulated. In our work, we consider an error model in which the actual Hamiltonian of the simulator differs from the target Hamiltonian we want to simulate by small local perturbations, which are assumed to be random and unbiased. We analyze the error accumulated in observables in this setting and show that, due to stochastic error cancellation, with high probability the error scales as the square root of the number of qubits instead of linearly. We explore the concentration phenomenon of this error as well as its implications for local observables in the thermodynamic limit. Moreover, we show that stochastic error cancellation also manifests in the fidelity between the target state at the end of time-evolution and the actual state we obtain in the presence of noise. This indicates that, to reach a certain fidelity, more noise can be tolerated than implied by the worst-case bound if the noise comes from many statistically independent sources.

arXiv:2311.14818•Leibniz international proceedings in informatics•Nov 24, 2023•1 citation

Noise in digital and digital-analog quantum computation

Paula García-Molina, Ana Martin, Mikel Garcia de Andoin +1 more

Abstract Quantum computing uses quantum resources provided by the underlying quantum nature of matter to enhance classical computation. However, the current Noisy Intermediate-Scale Quantum (NISQ) era in quantum computing is characterized by the use of quantum processors comprising from a few tens to, at most, a few hundreds of physical qubits without implementing quantum error correction techniques. This limits the scalability in the implementation of quantum algorithms. Digital-analog quantum computing (DAQC) has been proposed as a more resilient alternative quantum computing paradigm to outperform digital quantum computation within the NISQ era framework. It arises from adding the flexibility provided by fast single-qubit gates to the robustness of analog quantum simulations. Here, we perform a careful comparison between the digital and digital-analog paradigms under the presence of noise sources. The comparison is illustrated by comparing the performance of the quantum Fourier transform and quantum phase estimation algorithms under a wide range of single- and two-qubit noise sources. Indeed, we obtain that when the different noise channels usually present in superconducting quantum processors are considered, the fidelity of these algorithms for the digital-analog paradigm outperforms the one obtained for the digital approach. Additionally, this difference grows when the size of the processor scales up, making DAQC a sensible alternative paradigm in the NISQ era. Finally, we show how to adaptthe DAQC paradigm to quantum error mitigation techniques for canceling different noise sources, including the bang error.

•Jul 4, 2023•4 citations

Quantifying the Sensitivity to Errors in Analog Quantum Simulation

Pablo M. Poggi, Nathan Lysne, Kevin W. Kuper +2 more

Quantum simulators are widely seen as one of the most promising near-term applications of quantum technologies.However, it remains unclear to what extent a noisy device can output reliable results in the presence of unavoidable imperfections.Here we propose a framework to characterize the performance of quantum simulators by linking the robustness of measured quantum expectation values to the spectral properties of the output observable, which in turn can be associated with its macroscopic or microscopic character.We show that, under general assumptions and on average over all states, imperfect devices are able to reproduce the dynamics of macroscopic observables accurately, while the relative error in the expectation value of microscopic observables is much larger on average.We experimentally demonstrate the universality of these features in a state-of-the-art quantum simulator and show that the predicted behavior is generic for a highly accurate device, without assuming any detailed knowledge about the nature of the imperfections.

arXiv:2007.01901•PRX Quantum•Nov 2, 2020•24 citations

Sensitivity to Imperfections of Analog Quantum Simulation on Atomic Qudits

Nathan Lysne

As uncorrected quantum processors grow in sophistication, many are being used for analog quantum simulation (AQS) of novel physics beyond the capabilities of classical devices. However, without the guarantee of bounded errors achieved by digitizing the computation, we do not know when and how much to trust an AQS result in the presence of inevitable imperfections. Here, we present the results of using our exper- iment as a testbed for studying the impact of errors on AQS. We have developed a small but highly-accurate processor over a 16-dimensional Hilbert space comprising the combined electron-nuclear spin of a single 133Cs atom in the electronic ground state. Advances in Eigenvalue-Only (EVO) optimal control enable us to repeatedly (>100) perform arbitrary unitary transformations in this space while maintaining accuracy on the device. We use this capability to simulate model systems known to exhibit features of interest, such as chaos and hypersensitivity (quantum kicked top) and quantum phase transitions (the transverse Ising and Lipkin-Meshkov-Glick mod- els). Experimental simulations show high fidelity of the quantum state and dynamical features in the presence of native imperfections. We discuss these results in the con- text of a new framework for quantifying the average sensitivity of simulator outcomes to errors. These theoretical and experimental results support the idea that AQS of ‘macroscopic’ observables (e.g., total magnetization) can be robust in the presence of errors, while observables tied to a specific quantum state (e.g., the fidelity) are not.

•Jan 1, 2020•0 citations

Bounded-Error Quantum Simulation via Hamiltonian and Lindbladian Learning

Tristan Kraft, Manoj K. Joshi, William Lam +11 more

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-pharXiv:2511.23392•Physical Review X•Dec 1, 2025•0 citations
Quantum simulation is a central application of near-term quantum devices, pursued in both analog and digital architectures. A key challenge for both paradigms is the effect of imperfections and noise on predictive power. In this work, we present a rigorous and physically transparent comparison of the stability of digital and analog quantum simulators under a variety of perturbative noise models. We provide rigorous worst- and average-case error bounds for noisy quantum simulation of local observables. We find that the two paradigms show comparable scaling in the worst case, while exhibiting different forms of enhanced error cancellation on average. We further analyze Gaussian and Brownian noise processes, deriving concentration bounds that capture typical deviations beyond worst-case guarantees. These results provide a unified framework for quantifying the robustness of noisy quantum simulations and identify regimes where digital methods have intrinsic advantages and when we can see similar behavior.
Abstract Quantum simulation is a central application of near-term quantum devices, pursued in both analog and digital architectures. A key challenge for both paradigms is the effect of imperfections and noise on predictive power. In this work, we present a rigorous and physically transparent comparison of the stability of digital and analog quantum simulators under a variety of perturbative noise models. We provide rigorous worst- and average-case error bounds for noisy quantum simulation of local observables. We find that the two paradigms show comparable scaling in the worst case, while exhibiting different forms of enhanced error cancellation on average. We further analyze Gaussian and Brownian noise processes, deriving concentration bounds that capture typical deviations beyond worst-case guarantees. These results provide a unified framework for quantifying the robustness of noisy quantum simulations and identify regimes where digital methods have intrinsic advantages and when we can see similar behavior.
Analog quantum simulation is a promising path towards solving classically intractable problems in many-body physics on near-term quantum devices. However, the presence of noise limits the size of the system and the length of time that can be simulated. In our work, we consider an error model in which the actual Hamiltonian of the simulator differs from the target Hamiltonian we want to simulate by small local perturbations, which are assumed to be random and unbiased. We analyze the error accumulated in observables in this setting and show that, due to stochastic error cancellation, with high probability the error scales as the square root of the number of qubits instead of linearly. We explore the concentration phenomenon of this error as well as its implications for local observables in the thermodynamic limit. Moreover, we show that stochastic error cancellation also manifests in the fidelity between the target state at the end of time-evolution and the actual state we obtain in the presence of noise. This indicates that, to reach a certain fidelity, more noise can be tolerated than implied by the worst-case bound if the noise comes from many statistically independent sources.
Abstract Quantum computing uses quantum resources provided by the underlying quantum nature of matter to enhance classical computation. However, the current Noisy Intermediate-Scale Quantum (NISQ) era in quantum computing is characterized by the use of quantum processors comprising from a few tens to, at most, a few hundreds of physical qubits without implementing quantum error correction techniques. This limits the scalability in the implementation of quantum algorithms. Digital-analog quantum computing (DAQC) has been proposed as a more resilient alternative quantum computing paradigm to outperform digital quantum computation within the NISQ era framework. It arises from adding the flexibility provided by fast single-qubit gates to the robustness of analog quantum simulations. Here, we perform a careful comparison between the digital and digital-analog paradigms under the presence of noise sources. The comparison is illustrated by comparing the performance of the quantum Fourier transform and quantum phase estimation algorithms under a wide range of single- and two-qubit noise sources. Indeed, we obtain that when the different noise channels usually present in superconducting quantum processors are considered, the fidelity of these algorithms for the digital-analog paradigm outperforms the one obtained for the digital approach. Additionally, this difference grows when the size of the processor scales up, making DAQC a sensible alternative paradigm in the NISQ era. Finally, we show how to adaptthe DAQC paradigm to quantum error mitigation techniques for canceling different noise sources, including the bang error.
Quantum simulators are widely seen as one of the most promising near-term applications of quantum technologies.However, it remains unclear to what extent a noisy device can output reliable results in the presence of unavoidable imperfections.Here we propose a framework to characterize the performance of quantum simulators by linking the robustness of measured quantum expectation values to the spectral properties of the output observable, which in turn can be associated with its macroscopic or microscopic character.We show that, under general assumptions and on average over all states, imperfect devices are able to reproduce the dynamics of macroscopic observables accurately, while the relative error in the expectation value of microscopic observables is much larger on average.We experimentally demonstrate the universality of these features in a state-of-the-art quantum simulator and show that the predicted behavior is generic for a highly accurate device, without assuming any detailed knowledge about the nature of the imperfections.
As uncorrected quantum processors grow in sophistication, many are being used for analog quantum simulation (AQS) of novel physics beyond the capabilities of classical devices. However, without the guarantee of bounded errors achieved by digitizing the computation, we do not know when and how much to trust an AQS result in the presence of inevitable imperfections. Here, we present the results of using our exper- iment as a testbed for studying the impact of errors on AQS. We have developed a small but highly-accurate processor over a 16-dimensional Hilbert space comprising the combined electron-nuclear spin of a single 133Cs atom in the electronic ground state. Advances in Eigenvalue-Only (EVO) optimal control enable us to repeatedly (>100) perform arbitrary unitary transformations in this space while maintaining accuracy on the device. We use this capability to simulate model systems known to exhibit features of interest, such as chaos and hypersensitivity (quantum kicked top) and quantum phase transitions (the transverse Ising and Lipkin-Meshkov-Glick mod- els). Experimental simulations show high fidelity of the quantum state and dynamical features in the presence of native imperfections. We discuss these results in the con- text of a new framework for quantifying the average sensitivity of simulator outcomes to errors. These theoretical and experimental results support the idea that AQS of ‘macroscopic’ observables (e.g., total magnetization) can be robust in the presence of errors, while observables tied to a specific quantum state (e.g., the fidelity) are not.
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.