  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.
