Publicly Verifiable Blind Quantum Computation
Kentaro Honda

TL;DR
This paper introduces a new blind quantum computation protocol that allows any third party to verify the correctness of the computation, enhancing trust and security in delegated quantum tasks.
Contribution
It proposes a novel blind quantum computation protocol with public verifiability, enabling third-party verification of the computation's integrity.
Findings
Enables third-party verification of quantum computations.
Maintains user privacy while allowing public verification.
Strengthens security against dishonest participants.
Abstract
Blind quantum computation protocols allow a user with limited quantum technology to delegate an intractable computation to a quantum server while keeping the computation perfectly secret. Whereas in some protocols a user can verify that calculated outcomes are correct, a third party cannot do this, which allows a dishonest user or owner to benefit illegally. I propose a new blind quantum computation protocol with a new property called public verifiability, which enables any third party to assure that a party does not benefit from attempted deception.
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.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Mechanics and Applications · Quantum Computing Algorithms and Architecture
