Overcoming efficiency constraints on blind quantum computation

Abstract

Blind quantum computation allows a user to delegate a computation to an untrusted server while keeping the computation hidden. A number of recent works have sought to establish bounds on the communication requirements necessary to implement blind computation, and a bound based on the no-programming theorem of Nielsen and Chuang has emerged as a natural limiting factor. Here we show that this constraints only hold in limited scenarios and show how to overcome it using a method based on iterated gate-teleportations. We present our results as a family of protocols, with varying degrees of computational-ability requirements on the client. Certain protocols in this family exponentially outperform previously known schemes in terms of total communication. The approach presented here can be adapted to other distributed computing protocols to reduce communication requirements.

5 pages, 2 figures

References in corpus (12)

• Quantum Teleportation is a Universal Computational Primitive
• Experimental Demonstration of Blind Quantum Computing
• Programmable quantum gate arrays
• Blind quantum computation protocol in which Alice only makes measurements
• Experimental verification of quantum computations
• Blind topological measurement-based quantum computation
• Optimal Blind Quantum Computation
• Efficient universal blind computation
• Probabilistic implementation of universal quantum processors
• Ancilla-Driven Universal Blind Quantum Computation
• Continuous-variable blind quantum computation
• Quantum Information Processing with Delocalized Qubits under Global Control

Cited by in corpus (18)

• Photonic quantum information processing: a review
• Unconditionally verifiable blind computation
• Verifiable measurement-only blind quantum computing with stabilizer testing
• Experimental Blind Quantum Computing for a Classical Client
• Practical quantum computing on encrypted data
• Blind quantum computation over a collective-noise channel
• Quantum teleportation and information splitting via four-qubit cluster state and a Bell state
• Multi-client distributed blind quantum computation with the Qline architecture
• Resource Quantification for the No-Programming Theorem
• Flow Ambiguity: A Path Towards Classically Driven Blind Quantum Computation
• Blind quantum computation for a user who only performs single-qubit gates
• A Hybrid and Universal Blind Quantum Computation
• Blind quantum computing with two almost identical states
• Measurement-based universal blind quantum computation with minor resources
• On optimising quantum communication in verifiable quantum computing
• Blind quantum computing can always be made verifiable
• Gate Teleportation-based Universal Blind Quantum Computation
• Quantum Teleportation in Non-equilibrium Environments and Fixed-point Fidelity