Paper 2025/734

Universal Blind and Verifiable Delegated Quantum Computation with Classical Clients

Vicent Esteve Voltes
Abstract

Delegation of quantum computation in a trustful way is one of the most fundamental challenges toward the realization of future quantum cloud computing. While considerable progress has been made, no known protocol provides a purely classical client with universal delegated quantum computation while simultaneously ensuring blindness (input privacy), verifiability (soundness), and robustness against quantum noise—a feat that must be achieved under stringent cryptographic assumptions and with low overhead. In this work, I introduce UVCQC, a new delegation framework that, for the first time, realizes a fully composable protocol for securely delegating quantum computations to an untrusted quantum server from a classical client. My scheme employs trap-based quantum authentication, post-quantum cryptographic commitments, and zero-knowledge proofs to provide full guarantees: the client remains purely classical; the server learns nothing about the computation; and any attempt to deviate from the specified circuit is detected with high probability. I rigorously prove completeness, soundness, and perfect blindness of the protocol and demonstrate its universal composability against unbounded quantum adversaries. Furthermore, I propose a thermodynamically inspired verification mechanism based on energy dissipation and entropy change, enabling physically testable verification independent of cryptographic assumptions. Beyond its core architecture, UVCQC is deeply intertwined with multidisciplinary frameworks: it admits a game-theoretic formulation where honesty is a Nash equilibrium, an information-theoretic treatment grounded in Holevo bounds, a categorical model via compact closed structures, and novel cryptographic enhancements based on isogeny-based primitives and topological invariants. This research offers a scalable and unified solution to the blind and verifiable delegation problem, pushing forward the theoretical and practical frontiers of secure quantum computation—and opening a tangible path toward trustable quantum cloud services for classical users.

Note: This preprint was first made available via Zenodo (DOI: 10.5281/zenodo.15265412). This version is unchanged and submitted here to increase its visibility to the cryptography research community.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
Keywords
Quantum DelegationVerifiabilityBlind ComputationClassical ClientPost-Quantum Cryptography
Contact author(s)
vicent @ reddes net
History
2025-04-27: approved
2025-04-24: received
See all versions
Short URL
https://ia.cr/2025/734
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2025/734,
      author = {Vicent Esteve Voltes},
      title = {Universal Blind and Verifiable Delegated Quantum Computation with Classical Clients},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/734},
      year = {2025},
      url = {https://eprint.iacr.org/2025/734}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.