Efficient universal blind computation
Quantum Physics
2013-12-16 v1
Abstract
We give a cheat sensitive protocol for blind universal quantum computation that is efficient in terms of computational and communication resources: it allows one party to perform an arbitrary computation on a second party's quantum computer without revealing either which computation is performed, or its input and output. The first party's computational capabilities can be extremely limited: she must only be able to create and measure single-qubit superposition states. The second party is not required to use measurement-based quantum computation. The protocol requires the (optimal) exchange of O(J log(N)) single-qubit states, where J is the computational depth and N is the number of qubits needed for the computation.
Cite
@article{arxiv.1306.2724,
title = {Efficient universal blind computation},
author = {Vittorio Giovannetti and Lorenzo Maccone and Tomoyuki Morimae and Terry G. Rudolph},
journal= {arXiv preprint arXiv:1306.2724},
year = {2013}
}