Efficient universal blind computation

Abstract

We give a cheat sensitive protocol for blind universal quantum computation that is efficient in terms of computational and communication resources: it allows one party to perform an arbitrary computation on a second party's quantum computer without revealing either which computation is performed, or its input and output. The first party's computational capabilities can be extremely limited: she must only be able to create and measure single-qubit superposition states. The second party is not required to use measurement-based quantum computation. The protocol requires the (optimal) exchange of O(J log(N)) single-qubit states, where J is the computational depth and N is the number of qubits needed for the computation.

References in corpus (3)

• Quantum random access memory
• Quantum private queries
• Optimal Blind Quantum 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
• Quantum federated learning through blind quantum computing
• Optimal Blind Quantum Computation
• Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
• Demonstration of measurement-only blind quantum computing
• Quantum homomorphic encryption from quantum codes
• Blind quantum computation with noise environment
• Practical quantum computing on encrypted data
• Quantum fully homomorphic encryption scheme based on universal quantum circuit
• Network Community Detection On Small Quantum Computers
• Semiquantum key distribution with secure delegated quantum computation
• A quantum approach to homomorphic encryption
• Overcoming efficiency constraints on blind quantum computation
• Blind quantum computation over a collective-noise channel
• Measurement-only verifiable blind quantum computing with quantum input verification
• QFactory: classically-instructed remote secret qubits preparation
• Data centers with quantum random access memory and quantum networks
• Remote blind state preparation with weak coherent pulses in the field
• Resource Quantification for the No-Programming Theorem
• Flow Ambiguity: A Path Towards Classically Driven Blind Quantum Computation
• On the possibility of classical client blind quantum computing
• Quantum Data Center: Perspectives
• Acausal measurement-based quantum computing
• Blind quantum computation for a user who only performs single-qubit gates
• A Hybrid and Universal Blind Quantum Computation
• Blind quantum machine learning with quantum bipartite correlator
• Enhanced delegated computing using coherence
• Measurement-based universal blind quantum computation with minor resources
• Verified Delegated Quantum Computing with One Pure Qubit
• A survey of universal quantum von Neumann architecture
• Logical entanglement distribution between distant 2D array qubits
• Quantum-secure multiparty deep learning
• Blind quantum computing can always be made verifiable
• Impossibility of blind quantum sampling for classical client
• Entanglement, Flow and Classical Simulatability in Measurement Based Quantum Computation
• Gate Teleportation-based Universal Blind Quantum Computation