It depends upon the computational assumptions — Schnorr's proof of exponent achieves perfect zero knowledge, whereas it achieves only computational soundness as discrete log is a computationally bounded assumption.
And it depends upon the definition of the adversary (i.e computationally bounded or unbounded) — the proof system is either called proof or argument system.
