Classical zero-knowledge arguments for quantum computations

Thomas Vidick; Tina Zhang

REVIEW

Classical zero-knowledge arguments for quantum computations

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1902.05217 v4 pith:KTIE4FK6 submitted 2019-02-14 quant-ph

Thomas Vidick , Tina Zhang This is my paper · ORCID

classification quant-ph

keywords quantumzero-knowledgeclassicalsystemargumentfocsintroducedlanguages

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

read the original abstract

We show that every language in QMA admits a classical-verifier, quantum-prover zero-knowledge argument system which is sound against quantum polynomial-time provers and zero-knowledge for classical (and quantum) polynomial-time verifiers. The protocol builds upon two recent results: a computational zero-knowledge proof system for languages in QMA, with a quantum verifier, introduced by Broadbent et al. (FOCS 2016), and an argument system for languages in QMA, with a classical verifier, introduced by Mahadev (FOCS 2018).

Discussion (0). Continue with ORCID to comment.

Pith tools