Ancilla-Driven Universal Blind Quantum Computation

Abstract

Blind quantum computation is a new quantum secure protocol, which enables Alice who does not have enough quantum technology to delegate her computation to Bob who has a fully-fledged quantum power without revealing her input, output and algorithm. So far, blind quantum computation has been considered only for the circuit model and the measurement-based model. Here we consider the possibility and the limitation of blind quantum computation in the ancilla-driven model, which is a hybrid of the circuit and the measurement-based models.

4 pages, 9 figures, the revision for improving the readability

References in corpus (13)

• Topological fault-tolerance in cluster state quantum computation
• Valence Bond Solids for Quantum Computation
• Novel schemes for measurement-based quantum computation
• Universal resources for measurement-based quantum computation
• Measurement-based quantum computer in the gapped ground state of a two-body Hamiltonian
• Quantum computation on the edge of a symmetry-protected topological order
• Quantum computational capability of a 2D valence bond solid phase
• Hybrid Quantum Computation in Quantum Optics
• Completeness of the classical 2D Ising model and universal quantum computation
• Generalized Toffoli gates using qudit catalysis
• Simple proof of fault tolerance in the graph-state model
• Fault-Tolerant Topological One-Way Quantum Computation with Probabilistic Two-Qubit Gates
• Thermal States as Universal Resources for Quantum Computation with Always-on Interactions

Cited by in corpus (31)

• Photonic quantum information processing: a review
• Verifiable measurement-only blind quantum computing with stabilizer testing
• Optimal Blind Quantum Computation
• 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
• Semiquantum key distribution with secure delegated quantum computation
• 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
• Universal distributed blind quantum computing with solid-state qubits
• Fault-tolerant Operations for Universal Blind Quantum Computation
• Multi-client distributed blind quantum computation with the Qline architecture
• Flow Ambiguity: A Path Towards Classically Driven Blind Quantum Computation
• Acausal measurement-based quantum computing
• Hybrid quantum computing with ancillas
• Measurement-based universal blind quantum computation with minor resources
• Verified Delegated Quantum Computing with One Pure Qubit
• A quantum homomorphic encryption scheme for polynomial-sized circuits
• Tripartite Blind Quantum Computation
• Blind quantum computing can always be made verifiable
• Impossibility of blind quantum sampling for classical client
• Gate Teleportation-based Universal Blind Quantum Computation
• Verifiable cloud-based variational quantum algorithms
• A framework for quantum homomorphic encryption with experimental demonstration
• Teleportation-based quantum homomorphic encryption scheme with quasi-compactness and perfect security