Sumcheck-based delegation of quantum computing to rational server+
نویسندگان
چکیده
Delegated quantum computing enables a client with weak computational power to delegate remote server in such way that the integrity of can be efficiently verified by client. Recently, new model delegated has been proposed, namely, rational computing. In this model, after interacts server, pays reward depending on server's messages and client's random bits. The sends maximize expected value reward. It is known classical universal one round. paper, we propose novel one-round protocols generalizing sumcheck protocol. An advantage our they are gate-set independent: construction previous depends gate sets, while technique easily realized any local set (each whose elementary gates specified polynomial number bits). Furthermore, as protocols, function satisfies natural requirements (the non-negative, upper-bounded constant, its maximum lower-bounded constant). We also discuss gap. Simply speaking, gap minimum loss incurred behavior makes accept an incorrect answer. should therefore large enough incentivize behave optimally. Although sumcheck-based have only exponentially small gaps show constant achieved if two noncommunicating but entangled servers allowed. whether single sufficient under (widely believed) assumption learning-with-errors problem hard for polynomial-time Apart from these results, show, certain condition, equivalence between ordinary protocols. This then serves basis reward-gap amplification method.
منابع مشابه
Client, server based statistical computing
In today’s world, many statistical questions require the use of computationalassistance. Our approach, presented in this thesis, combines the possibilities of the powerful statistical software environment XploRe, with the advantagesof distributed client/server applications, and the opportunities offered by theInternet. In order to offer the client access to a large community, the Ja...
متن کاملIntroduction to Interactive Proofs & The Sumcheck Protocol
Traditional mathematical proofs are static objects: a prover P writes down a sequence of mathematical statements, and then at some later time a verifier V checks that these statements are consistent and correct. Over the years, computer science has changed the notion of a mathematical proof. The first such change was the observation that for all practical purposes, the verification procedure sh...
متن کاملTask Delegation in a Peer-to-Peer Volunteer Computing Platform
The paper reports an effort made for understanding the effect of task delegation policy in a peer-to-peer volunteer computing platform. This effort includes the implementation of a simulation environment and the development of associated analytical models for the analysis of task delegation policies in peer-to-peer computing platforms. Based on the analytical model best and worst task delegatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2022
ISSN: ['1879-2294', '0304-3975']
DOI: https://doi.org/10.1016/j.tcs.2022.04.016