A Provably Secure Framework for Noise-Aware Delegated Quantum Computation and Storage
Sanidhya Gupta, Ankur Raina

TL;DR
This paper introduces a provably secure, noise-aware framework for delegated quantum computation that ensures privacy, correctness, and integrity in distributed quantum cloud services through error correction and verification.
Contribution
It presents a novel end-to-end architecture combining distributed stabilizer codes, local error correction, and trap-based verification for secure quantum cloud computing.
Findings
Framework achieves completeness, blindness, and verifiability.
Provides formal security proofs for the protocol.
Enables practical secure quantum cloud services.
Abstract
As large-scale quantum computers become a reality, they will likely exist as centralized cloud resources accessible to a broad user base. Securely delegating private quantum computations to untrusted servers is therefore a foundational challenge. This requires rigorous, provable guarantees of privacy (blindness), correctness (completeness), and integrity against malicious actions (verifiability). This paper presents a complete end-to-end framework for noise-aware distributed quantum computation. Our architecture is built on three technical pillars: (1) a distributed stabilizer code backbone to securely encode and store quantum states across multiple non-communicating server nodes; (2) a two-level error correction scheme, where each server node can locally correct errors based on its specific noise model; and (3) a trap-based verification protocol to detect any malicious deviation by the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
