A simple protocol for verifiable delegation of quantum computation in one round
The importance of being able to verify quantum computation delegated to remote servers increases with recent development of quantum technologies. In some of the proposed protocols for this task, a client delegates her quantum computation to non-communicating servers in multiple rounds of communication. In this work, we propose the first protocol where the client delegates her quantum computation to two servers in one-round of communication. Another advantage of our protocol is that it is conceptually simpler than previous protocols. The parameters of our protocol also make it possible to prove security even if the servers are allowed to communicate, but respecting the plausible assumption that information cannot be propagated faster than speed of light, making it the first relativistic protocol for quantum computation.
|Keywords||Delegation of quantum computation, Quantum computation, Quantum cryptography|
|Series||Leibniz International Proceedings in Informatics|
|Conference||International Colloquium on Automata, Languages and Programming|
Grilo, A.B. (2019). A simple protocol for verifiable delegation of quantum computation in one round. In International Colloquium on Automata, Languages, and Programming (pp. 28:1–28:13). doi:10.4230/LIPIcs.ICALP.2019.28