pith. sign in

arxiv: 1306.2724 · v1 · pith:5FH5A53Vnew · submitted 2013-06-12 · 🪐 quant-ph

Efficient universal blind computation

classification 🪐 quant-ph
keywords computationpartycomputationalquantumblindefficientprotocolsecond
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.