Verification Meets Calibration: Bounds and Secret-Independent State Preparation with an NV-Center as a Case Study
Ezra Acalapati, Elham Kashefi, Cica Gustiani
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.
Create a lesson
Related papers
Trading Circuit Depth for Pulse Sparsity in Chromatic Dynamical Decoupling
Amy F. Brown, Daniel A. Lidar
Optimal spectrum estimation
Ainesh Bakshi, Apoorv Vikram Singh, Xinyu Tan
Non-Abelian sheaf quantum LDPC codes: good and magical
Zimu Li, Fuchuan Wei, Zhengyi Han et al.
Learning and interpreting policies for simultaneous entanglement requests in quantum networks
Leon Rode, Sumeet Khatri, Supartha Podder
Sharp universal death of entanglement threshold for Pauli Hamiltonians
Bobak T. Kiani
Proper Agnostic Learning of Matrix Product States and Tree Tensor Networks
Constantin Cedillo Vayson de Pradenne, Jordan Cotler