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

Cross-verification of independent quantum devices

C Greganti, TF Demarie, M Ringbauer, JA Jones, V Saggio, IA Calafell, LA Rozema, A Erhard, M Meth, L Postler, R Stricker, P Schindler, R Blatt, T Monz, P Walther, JF Fitzsimons

Published Jan 1, 2021• 0 citations
OpenAlex

Abstract

Todays noisy quantum computers are pushing the limits of classical computation. We present a scalable cross-check procedure to verify their performance in a hardware agnostic way and without relying on classical simulation.

Related papers

Cross-verification of independent quantum devices

Chiara Greganti, Tommaso F. Demarie, Martin Ringbauer +13 more

Today’s intermediate-scale quantum devices are on the brink of outperforming their classical counterparts. Yet these devices remain noisy, and with no trusted classical computers to check their results, we are left with a dire need to verify that they indeed perform as intended. The standard approach to this problem is to benchmark the performance of the individual building blocks using techniques such as quantum process tomography or randomized benchmarking and then extrapolate to the full system. In practice, however, such an extrapolation can be unreliable due to non-Markovian effects, unmodelled stray noise or temporally and spatially correlated noise. Hence, there is a need for full-system verification techniques able to capture every source of noise and imperfection.

Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC)•Jun 21, 2021•2 citations

Cross-Verification of Independent Quantum Devices

C. Greganti, T. F. Demarie, Martin Ringbauer +13 more

A technique for verifying that a quantum computation is correct checks one device against another, a method that does not rely on classical computers and could be used on next-generation quantum devices.

arXiv:1905.09790•Physical Review X•Sep 2, 2021•18 citations

Device-Independent Quantum Computing

Ni-Ni Huang, Jia-Cheng Xu, Che‐Ming Li

We present a novel classical model through which any classical mimicry of target quantum computational processes can be ruled out, which provides a benchmark for identifying measurement-based quantum computing in a fully device-independent manner.

OSA Quantum 2.0 Conference•Jan 1, 2020•0 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

How do we verify and validate a quantum computer

Sarah Sheldon, David C. McKay, Jerry M. Chow +1 more

Bulletin of the American Physical Society•Mar 9, 2018•0 citations

Verification Meets Calibration: Bounds and Secret-Independent State Preparation with an NV-Center as a Case Study

Ezra Acalapati, Elham Kashefi, Cica Gustiani

Verification protocols provide cryptographic guarantees that the outcome of a delegated quantum computation is correct, a key requirement for scalable and trustworthy quantum computing. A central assumption underlying these protocols is secret independence: the noise affecting state preparation must not depend on the classical secrets that specify the prepared states. In earlier protocols this assumption was enforced by the physical separation of client and server; in the recent on-chip setting it becomes a property of the hardware itself, and one that high-fidelity devices do not automatically satisfy. We first make the requirement quantitative, deriving a bound that shows how residual secret dependence limits the size of any verifiable computation within this framework. Motivated by this, we introduce a calibration framework that enforces secret independence through pulse-level quantum control, producing state preparations that are simultaneously high-fidelity and secret-independent. We assess its performance on a nitrogen-vacancy centre system via emulation, showing that it reduces the secret dependence of the preparations by more than an order of magnitude compared to standard optimal control, and that it is robust against detuning and drive-amplitude errors commonly encountered in experiment. The framework operates entirely at the calibration stage and is platform-agnostic, offering a practical pathway towards verifiable quantum computing at scale.

quant-pharXiv:2609.20219•Aug 20, 2026•0 citations
Today’s intermediate-scale quantum devices are on the brink of outperforming their classical counterparts. Yet these devices remain noisy, and with no trusted classical computers to check their results, we are left with a dire need to verify that they indeed perform as intended. The standard approach to this problem is to benchmark the performance of the individual building blocks using techniques such as quantum process tomography or randomized benchmarking and then extrapolate to the full system. In practice, however, such an extrapolation can be unreliable due to non-Markovian effects, unmodelled stray noise or temporally and spatially correlated noise. Hence, there is a need for full-system verification techniques able to capture every source of noise and imperfection.
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.
Verification protocols provide cryptographic guarantees that the outcome of a delegated quantum computation is correct, a key requirement for scalable and trustworthy quantum computing. A central assumption underlying these protocols is secret independence: the noise affecting state preparation must not depend on the classical secrets that specify the prepared states. In earlier protocols this assumption was enforced by the physical separation of client and server; in the recent on-chip setting it becomes a property of the hardware itself, and one that high-fidelity devices do not automatically satisfy. We first make the requirement quantitative, deriving a bound that shows how residual secret dependence limits the size of any verifiable computation within this framework. Motivated by this, we introduce a calibration framework that enforces secret independence through pulse-level quantum control, producing state preparations that are simultaneously high-fidelity and secret-independent. We assess its performance on a nitrogen-vacancy centre system via emulation, showing that it reduces the secret dependence of the preparations by more than an order of magnitude compared to standard optimal control, and that it is robust against detuning and drive-amplitude errors commonly encountered in experiment. The framework operates entirely at the calibration stage and is platform-agnostic, offering a practical pathway towards verifiable quantum computing at scale.