Published May 15, 2025 | Version v2
Preprint Open

Universal Blind and Verifiable Delegated Quantum Computation with Classical Clients

Creators

  • 1. Independet Researcher

Description

Quantum computing promises unprecedented computational power, but practical challenges remain—especially for users without access to quantum hardware. This paper introduces a novel solution: a universal protocol for blind and verifiable quantum computing designed specifically for purely classical clients.

In this protocol, classical users securely delegate quantum computations to remote quantum servers without needing quantum capabilities of their own. Using advanced cryptographic techniques (trapdoor claw-free functions, Learning With Errors, zero-knowledge SNARKs), our method ensures complete security, privacy (blindness), and reliability (verifiability). Additionally, we've developed a unique thermodynamic approach to verification, leveraging entropy flows as a physical measure of computational correctness.

By integrating cryptographic security, quantum information theory, and thermodynamics, this work provides a robust theoretical framework for making quantum advantages accessible to everyone—securely, privately, and confidently.

Files

Universal Blind and Verifiable Delegated Quantum_0AComputation with Classical Clients.pdf

Files (412.1 kB)

Additional details

Dates

Created
2025-05-22

References

  • Mahadev, U. (2018). Classical verification of quantum computations. Proceedings of the 59th IEEE Symposium on Foundations of Computer Science (FOCS), 2018.
  • Broadbent, A., Fitzsimons, J., & Kashefi, E. (2009). Universal blind quantum computation. 50th IEEE Symposium on Foundations of Computer Science (FOCS), 2009.
  • Regev, O. (2009). On lattices, learning with errors, random linear codes, and cryptography. Journal of the ACM, 56(6):1–40, 2009.
  • Canetti, R. (2001). Universally composable security: A new paradigm for cryptographic protocols. 42nd IEEE Symposium on Foundations of Computer Science (FOCS), 2001.
  • Garg, S., Gentry, C., Halevi, S., Sahai, A., & Waters, B. (2013). Multilinear maps and indistinguishability obfuscation. EUROCRYPT, Springer, 2013.
  • Holevo, A. S. (1973). Bounds for the quantity of information transmitted by a quantum communication channel. Problems of Information Transmission, 9(3):177–183, 1973.
  • Ben-Or, M., Crépeau, C., Gottesman, D., Hassidim, A., & Smith, A. (2006). Secure multiparty quantum computation with a dishonest majority. 47th IEEE Symposium on Foundations of Computer Science (FOCS), 2006.