Optimised resource construction for verifiable quantum computation

Recent developments make the possibility of achieving scalable quantum and quantum devices closer. From the computational point of view these technologies become relevant when they are no longer classically. Hence a pressing challenge is the construction of practical to verify the correctness of the outcome produced by universal or-universal quantum devices. A promising approach that has been extensively is the scheme of verification via encryption through blind quantum initiated by Fitzsimons and Kashefi. We present here a new that simplifies the required resources for any such verifiable quantum computating protocol. We obtain an overhead that is linear in the of the input, while the security parameter remains independent of the size the computation and can be made exponentially small. Furthermore our is generic and could be applied to any non-universal scheme with a underlying graph.