Optimal Blind Quantum Computation

Abstract

Blind quantum computation allows a client with limited quantum capabilities to interact with a remote quantum computer to perform an arbitrary quantum computation, while keeping the description of that computation hidden from the remote quantum computer. While a number of protocols have been proposed in recent years, little is currently understood about the resources necessary to accomplish the task. Here we present general techniques for upper and lower bounding the quantum communication necessary to perform blind quantum computation, and use these techniques to establish a concrete bounds for common choices of the client's quantum capabilities. Our results show that the UBQC protocol of Broadbent, Fitzsimons and Kashefi [1], comes within a factor of 8/3 of optimal when the client is restricted to preparing single qubits. However, we describe a generalization of this protocol which requires exponentially less quantum communication when the client has a more sophisticated device.

References in corpus (2)

• Quantum-state preparation with universal gate decompositions
• Efficient universal blind computation

Cited by in corpus (38)

• Photonic quantum information processing: a review
• Verifiable measurement-only blind quantum computing with stabilizer testing
• Verification of quantum computation: An overview of existing approaches
• Experimental Blind Quantum Computing for a Classical Client
• Efficient universal blind computation
• Demonstration of measurement-only blind quantum computing
• Limitations on information theoretically secure quantum homomorphic encryption
• Quantum homomorphic encryption from quantum codes
• Blind quantum computation with noise environment
• Quantum fully homomorphic encryption scheme based on universal quantum circuit
• Semiquantum key distribution with secure delegated quantum computation
• A quantum approach to homomorphic encryption
• Blind quantum computation over a collective-noise channel
• Overcoming efficiency constraints on blind quantum computation
• Device-Independent Verifiable Blind Quantum Computation
• Measurement-only verifiable blind quantum computing with quantum input verification
• QFactory: classically-instructed remote secret qubits preparation
• Multi-client distributed blind quantum computation with the Qline architecture
• Remote blind state preparation with weak coherent pulses in the field
• Robust and efficient verification of graph states in blind measurement-based quantum computation
• Flow Ambiguity: A Path Towards Classically Driven Blind Quantum Computation
• On the possibility of classical client blind quantum computing
• Networked Quantum Services
• Blind quantum computation for a user who only performs single-qubit gates
• Acausal measurement-based quantum computing
• Blind quantum computing with two almost identical states
• Deploying hybrid quantum-secured infrastructure for applications: When quantum and post-quantum can work together
• Experimental verifiable multi-client blind quantum computing on a Qline architecture
• Measurement-based universal blind quantum computation with minor resources
• On optimising quantum communication in verifiable quantum computing
• Universal Single-Server Blind Quantum Computation for Classical Clients
• Verified Delegated Quantum Computing with One Pure Qubit
• Two-Server Oblivious Transfer for Quantum Messages
• Blind quantum computing can always be made verifiable
• Impossibility of blind quantum sampling for classical client
• Quantum-enhanced Secure Delegated Classical Computing
• Blind quantum computation with completely classical client and a trusted center
• Gate Teleportation-based Universal Blind Quantum Computation