Edinburgh Research Explorer

Optimised resource construction for verifiable quantum computation

Research output: Contribution to journalArticle

Related Edinburgh Organisations

Open Access permissions

Open

Documents

Original languageEnglish
Article number145306
Pages (from-to)1-25
Number of pages25
JournalJournal of Physics A: Mathematical and Theoretical
Volume50
Issue number14
Early online date2 Feb 2017
DOIs
StatePublished - 8 Mar 2017

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 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.

Download statistics

No data available

ID: 31548830