Classical zero-knowledge arguments for quantum computations

Thomas Vidick; Tina Zhang

doi:10.22331/q-2020-05-14-266

Classical zero-knowledge arguments for quantum computations

Research output: Contribution to journal › Article › peer-review

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).

Original language	English
Journal	Quantum
Volume	4
DOIs	https://doi.org/10.22331/q-2020-05-14-266
State	Published - 14 May 2020
Externally published	Yes

All Science Journal Classification (ASJC) codes

Atomic and Molecular Physics, and Optics
Physics and Astronomy (miscellaneous)

Access to Document

10.22331/q-2020-05-14-266

https://arxiv.org/abs/1902.05217License: Other

Cite this

@article{4abce2e9601249529e3711c074bfd8b3,

title = "Classical zero-knowledge arguments for quantum computations",

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).",

author = "Thomas Vidick and Tina Zhang",

note = "Publisher Copyright: {\textcopyright} Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften.",

year = "2020",

month = may,

day = "14",

doi = "10.22331/q-2020-05-14-266",

language = "الإنجليزيّة",

volume = "4",

journal = "Quantum",

issn = "2521-327X",

publisher = "Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften",

}

TY - JOUR

T1 - Classical zero-knowledge arguments for quantum computations

AU - Vidick, Thomas

AU - Zhang, Tina

PY - 2020/5/14

Y1 - 2020/5/14

N2 - 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).

AB - 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).

UR - http://www.scopus.com/inward/record.url?scp=85091982877&partnerID=8YFLogxK

U2 - 10.22331/q-2020-05-14-266

DO - 10.22331/q-2020-05-14-266

M3 - مقالة

SN - 2521-327X

VL - 4

JO - Quantum

JF - Quantum

ER -

Classical zero-knowledge arguments for quantum computations

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this