Blind quantum computing can always be made verifiable
arXiv:1803.06624
Abstract
Blind quantum computing enables a client, who does not have enough quantum technologies, to delegate her quantum computing to a remote quantum server in such a way that her privacy is protected against the server. Some blind quantum computing protocols can be made verifiable, which means that the client can check the correctness of server's quantum computing. Can any blind protocol always be made verifiable? In this paper, we answer to the open problem affirmatively. We propose a plug-in that makes any universal blind quantum computing protocol automatically verifiable. The idea is that the client blindly generates Feynman-Kitaev history states corresponding to the quantum circuit that solves client's problem and its complement circuit. The client can learn the solution of the problem and verify its correctness at the same time by measuring energies of local Hamiltonians on these states. Measuring energies of local Hamiltonians can be done with only single qubit measurements of Pauli operators.
arXiv comment5 pages, no figure
References in corpus (22)
- Experimental Demonstration of Blind Quantum Computing
- Unconditionally verifiable blind computation
- Verifiable measurement-only blind quantum computing with stabilizer testing
- Blind quantum computation protocol in which Alice only makes measurements
- Realizable Hamiltonians for Universal Adiabatic Quantum Computers
- Experimental verification of quantum computations
- Universal Blind Quantum Computing with Weak Coherent Pulses
- Post hoc verification of quantum computation
- Post hoc verification with a single prover
- Optimal Blind Quantum Computation
- Efficient universal blind computation
- Demonstration of measurement-only blind quantum computing
- Composable security of delegated quantum computation
- Ancilla-Driven Universal Blind Quantum Computation
- Rigidity of quantum steering and one-sided device-independent verifiable quantum computation
- Secure entanglement distillation for double-server blind quantum computation
- Continuous-variable blind quantum computation
- Verified measurement-based quantum computing with hypergraph states
- Verifiable fault-tolerance in measurement-based quantum computation
- Overcoming efficiency constraints on blind quantum computation
- Measurement-only verifiable blind quantum computing with quantum input verification
- Quantum proofs can be verified using only single qubit measurements