Verification Meets Calibration: Bounds and Secret-Independent State Preparation with an NV-Center as a Case Study
Abstract
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.
Related
- Dynamic calibration method for the system constant of high-spectral-resolution lidar with airborne experimental verification
- Two-Layer Verification for Fault-Tolerant Magic-State Preparation in High-Rate Quantum Codes
- Preparation Changes the Cost of Calibration for Quantum Control
- Empirical verification of principal mode orthogonality and relative phase calibration in photonic lanterns
- Fast verification of fault tolerant magic state preparation circuits with the CNOT + T gate set
BibTeX
@misc{acalapati2026verification,
title = {{Verification Meets Calibration: Bounds and Secret-Independent State Preparation with an NV-Center as a Case Study}},
author = {Ezra Acalapati and Elham Kashefi and Cica Gustiani},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.20219},
eprint = {2609.20219},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.20219},
}
RIS
TY - UNPB
TI - Verification Meets Calibration: Bounds and Secret-Independent State Preparation with an NV-Center as a Case Study
AU - Ezra Acalapati
AU - Elham Kashefi
AU - Cica Gustiani
PY - 2026
DA - 2026/09/01
PB - arXiv
DO - 10.48550/arxiv.2609.20219
UR - https://arxiv.org/abs/2609.20219
AB - 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.
ER -