Blind topological measurement-based quantum computation

Abstract

Blind quantum computation is a novel secure quantum-computing protocol that enables Alice, who does not have sufficient quantum technology at her disposal, to delegate her quantum 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. A recent proof-of-principle experiment demonstrating blind quantum computation in an optical system has raised new challenges regarding the scalability of blind quantum computation in realistic noisy conditions. Here we show that fault-tolerant blind quantum computation is possible in a topologically protected manner using the Raussendorf-Harrington-Goyal scheme. The error threshold of our scheme is 0.0043, which is comparable to that (0.0075) of non-blind topological quantum computation. As the error per gate of the order 0.001 was already achieved in some experimental systems, our result implies that secure cloud quantum computation is within reach.

17 pages, 5 figures

References in corpus (9)

• Fault-tolerant quantum computation with high threshold in two dimensions
• Topological fault-tolerance in cluster state quantum computation
• Towards fault-tolerant quantum computing with trapped ions
• Experimental Demonstration of Blind Quantum Computing
• Experimental demonstration of topological error correction
• Towards practical classical processing for the surface code
• Blind quantum computation protocol in which Alice only makes measurements
• Universal Blind Quantum Computing with Weak Coherent Pulses
• Fault-Tolerant Topological One-Way Quantum Computation with Probabilistic Two-Qubit Gates

Cited by in corpus (56)

• Photonic quantum information processing: a review
• Unconditionally verifiable blind computation
• Verifiable measurement-only blind quantum computing with stabilizer testing
• Blind quantum computation protocol in which Alice only makes measurements
• Experimental verification of quantum computations
• Entanglement-Assisted Quantum Networks: Mechanics, Enabling Technologies, Challenges, and Research Directions
• Robustness and device independence of verifiable blind quantum computing
• Experimental Blind Quantum Computing for a Classical Client
• Efficient universal blind computation
• Demonstration of measurement-only blind quantum computing
• Symmetric quantum fully homomorphic encryption with perfect security
• Composable security of delegated quantum computation
• Ancilla-Driven Universal Blind Quantum Computation
• Secure entanglement distillation for double-server blind quantum computation
• Continuous-variable blind quantum computation
• Blind quantum computation with noise environment
• Practical quantum computing on encrypted data
• Quantum fully homomorphic encryption scheme based on universal quantum circuit
• Semiquantum key distribution with secure delegated quantum computation
• Verifiable fault-tolerance in measurement-based 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
• QFactory: classically-instructed remote secret qubits preparation
• Requirements for a processing-node quantum repeater on a real-world fiber grid
• Multi-client distributed blind quantum computation with the Qline architecture
• Fault-tolerant Operations for Universal Blind Quantum Computation
• Heralded single excitation of atomic ensemble via solid-state-based telecom photon detection
• qBitcoin: A Peer-to-Peer Quantum Cash System
• Remote blind state preparation with weak coherent pulses in the field
• Flow Ambiguity: A Path Towards Classically Driven Blind Quantum Computation
• Computing on quantum shared secrets
• Blind quantum computation for a user who only performs single-qubit gates
• Acausal measurement-based quantum computing
• A Hybrid and Universal Blind Quantum Computation
• Deploying hybrid quantum-secured infrastructure for applications: When quantum and post-quantum can work together
• Measurement-based universal blind quantum computation with minor resources
• Universal Single-Server Blind Quantum Computation for Classical Clients
• Blind Oracular Quantum Computation
• Verified Delegated Quantum Computing with One Pure Qubit
• Quantum delegated and federated learning via quantum homomorphic encryption
• Composable secure multi-client delegated quantum computation
• Fault tolerant quantum data locking
• Quantum computational universality of hypergraph states with Pauli-X and Z basis measurements
• Tripartite Blind Quantum Computation
• Two-Server Oblivious Transfer for Quantum Messages
• Quantum-enhanced Secure Delegated Classical Computing
• Towards practical secure delegated quantum computing with semi-classical light
• Quantum security computation on shared secrets
• Impossibility of blind quantum sampling for classical client
• Heralded photonic graph states with inefficient quantum emitters
• Blind quantum computation with completely classical client and a trusted center
• Measurement-based quantum computation cannot avoid byproducts
• Blind quantum computing with different qudit resource state architectures
• Gate Teleportation-based Universal Blind Quantum Computation
• Teleportation-based quantum homomorphic encryption scheme with quasi-compactness and perfect security