Optimised resource construction for verifiable quantum computation - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Physics A: Mathematical and Theoretical Année : 2017

Optimised resource construction for verifiable quantum computation

Résumé

Recent developments have brought 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 a small extra cost). Furthermore our construction is generic and could be applied to any universal or non-universal scheme with a given underlying graph.

Dates et versions

hal-02164566 , version 1 (25-06-2019)

Identifiants

Citer

Elham Kashefi, Petros Wallden. Optimised resource construction for verifiable quantum computation. Journal of Physics A: Mathematical and Theoretical, 2017, 50 (14), pp.145306. ⟨10.1088/1751-8121/aa5dac⟩. ⟨hal-02164566⟩
22 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More