Secure assisted quantum computation

Abstract

Suppose Alice wants to perform some computation that could be done quickly on a quantum computer, but she cannot do universal quantum computation. Bob can do universal quantum computation and claims he is willing to help, but Alice wants to be sure that Bob cannot learn her input, the result of her calculation, or perhaps even the function she is trying to compute. We describe a simple, efficient protocol by which Bob can help Alice perform the computation, but there is no way for him to learn anything about it. We also discuss techniques for Alice to detect whether Bob is honestly helping her or if he is introducing errors.

11 pages, 5 figures; v2: published version

References in corpus (5)

• Instantaneous non-local computation of low T-depth quantum circuits
• Quantum Digital Signatures
• Two-qubit Projective Measurements are Universal for Quantum Computation
• Storage of quantum dynamics on quantum states: a quasi-perfect programmable quantum gate
• Multi-party Quantum Computation

Cited by in corpus (9)

• Trapped-Ion Quantum Computing: Progress and Challenges
• Quantum federated learning through blind quantum computing
• Random-Receiver Quantum Communication
• Experimental Demonstration of Quantum Fully Homomorphic Encryption with Application in a Two-Party Secure Protocol
• Spin and motion dynamics with zigzag ion crystals in transverse magnetic field gradients
• Parallel quantum trajectories via forking for sampling without redundancy
• Quantum Fully Homomorphic Encryption by Integrating Pauli One-time Pad with Quaternions
• Representation matching for delegated quantum computing
• Towards practical secure delegated quantum computing with semi-classical light