complexity theory – Is it possible to have a zero knowledge proof with a P Prover?

In the literature, when reading about zero knowledge proofs, the prover (prover/verifier) is always given an unlimited computational power or just capacity to solve NP.

Is it necessary for the prover to have higher computational power than the verifier?

If it is, is there any variant that does not need this property?

If any of the answers is yes can you give me references?