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:2409.03995 · Advanced Quantum Technologies

Accreditation Against Limited Adversarial Noise

Andrew Jackson

Published Oct 24, 2025• 0 citations
arXivHTMLPDF

Abstract

Abstract An accreditation protocol (a variety of quantum verification) is presented, where error is assumed to be adversarial (in contrast to the assumption error is implemented by identical CPTP maps used in previous accreditation protocols)—albeit slightly modified to reflect physically motivated error assumptions. This is achieved by upgrading a pre‐existing accreditation protocol (from [S. Ferracin et al. Phys. Rev. A 104, 042603 (2021)]) to function correctly in the face of adversarial error, with no diminution in efficiency or suitability for near‐term usage.

DOI
10.1002/qute.202500337

Related papers

Mitigating errors by quantum verification and postselection

Rawad Mezher, James K. Mills, Elham Kashefi

Correcting errors due to noise in quantum circuits run on current and near-term quantum hardware is essential for any convincing demonstration of quantum advantage. Indeed, in many cases it has been shown that noise renders quantum circuits efficiently classically simulable, thereby destroying any quantum advantage potentially offered by an ideal (noiseless) implementation of these circuits. Although the technique of quantum error correction (QEC) allows correcting these errors very accurately, QEC usually requires a large overhead of physical qubits which is not reachable with currently available quantum hardware. This has been the motivation behind the field of quantum error mitigation, which aims at developing techniques to correct an important part of the errors in quantum circuits, while also being compatible with current and near-term quantum hardware. In this work, we present a technique for quantum error mitigation which is based on a technique from quantum verification, the so-called accreditation protocol, together with postselection. Our technique allows for correcting the expectation value of an observable $O$, which is the output of multiple runs of noisy quantum circuits, where the noise in these circuits is at the level of preparations, gates, and measurements. We discuss the sample complexity of our procedure and provide rigorous guarantees of errors being mitigated under some realistic assumptions on the noise. Our technique is tailored to time-dependent behaviors, as we allow for the output states to be different between different runs of the accreditation protocol. We validate our findings by running our technique on currently available quantum hardware.

arXiv:2109.14329•Physical Review A•May 27, 2022•14 citations

Accreditation of analogue quantum simulators

Andrew Jackson, Theodoros Kapourniotis, Animesh Datta

We present an accreditation protocol for analogue, i.e., continuous-time, quantum simulators. For a given simulation task, it provides an upper bound on the variation distance between the probability distributions at the output of an erroneous and error-free analogue quantum simulator. As its overheads are independent of the size and nature of the simulation, the protocol is ready for immediate usage and practical for the long term. It builds on the recent theoretical advances of strongly universal Hamiltonians and quantum accreditation as well as experimental progress toward the realization of programmable hybrid analogue-digital quantum simulators.

arXiv:2306.03060•Proceedings of the National Academy of Sciences•Jan 31, 2024•5 citations

Improved Accreditation of Analogue Quantum Simulation and Establishing Quantum Advantage

Jackson, Andrew, Animesh Datta

We improve on the results of [A. Jackson et al. Proc. Natl. Acad. Sci. U.S.A 121 (6). 2024] on the verification of analogue quantum simulators by eliminating the use of universal Hamiltonians, removing the need for two-qubit gates, and no longer assuming error is represented by identical maps across simulations. This new protocol better reflects the reality of extant analogue simulators. It integrates well with recent complexity theoretic results, leading to a near-term feasible simulation-based route to establishing quantum advantage.

arXiv:2502.06463•Feb 10, 2025•0 citations

Quantum Accreditation with Non-Clifford Two-qubit Gates

Andrew Jackson, Theodoros Kapourniotis, Animesh Datta

We develop a family of quantum accreditation protocols for quantum circuits with non-Clifford two-qubit gates. The latter includes families of gates such as the fSim and XY families of gates, native to existing hardwares. We provide practical and scalable protocols that upper-bound the total variation distance between the probability distributions of error-free and erroneous quantum computations. We also establish the robustness of our protocols to small perturbations and generalize Pauli twirling to non-Pauli single-qubit bases, which may be of independent interest.

quant-pharXiv:2605.19205•May 20, 2026•0 citations

Accrediting outputs of noisy intermediate-scale quantum computing devices

Samuele Ferracin, Theodoros Kapourniotis, Animesh Datta

We present an accreditation protocol for the outputs of noisy intermediate-scale quantum devices. By testing entire circuits rather than individual gates, our accreditation protocol can provide an upper-bound on the variation distance between noisy and noiseless probability distribution of the outputs of the target circuit of interest. Our accreditation protocol requires implementing quantum circuits no larger than the target circuit, therefore it is practical in the near term and scalable in the long term. Inspired by trap-based protocols for the verification of quantum computations, our accreditation protocol assumes that single-qubit gates have bounded probability of error. We allow for arbitrary spatial and temporal correlations in the noise affecting state preparation, measurements, single-qubit and two-qubit gates. We describe how to implement our protocol on real-world devices, and we also present a novel cryptographic protocol (which we call 'mesothetic' protocol) inspired by our accreditation protocol.

arXiv:1811.09709•New Journal of Physics•Oct 21, 2019•37 citations

