Projects per year
Abstract
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 nonuniversal 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 nonuniversal scheme with a given underlying graph.
Original language  English 

Article number  145306 
Pages (fromto)  125 
Number of pages  25 
Journal  Journal of Physics A: Mathematical and Theoretical 
Volume  50 
Issue number  14 
Early online date  2 Feb 2017 
DOIs  
Publication status  Published  8 Mar 2017 
Fingerprint Dive into the research topics of 'Optimised resource construction for verifiable quantum computation'. Together they form a unique fingerprint.
Projects
 2 Finished


UK Quantum Technology Hub: NQIT  Networked Quantum Information Technologies
1/12/14 → 30/11/19
Project: Research