Recognition: unknown
Quantum statistical zero-knowledge
read the original abstract
In this paper we propose a definition for (honest verifier) quantum statistical zero-knowledge interactive proof systems and study the resulting complexity class, which we denote QSZK. We prove several facts regarding this class that establish close connections between classical statistical zero-knowledge and our definition for quantum statistical zero-knowledge, and give some insight regarding the effect of this zero-knowledge restriction on quantum interactive proof systems.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Quantum state isomorphism problems for groups
Quantum state isomorphism under group actions is BQP-hard for pure states across nontrivial groups and QSZK-complete for mixed states with finite groups; Pauli group version is BQP-complete and Clifford is GI-hard, ru...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.