Year: 2026
Type: article
Abstract: Interactive verification protocols for quantum computations allow to build trust between a client and a service provider, ensuring the former that the instructed computation was carried out faithfully. They come in two variants, one without quantum communication that requires large overhead on the server side to coherently implement quantum-resistant cryptographic primitives and one with quantum communication but with repetition as the only overhead on the service provider’s side. Given the limited number of available qubits on current machines, only quantum communication-based protocols have yielded proof of concepts. In this work, we show that part of the operational cost associated with the repetition required by protocols with quantum communication can be reduced from the service provider’s point of view. The test-round data collected for security can be reused, without introducing a separate family of calibration circuits, to monitor effective noise parameters of the implemented process. This reuse does not eliminate statistical sampling costs; additional test rounds may be required when verification alone does not provide enough samples for the desired estimation accuracy. Under an identifiable noise model and appropriate assumptions on state-preparation and measurement effects, the effective quantities can further be interpreted as gate-level parameters. This exemplifies the versatility of these protocols, whose template can serve multiple purposes, and strengthens the case for considering their early integration into quantum-machine development roadmaps.
Source: Quantum Science and Technology
Authors: Amit Saha, Harold Ollivier
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W7172534913