Self-guaranteed measurement-based quantum computation
Masahito Hayashi, Michal Hajdusek

TL;DR
This paper introduces a self-guaranteed verification protocol for measurement-based quantum computation that does not rely on trusted devices, enabling secure delegated quantum computing with scalable overhead.
Contribution
It presents a novel self-testing approach for verifying quantum resources and operations without prior trust, applicable to measurement-based quantum computation.
Findings
Verifies initial entangled resource without trusted devices
Enables secure delegated quantum computation
Overhead scales polynomially with resource size
Abstract
In order to guarantee the output of a quantum computation, we usually assume that the component devices are trusted. However, when the total computation process is large, it is not easy to guarantee the whole system when we have scaling effects, unexpected noise, or unaccounted correlations between several subsystems. If we do not trust the measurement basis nor the prepared entangled state, we do need to be worried about such uncertainties. To this end, we proposes a "self-guaranteed" protocol for verification of quantum computation under the scheme of measurement-based quantum computation where no prior-trusted devices (measurement basis nor entangled state) are needed. The approach we present enables the implementation of verifiable quantum computation using the measurement-based model in the context of a particular instance of delegated quantum computation where the server prepares…
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.
