A simplified verifiable blind quantum computing protocol with quantum input verification. Issue 1 (20th January 2021)

• Record Type: Journal Article
• Authors: Quan, Junyu; Li, Qin; Liu, Chengdong; Shi, Jinjing; Peng, Yu
• Is Part Of: Quantum engineering. Volume 3:Issue 1(2021)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2021-01-20
• Subjects: blind quantum computing -- delegated quantum computing -- quantum cryptography; Quantum theory -- Periodicals; Engineering -- Periodicals; Quantum theory; Engineering; Electronic journals; Periodicals; 530.12
• DOI: 10.1002/que2.58
• Languages: English
• ISSNs: 2577-0470

Abstract

Abstract: Blind quantum computing (BQC) enables a client with limited quantum capability to delegate her quantum computation to a remote quantum server and still keeps the client's input, output, and the algorithm private. One important property of BQC is verifiability, which means the client can verify the correctness of the computation or unknown quantum inputs. Recently, Morimae proposed a verifiable blind quantum computing protocol where the client can verify both the correctness of computing and the quantum input. However, the client needs much quantum memory and takes a lot of qubits to get the true result. We reduce the size of quantum memory and the number of qubits used in Morimae's protocol. Besides, we extend the resource state in Morimae's protocol from graph state to hypergraph state. For certain hypergraph states as resources states, such as Union Jack State, the client only needs Pauli measurements in the computation stage but he needs non‐Clifford basis measurements if graph states are considered as resources states.