Sumcheck-based delegation of quantum computing to rational server
Yuki Takeuchi, Tomoyuki Morimae, Seiichiro Tani

TL;DR
This paper introduces new one-round rational delegated quantum computing protocols based on sumcheck techniques, allowing flexible gate sets and analyzing reward gaps, including the possibility of constant gaps with entangled servers.
Contribution
It generalizes classical sumcheck protocols to rational quantum settings, enabling flexible gate sets and exploring reward gap amplification with entangled servers.
Findings
Protocols work with any local gate set.
Reward gap can be constant with entangled servers.
Single rational server may be insufficient under certain assumptions.
Abstract
Delegated quantum computing enables a client with weak computational power to delegate quantum computing to a remote quantum server in such a way that the integrity of the server can be efficiently verified by the client. Recently, a new model of delegated quantum computing has been proposed, namely, rational delegated quantum computing. In this model, after the client interacts with the server, the client pays a reward to the server. The rational server sends messages that maximize the expected value of the reward. It is known that the classical client can delegate universal quantum computing to the rational quantum server in one round. In this paper, we propose novel one-round rational delegated quantum computing protocols by generalizing the classical rational sumcheck protocol. The construction of the previous rational protocols depends on gate sets, while our sumcheck technique can…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
