Continuous-variable blind quantum computation

Abstract

Blind quantum computation is a secure delegated quantum computing protocol where Alice who does not have sufficient quantum technology at her disposal delegates her computation to Bob who has a fully-fledged quantum computer in such a way that Bob cannot learn anything about Alice's input, output, and algorithm. Protocols of blind quantum computation have been proposed for several qubit measurement-based computation models, such as the graph state model, the Affleck-Kennedy-Lieb-Tasaki model, and the Raussendorf-Harrington-Goyal topological model. Here, we consider blind quantum computation for the continuous-variable measurement-based model. We show that blind quantum computation is possible for the infinite squeezing case. We also show that the finite squeezing causes no additional problem in the blind setup apart from the one inherent to the continuous-variable measurement-based quantum computation.

20 pages, 8 figures

References in corpus (9)

• Device-independent security of quantum cryptography against collective attacks
• Universal Quantum Computation with Continuous-Variable Cluster States
• Fault-tolerant quantum computation with high threshold in two dimensions
• Topological fault-tolerance in cluster state quantum computation
• Experimental generation of four-mode continuous-variable cluster states
• Measurement-based quantum computer in the gapped ground state of a two-body Hamiltonian
• Arbitrarily Large Continuous-Variable Cluster States from a Single Quantum Nondemolition Gate
• Thermal States as Universal Resources for Quantum Computation with Always-on Interactions
• Demonstration of Cluster State Shaping and Quantum Erasure for Continuous Variables

Cited by in corpus (31)

• Photonic quantum information processing: a review
• Verifiable measurement-only blind quantum computing with stabilizer testing
• Efficient universal blind computation
• Symmetric quantum fully homomorphic encryption with perfect security
• Demonstration of measurement-only blind quantum computing
• Composable security of delegated quantum computation
• Secure entanglement distillation for double-server blind quantum computation
• Blind quantum computation with noise environment
• Quantum fully homomorphic encryption scheme based on universal quantum circuit
• Practical quantum computing on encrypted data
• Resource-efficient verification of quantum computing using Serfling's bound
• Semiquantum key distribution with secure delegated quantum computation
• Blind quantum computation over a collective-noise channel
• Overcoming efficiency constraints on blind quantum computation
• Measurement-only verifiable blind quantum computing with quantum input verification
• Flow Ambiguity: A Path Towards Classically Driven Blind Quantum Computation
• Efficient verification of continuous-variable quantum states and devices without assuming identical and independent operations
• Acausal measurement-based quantum computing
• Blind quantum computing with two almost identical states
• Client-friendly continuous-variable blind and verifiable quantum computing
• Random coding for sharing bosonic quantum secrets
• Measurement-based universal blind quantum computation with minor resources
• Verified Delegated Quantum Computing with One Pure Qubit
• Tripartite Blind Quantum Computation
• Quantum-enhanced Secure Delegated Classical Computing
• Blind quantum computation with completely classical client and a trusted center
• Blind quantum computing can always be made verifiable
• Impossibility of blind quantum sampling for classical client
• Measurement-based quantum computation cannot avoid byproducts
• Blind quantum computing with different qudit resource state architectures
• Teleportation-based quantum homomorphic encryption scheme with quasi-compactness and perfect security