Projects per year
Recent developments brings the possibility of achieving scalable quantum networks and quantum devices closer. From the computational point of view these emerging technologies become relevant when they are no longer classically simulatable. Hence a pressing challenge is the construction of practical methods to verify the correctness of the outcome produced by universal or non-universal quantum devices. A promising approach that has been extensively explored is the scheme of verification via encryption through blind quantum computation. We present here a new construction that simplifies the required resources for any such verifiable protocol. We obtain an overhead that is linear in the size of the input (computation), while the security parameter remains independent of the size of the computation and can be made exponentially small (with small extra cost). Furthermore our construction is generic and could be applied to any universal or non-universal scheme with a given underlying graph.
|Number of pages||25|
|Journal||Journal of Physics A: Mathematical and Theoretical|
|Early online date||2 Feb 2017|
|Publication status||Published - 8 Mar 2017|