文章基本信息

标题：Blindness and Verification of Quantum Computation with One Pure Qubit
本地全文：下载
作者：Theodoros Kapourniotis ; Elham Kashefi ; Animesh Datta 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2014
卷号：27
页码：176-204
DOI：10.4230/LIPIcs.TQC.2014.176
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：While building a universal quantum computer remains challenging, devices of restricted power such as the so-called one pure qubit model have attracted considerable attention. An important step in the construction of these limited quantum computational devices is the understanding of whether the verification of the computation within these models could be also performed in the restricted scheme. Encoding via blindness (a cryptographic protocol for delegated computing) has proven successful for the verification of universal quantum computation with a restricted verifier. In this paper, we present the adaptation of this approach to the one pure qubit model, and present the first feasible scheme for the verification of delegated one pure qubit model of quantum computing.
关键词：Delegated Computing; Verification; Measurement-based Model