Verifiable Multi‐Party Universal Blind Quantum Computing in Distributed Networks

Blind quantum computing (BQC) ensures that a classical client could delegate complex computing tasks to a remote quantum server safely. In order to detect the dishonest behavior of the participants, we present a verifiable multi‐party universal BQC protocol in distributed networks. By using the stabilizer formalism, we propose an honesty check method to test the correctness of the graph states generated by the servers. The honesty of both the clients and the servers can be judged fairly with the help of the arbitrator. Moreover, a load balancer is introduced to control the possible breakdown of servers in the network. No‐signaling principle ensures the unconditional security of the protocol. Through the use of universal resource states, our protocol can be applied in more multi‐party verifiable universal BQC protocols. The failure management and workload balancing of the protocol also provide a promising prospect for the future BQC network.