sentence1: note that such modifications are possible in the case of usual quantum interactive proofs , and we show that this is also the case for honest-verifier quantum computational zero-knowledge proofs .
sentence2: again a similar property is known to hold for usual quantum interactive proofs , and we carefully modify the protocol so that it holds even for the honest-verifier quantum computational zero-knowledge case .