Client-friendly continuous-variable blind and verifiable quantum computing

Abstract

We present a verifiable and blind protocol for assisted universal quantum computing on continuous-variable (CV) platforms. This protocol is highly experimentally-friendly to the client, as it only requires Gaussianoperation capabilities from the latter. Moreover, the server is not required universal quantum-computational power either, its only function being to supply the client with copies of a single-mode non-Gaussian state. Universality is attained based on state-injection of the server's non-Gaussian supplies. The protocol is automatically blind because the non-Gaussian resource requested to the server is always the same, regardless of the specific computation. Verification, in turn, is possible thanks to an efficient non-Gaussian state fidelity test where we assume identical state preparation by the server. It is based on Gaussian measurements by the client on the injected states, which is potentially interesting on its own. The division of quantum hardware between client and server assumed here is in agreement with the experimental constraints expected in realistic schemes for CV cloud quantum computing. arXiv:1806.09137v1 [quant-ph]

Resource-efficient verification of quantum computing using Serfling’s bound

“…Recently, Liu et al have constructed a fidelity witness with respect to the tensor products of finitely squeezed cubic phase states [29]. Based on this fidelity witness, they have also proposed another CV VBQC protocol.…”

“…To the best of our knowledge, no verifiable blind CV quantum computing protocol was known previously except for the protocol of Ref. [29]. The protocol of Ref.…”

“…The protocol of Ref. [29] assumes that the malicious server is restricted to preparing i.i.d. copies of single-qumode states while the malicious server in our protocol can perform any CPTP map as an attack.…”

Parallel self‐testing for device‐independent verifiable blind quantum computation

“…1 There have already been some verification protocols including verifiable blind quantum computation (VBQC). [2][3][4][5][6][7][8][9][10][11][12][13][14] In VBQC scheme the client who has abilities to do classical computation and prepare single rotated qubits delegates computation tasks to the server who has ability to do universal quantum computation and verifies the correctness of outcomes sent by the server. The main idea of VBQC is to utilize the blindness of universal blind quantum computation (UBQC) [15][16][17][18][19][20][21][22][23][24][25][26][27][28][29] and introduce trap qubits so that the server can not distinguish the part of computation and the part of testing.…”

“…which is exactly the first inequality of (14). Turning our attention to Φ ′ (M x | * ⟩), analogously, we propagate the operator M x i to the ith subitem from i = n to i = 1 and thus obtain 1…”