Multi-server Blind Quantum Computation Protocol With Limited Classical Communication Among Servers
Yuichi Sano

TL;DR
This paper introduces a multi-server blind quantum computation protocol that remains secure even if some servers communicate after the computation, using dummy gates and brickwork state modeling to enhance security.
Contribution
It extends existing two-server blind quantum protocols to multiple servers with limited classical communication, ensuring security despite post-computation server communication.
Findings
Protocol remains secure with server communication after computation
Uses dummy gates and brickwork state modeling for security
Supports multiple servers in blind quantum computation
Abstract
A user who does not have a quantum computer but wants to perform quantum computations may delegate his computation to a quantum cloud server. In order that the delegation works, it must be assured that no evil server can obtain any important information on the computation. The blind protocol was proposed as a way for the user to protect his information from the unauthorized actions of the server. Among the blind protocols proposed thus far, a protocol with two servers sharing entanglement, while it does not require to a user any quantum resource, does not allow the servers to communicate even after the computation. In this paper, we propose a protocol, by extend this two-server protocol to multiple servers, which remains secure even if some servers communicate with each other after the computation. Dummy gates and a circuit modeled after brickwork states play a crucial role in the new…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