Gaining confidence on the correct realization of arbitrary quantum computations

José A. Carrasco, Marc Langer, Antoine Neven +1 more

We present verification protocols to gain confidence in the correct performance of a device implementing an arbitrary quantum computation. The derivation of the protocols is based on the fact that matchgate computations, which are classically efficiently simulable, become universal if supplemented with additional resources. We combine tools from weak simulation, randomized compiling, and statistics to derive verification circuits that (i) strongly resemble the original circuit and (ii) can be classically efficiently simulated not only in the ideal, i.e., error free scenario, but also in the realistic situation where errors are present. In fact, in one of the protocols we apply exactly the same circuit as in the original computation, however, to a slightly modified input state. Published by the American Physical Society 2024

Physical Review Research•Sep 30, 2024•2 citations
Abstract An accreditation protocol (a variety of quantum verification) is presented, where error is assumed to be adversarial (in contrast to the assumption error is implemented by identical CPTP maps used in previous accreditation protocols)—albeit slightly modified to reflect physically motivated error assumptions. This is achieved by upgrading a pre‐existing accreditation protocol (from [S. Ferracin et al. Phys. Rev. A 104, 042603 (2021)]) to function correctly in the face of adversarial error, with no diminution in efficiency or suitability for near‐term usage.
Correcting errors due to noise in quantum circuits run on current and near-term quantum hardware is essential for any convincing demonstration of quantum advantage. Indeed, in many cases it has been shown that noise renders quantum circuits efficiently classically simulable, thereby destroying any quantum advantage potentially offered by an ideal (noiseless) implementation of these circuits. Although the technique of quantum error correction (QEC) allows correcting these errors very accurately, QEC usually requires a large overhead of physical qubits which is not reachable with currently available quantum hardware. This has been the motivation behind the field of quantum error mitigation, which aims at developing techniques to correct an important part of the errors in quantum circuits, while also being compatible with current and near-term quantum hardware. In this work, we present a technique for quantum error mitigation which is based on a technique from quantum verification, the so-called accreditation protocol, together with postselection. Our technique allows for correcting the expectation value of an observable OOO, which is the output of multiple runs of noisy quantum circuits, where the noise in these circuits is at the level of preparations, gates, and measurements. We discuss the sample complexity of our procedure and provide rigorous guarantees of errors being mitigated under some realistic assumptions on the noise. Our technique is tailored to time-dependent behaviors, as we allow for the output states to be different between different runs of the accreditation protocol. We validate our findings by running our technique on currently available quantum hardware.
We present an accreditation protocol for analogue, i.e., continuous-time, quantum simulators. For a given simulation task, it provides an upper bound on the variation distance between the probability distributions at the output of an erroneous and error-free analogue quantum simulator. As its overheads are independent of the size and nature of the simulation, the protocol is ready for immediate usage and practical for the long term. It builds on the recent theoretical advances of strongly universal Hamiltonians and quantum accreditation as well as experimental progress toward the realization of programmable hybrid analogue-digital quantum simulators.
We improve on the results of [A. Jackson et al. Proc. Natl. Acad. Sci. U.S.A 121 (6). 2024] on the verification of analogue quantum simulators by eliminating the use of universal Hamiltonians, removing the need for two-qubit gates, and no longer assuming error is represented by identical maps across simulations. This new protocol better reflects the reality of extant analogue simulators. It integrates well with recent complexity theoretic results, leading to a near-term feasible simulation-based route to establishing quantum advantage.
We develop a family of quantum accreditation protocols for quantum circuits with non-Clifford two-qubit gates. The latter includes families of gates such as the fSim and XY families of gates, native to existing hardwares. We provide practical and scalable protocols that upper-bound the total variation distance between the probability distributions of error-free and erroneous quantum computations. We also establish the robustness of our protocols to small perturbations and generalize Pauli twirling to non-Pauli single-qubit bases, which may be of independent interest.
We present an accreditation protocol for the outputs of noisy intermediate-scale quantum devices. By testing entire circuits rather than individual gates, our accreditation protocol can provide an upper-bound on the variation distance between noisy and noiseless probability distribution of the outputs of the target circuit of interest. Our accreditation protocol requires implementing quantum circuits no larger than the target circuit, therefore it is practical in the near term and scalable in the long term. Inspired by trap-based protocols for the verification of quantum computations, our accreditation protocol assumes that single-qubit gates have bounded probability of error. We allow for arbitrary spatial and temporal correlations in the noise affecting state preparation, measurements, single-qubit and two-qubit gates. We describe how to implement our protocol on real-world devices, and we also present a novel cryptographic protocol (which we call 'mesothetic' protocol) inspired by our accreditation protocol.
We present verification protocols to gain confidence in the correct performance of a device implementing an arbitrary quantum computation. The derivation of the protocols is based on the fact that matchgate computations, which are classically efficiently simulable, become universal if supplemented with additional resources. We combine tools from weak simulation, randomized compiling, and statistics to derive verification circuits that (i) strongly resemble the original circuit and (ii) can be classically efficiently simulated not only in the ideal, i.e., error free scenario, but also in the realistic situation where errors are present. In fact, in one of the protocols we apply exactly the same circuit as in the original computation, however, to a slightly modified input state. Published by the American Physical Society 2024