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(Jlog(2)(N)) single-qubit states, where J is the computational depth and N is the number of qubits needed for the computation.
|Titolo:||Efficient Universal Blind Quantum Computation|
|Data di pubblicazione:||2013|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1103/PhysRevLett.111.230501|
|Parole Chiave:||KEY DISTRIBUTION; UNCONDITIONAL SECURITY; CRYPTOGRAPHY; INFORMATION; PROTOCOL; PROOF|
|Appare nelle tipologie:||1.1 Articolo in rivista|