Verifiable Blind Quantum Computation based on measurement
Xiaoqian Zhang, Jian Weng, Weiqi Luo, Xiaoqing Tan · arXiv (Cornell University) · 2018
Blind quantum computation (BQC) enables the client, who has the least quantum technologies, to delegate her quantum computation to a server, who has strong quantum computabilities and learns nothing about the client's inputs, outputs, and algorithms. In this article, we propose a new verifiable BQC protocol based on measurement with six-qubit cluster states and eight-qubit entangled states. The BQC scheme reduce the number of qubits compared with BFK protocol. The blindness and correctness are also proved. If Bob is honest, Alice can obtain the correct measurement results. While Bob is dishonest, Bob does not get anything about Alice's secret information. Alice prepares the initial single-qubit states and Bob performs controlled-Z gate to produce the entanglement. Bob returns them to Alice. Alice has trap qubits and the graph of lattice. She can randomly sends trap qubits and qubits in lattice state to Bob. Therefore, Alice's computing angles don't need to flip since Bob is not impossible know anything about the quantum computation. The trap qubtis, which includes two classes:1)randomly rotation single-qubit states;2) randomly chosen from lattice state, have two purposes: 1) confuse Bob to keep the blindness; 2)verify the honesty and correctness of Bob's quantum computing.