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:2003.04500 · npj Quantum Information

Practical verification protocols for analog quantum simulators

Ryan Shaffer, Eli Megidish, Joseph Broz, Wei-Ting Chen, Hartmut Häffner

Published Mar 3, 2021• 22 citations
arXivHTMLPDF

Abstract

Abstract Analog quantum simulation is expected to be a significant application of near-term quantum devices. Verification of these devices without comparison to known simulation results will be an important task as the system size grows beyond the regime that can be simulated classically. We introduce a set of experimentally-motivated verification protocols for analog quantum simulators, discussing their sensitivity to a variety of error sources and their scalability to larger system sizes. We demonstrate these protocols experimentally using a two-qubit trapped-ion analog quantum simulator and numerically using models of up to five qubits.

DOI
10.1038/s41534-021-00380-8

Related papers

Efficiently Verifiable Quantum Advantage on Near-Term Analog Quantum Simulators

Zhenning Liu, Dhruv Devulapalli, Dominik Hangleiter +4 more

Existing schemes for demonstrating quantum computational advantage are subject to various practical restrictions, including the hardness of verification and challenges in experimental implementation. Meanwhile, analog quantum simulators have been realized in many experiments to study novel physics. In this work, we propose a quantum advantage protocol based on verification of an analog quantum simulation, in which the verifier need only run an O ( λ 2 ) -time classical computation, and the prover need only prepare O ( 1 ) samples of a history state and perform O ( λ 2 ) single-qubit measurements, for a security parameter λ . We also propose a near-term feasible strategy for honest provers and discuss potential experimental realizations.

arXiv:2403.08195•PRX Quantum•Mar 5, 2025•9 citations

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

Stability of digital and analog quantum simulations under noise

Jian Rao, Jens Eisert, Tommaso Guaita

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.

arXiv:2510.08467•Oct 9, 2025•7 citations

Propagation of errors and quantitative quantum simulation with quantum advantage

Stuart Flannigan, Natalie Pearson, Guang Hao Low +5 more

Abstract The rapid development in hardware for quantum computing and simulation has led to much interest in problems where these devices can exceed the capabilities of existing classical computers and known methods. Approaching this for problems that go beyond testing the performance of a quantum device is an important step, and quantum simulation of many-body quench dynamics is one of the most promising candidates for early practical quantum advantage. We analyse the requirements for quantitatively reliable quantum simulation beyond the capabilities of existing classical methods for analogue quantum simulators with neutral atoms in optical lattices and trapped ions. Considering the primary sources of error in analogue devices and how they propagate after a quench in studies of the Hubbard or long-range transverse field Ising model, we identify the level of error expected in quantities we extract from experiments. We conclude for models that are directly implementable that regimes of practical quantum advantage are attained in current experiments with analogue simulators. We also identify the hardware requirements to reach the same level of accuracy with future fault-tolerant digital quantum simulation. Verification techniques are already available to test the assumptions we make here, and demonstrating these in experiments will be an important next step.

arXiv:2204.13644•Quantum Science and Technology•Aug 11, 2022•50 citations

Towards experimental classical verification of quantum computation

Roman Stricker, Jose Carrasco, Martin Ringbauer +8 more

Abstract With today’s quantum processors venturing into regimes beyond the capabilities of classical devices, we face the challenge to verify that these devices perform as intended, even when we cannot check their results on classical computers. In a recent breakthrough in computer science, a protocol was developed that allows the verification of the output of a computation performed by an untrusted quantum device based only on classical resources. Here, we follow these ideas, and demonstrate in a first, proof-of-principle experiment the verification of the output of a quantum computation using only classical means on a small trapped-ion quantum processor. We contrast this to verification protocols, which require trust and detailed hardware knowledge, as in gate-level benchmarking, or additional quantum resources in case we do not have access to or trust in the device to be tested. While our experimental demonstration uses a simplified version of Mahadev’s protocol we demonstrate the necessary steps for verifying fully untrusted devices. A scaled-up version of our protocol will allow for classical verification, requiring no hardware access or detailed knowledge of the tested device. Its security relies on post–quantum secure trapdoor functions within an interactive proof. The conceptually straightforward, but technologically challenging scaled-up version of the interactive proofs, considered here, can be used for a variety of additional tasks such as verifying quantum advantage, generating and certifying quantum randomness, or composable remote state preparation.

arXiv:2203.07395•Quantum Science and Technology•Feb 14, 2024•7 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
Abstract Analog quantum simulation is expected to be a significant application of near-term quantum devices. Verification of these devices without comparison to known simulation results will be an important task as the system size grows beyond the regime that can be simulated classically. We introduce a set of experimentally-motivated verification protocols for analog quantum simulators, discussing their sensitivity to a variety of error sources and their scalability to larger system sizes. We demonstrate these protocols experimentally using a two-qubit trapped-ion analog quantum simulator and numerically using models of up to five qubits.
Existing schemes for demonstrating quantum computational advantage are subject to various practical restrictions, including the hardness of verification and challenges in experimental implementation. Meanwhile, analog quantum simulators have been realized in many experiments to study novel physics. In this work, we propose a quantum advantage protocol based on verification of an analog quantum simulation, in which the verifier need only run an O ( λ 2 ) -time classical computation, and the prover need only prepare O ( 1 ) samples of a history state and perform O ( λ 2 ) single-qubit measurements, for a security parameter λ . We also propose a near-term feasible strategy for honest provers and discuss potential experimental realizations.
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.
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 The rapid development in hardware for quantum computing and simulation has led to much interest in problems where these devices can exceed the capabilities of existing classical computers and known methods. Approaching this for problems that go beyond testing the performance of a quantum device is an important step, and quantum simulation of many-body quench dynamics is one of the most promising candidates for early practical quantum advantage. We analyse the requirements for quantitatively reliable quantum simulation beyond the capabilities of existing classical methods for analogue quantum simulators with neutral atoms in optical lattices and trapped ions. Considering the primary sources of error in analogue devices and how they propagate after a quench in studies of the Hubbard or long-range transverse field Ising model, we identify the level of error expected in quantities we extract from experiments. We conclude for models that are directly implementable that regimes of practical quantum advantage are attained in current experiments with analogue simulators. We also identify the hardware requirements to reach the same level of accuracy with future fault-tolerant digital quantum simulation. Verification techniques are already available to test the assumptions we make here, and demonstrating these in experiments will be an important next step.
Abstract With today’s quantum processors venturing into regimes beyond the capabilities of classical devices, we face the challenge to verify that these devices perform as intended, even when we cannot check their results on classical computers. In a recent breakthrough in computer science, a protocol was developed that allows the verification of the output of a computation performed by an untrusted quantum device based only on classical resources. Here, we follow these ideas, and demonstrate in a first, proof-of-principle experiment the verification of the output of a quantum computation using only classical means on a small trapped-ion quantum processor. We contrast this to verification protocols, which require trust and detailed hardware knowledge, as in gate-level benchmarking, or additional quantum resources in case we do not have access to or trust in the device to be tested. While our experimental demonstration uses a simplified version of Mahadev’s protocol we demonstrate the necessary steps for verifying fully untrusted devices. A scaled-up version of our protocol will allow for classical verification, requiring no hardware access or detailed knowledge of the tested device. Its security relies on post–quantum secure trapdoor functions within an interactive proof. The conceptually straightforward, but technologically challenging scaled-up version of the interactive proofs, considered here, can be used for a variety of additional tasks such as verifying quantum advantage, generating and certifying quantum randomness, or composable remote state preparation.
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.