Arbitrable Blind Quantum Computation

TL;DR

This paper introduces an arbitrable blind quantum computation scheme where a third-party arbitrator helps verify whether a quantum server correctly performs delegated quantum computations without revealing sensitive information.

Contribution

It proposes a novel scheme incorporating an arbitrator into blind quantum computation to enhance verification and dispute resolution capabilities.

Findings

Provides a method for third-party arbitration in blind quantum computation

Enhances verification of quantum computations without revealing inputs

Addresses limitations of existing verifiable blind quantum protocols

Abstract

Blind quantum computation is a two-party protocol which involves a server Bob who has rich quantum computational resource and provides quantum computation service and a client Alice who wants to delegate her quantum computation to Bob without revealing her quantum algorithms and her input to (resp., output from) the algorithms. Since Bob may be truant and pretend to execute some computation, Alice wants to verify Bob's computation. Verifiable blind quantum computation enables Alice to check whether Bob is cheating or not. If Bob is cheating and claims his innocence, Alice can refute the denial of Bob's cheating but she cannot persuade any others that Bob is cheating. In this paper, we incorporate arbitrators as the third party into blind quantum computation to resolve the above problem and give an arbitrable blind quantum computation scheme.