A hybrid universal blind quantum computation

• Published in: Information sciences 2019-09, Vol.498, p.135-143
• Main Authors: Zhang, Xiaoqian, Luo, Weiqi, Zeng, Guoqiang, Weng, Jian, Yang, Yaxi, Chen, Minrong, Tan, Xiaoqing
• Format: Article
• Language: English
• Subjects: Blind quantum computation (BQC); Blindness; Circuit-based BQC model; Measurement-based BQC model; Verifiability
• ISSN: 0020-0255; 1872-6291
• DOI: 10.1016/j.ins.2019.05.057

•Our protocol has a stronger privacy for big data since all quantum inputs and algorithms are encrypted by one-time-pad both in measurement-based process and circuit-based process. It is the reason that our protocol is called ‘blind’.•Our protocol first mergers two processes: measurement-based process and circuit-based process. The cluster states only need to realize entangled gates determinately, so we don’t need a large-scale entangled state.•In our protocol, Alice has less workload than others since she only needs to measure trap qubits appearing in the final column of the graph state in Fig. 4. Therefore, our protocol can tackle the two problems theoretically: generating a large-scale entangled state in experiment and realizing the probabilistically successful entangled gates. In blind quantum computation (BQC), a client delegates her quantum computation to a server with universal quantum computers who learns nothing about the client’s private information. In measurement-based BQC model, entangled states are generally used to realize quantum computing. However, to generate a large-scale entangled state in experiment becomes a challenge issue. In circuit-based BQC model, single-qubit gates can be realized precisely, but entangled gates are probabilistically successful. This remains a challenge to realize entangled gates with a deterministic method in some systems. To solve above two problems, we propose the first hybrid universal BQC protocol based on measurements and circuits, where the client prepares single-qubit states and the server performs universal quantum computing. We analyze and prove the correctness, blindness and verifiability of the proposed protocol.