Quantum statistical zero-knowledge

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.

(25 pages)

References in corpus (4)

• Simple Proof of Security of the BB84 Quantum Key Distribution Protocol
• Strengths and Weaknesses of Quantum Computing
• Unconditionally secure quantum bit commitment is impossible
• Complexity limitations on quantum computation

Cited by in corpus (11)

• Strong bound between trace distance and Hilbert-Schmidt distance for low-rank states
• The next stage: quantum game theory
• Sub-Quantum Fisher Information
• Generalized Measure of Quantum Fisher Information
• Consistency of Local Density Matrices is QMA-complete
• Variational Quantum Cloning: Improving Practicality for Quantum Cryptanalysis
• Computational Distinguishability of Quantum Channels
• Oracle Separations for Quantum Statistical Zero-Knowledge
• Quantum State Isomorphism
• Quantum Commitments from Complexity Assumptions
• Quantum Optimization Problems