pith. machine review for the scientific record. sign in

arxiv: 1604.00116 · v1 · submitted 2016-04-01 · 🪐 quant-ph · cs.CR

Recognition: unknown

Publicly Verifiable Blind Quantum Computation

Authors on Pith no claims yet
classification 🪐 quant-ph cs.CR
keywords computationquantumblindpartyuserbenefitprotocolsthird
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Time-Delayed Publicly Verifiable Quantum Computation for Classical Verifiers

    cs.CR 2026-04 unverdicted novelty 6.0

    A non-interactive time-delayed publicly verifiable scheme for quantum computation compiled from private 2-round protocols via time-lock puzzles and commitments, proven secure in the quantum random oracle model with CRS.