Fault-tolerant Operations for Universal Blind Quantum Computation
arXiv:1306.3664 · doi:10.1145/2700248
Abstract
Blind quantum computation is an appealing use of quantum information technology because it can conceal both the client's data and the algorithm itself from the server. However, problems need to be solved in the practical use of blind quantum computation and fault-tolerance is a major challenge. On an example circuit, the computational cost measured in T gates executed by the client is 97 times more than performing the original computation directly, without using the server, even before applying error correction. (The client still benefits due to drastically reduced memory requirements.) Broadbent et al. proposed running error correction over blind computation, but our first protocol applies one layer of Steane's [[7,1,3]] code underneath instead. This protocol has better fault tolerance, but still results in a substantial overhead. We propose another protocol to reduce the client's computational load by transferring the qubit preparation to the server. For each logical qubit used in the computation, the client is only required to receive eight logical qubits via teleportation then buffer two logical qubits before returning one. This protocol also protects the client's fault-tolerant preparation of logical qubits from a side-channel attack.
References in corpus (23)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- The Quantum Internet
- Quantum Computing
- Quantum Communication
- Measurement-based quantum computation with cluster states
- Quantum Error Correction for Quantum Memories
- Fault-tolerant quantum computation with high threshold in two dimensions
- Quantum Networks for Elementary Arithmetic Operations
- Quantum repeaters based on entanglement purification
- Quantum Error Correction for Beginners
- Topological fault-tolerance in cluster state quantum computation
- Experimental Demonstration of Blind Quantum Computing
- Universal blind quantum computation
- Simulating chemistry using quantum computers
- Efficient Networks for Quantum Factoring
- Fast Quantum Modular Exponentiation
- Simulating chemistry efficiently on fault-tolerant quantum computers
- Determinism in the one-way model
- Blind topological measurement-based quantum computation
- Universal Blind Quantum Computing with Weak Coherent Pulses
- Distributed Quantum Computation Architecture Using Semiconductor Nanophotonics
- Interactive Proofs For Quantum Computations
- Ancilla-Driven Universal Blind Quantum Computation
Cited by in corpus (13)
- Photonic quantum information processing: a review
- Unconditionally verifiable blind computation
- Composable security of delegated quantum computation
- Attacking the Quantum Internet
- Quantum link bootstrapping using a RuleSet-based communication protocol
- Surface Code Error Correction on a Defective Lattice
- Flow Ambiguity: A Path Towards Classically Driven Blind Quantum Computation
- Blind quantum computation for a user who only performs single-qubit gates
- The Network Impact of Hijacking a Quantum Repeater
- Simulation of a Dynamic, RuleSet-based Quantum Network
- Quantum delegated and federated learning via quantum homomorphic encryption
- A Remote Quantum Error-correcting Code Preparation Protocol on Cluster State
- Covert Quantum Internet