Full private delegated quantum computing tailored from user to industry

TL;DR

This work addresses privacy-preserving delegated quantum computing for both individual users and industry, proposing a structured framework that adapts to the client's available quantum resources. It surveys MBQC, CBQC, and FDQC, and introduces industry- and user-oriented protocols that combine encryption, trap-based verification, SWAP obfuscation, and distributed architectures to protect data and circuit structure. The paper also presents a verification algorithm and concrete algorithm demonstrations (Grover, QAOA, QNN) to illustrate practical deployment scenarios. Overall, it offers a unified set of privacy-aware delegation strategies across diverse resource regimes, enabling more secure and scalable use of quantum outsourcing in real-world settings.

Abstract

In this paper, we present a set of private and secure delegated quantum computing protocols and techniques tailored to user-level and industry-level use cases, depending on the computational resources available to the client, the specific privacy needs required, and the type of algorithm. Our protocols are presented at a high level as they are independent of the particular algorithm used for such encryption and decryption processes. Additionally, we propose a method to verify the correct execution of operations by the external server.

Figures (9)

• Figure 1: $RZZ$ gate decomposition
• Figure 2: General communication scheme between the client device and the external server device. a) MBQC: the client sends the qubits to the server and the server performs all quantum operations, which are classically controlled. b) CBQC: the client and the server exchange qubits and perform operations according to the client's instructions. c) Distributed computing: the client controls several servers with a common node, not communicating with each other directly.
• Figure 3: Generic graph state and graph state for the method Universal_Blind.
• Figure 4: Grover's circuit that searches for the states $\ket{101}$ and $\ket{110}$.
• Figure 5: Applied Grover's circuit that searches for the states $\ket{101}$ and $\ket{110}$. The blue parts are executed by the client and the red parts by the server. The divisors indicate the qubit exchange and whether it is encrypted ($K$) or decrypted ($K^{-1}$).