Scott gives the good answer that at the technical level, EQP is not uniquely defined. However, there are deeper issues of interpreting quantum complexity classes, and deciding which ones are contrived and which ones are natural.
To a computer scientist who first learns finite quantum mechanics, it may look like BQP is to BPP as EQP is to P. That was indeed the motivation for defining EQP. However, the analogy treats quantumness and randomness and separate generalizations of deterministic computation, and this isn't really true. A better viewpoint is that quantumness is a strengthened form of randomness. So the question "BQP is to BPP as (blank) is to P" is like the question "motorcycling is to bicycling as (blank) is to walking". It's a strange question.
The question "BQP is to EQP as BPP is to (blank)" is actually less strange, and my answer would not be P. Rather, you could define "EPP" to be the class of problems where, if the true answer is yes, the algorithm accepts with probability exactly 2/3; if the true answer is no, the algorithm accepts with probability exactly 1/3. This might not be a perfect analogy either, but it does show you how EQP is a contrived combination of probability and exactitude. If you use binary gates, then this definition of EPP is empty! The precise behavior of EPP is depends on algebraic coincidences. In order to have a viable definition (never mind natural), you should either change the probabilities to 1/4 and 3/4 (say), or you should use ternary circuits.
However, it dawned on me once that non-uniform EQP, or EQPn.u.,, is a well-defined complexity class. Because, in the non-uniform setting, you can allow all gates on two qubits. EQPn.u., is not necessarily a natural complexity class, but it isn't particularly less natural than non-uniformity itself. Similarly to a non-uniform classical circuit, you can show that a non-uniform quantum circuit of exponential size can express any unitary operator. A more robust interpretation of Mosca's and Zalka's theorem is that factoring is in EQPn.u.. It is also an interesting question to compare EQPn.u. to BQP/qpoly, and I don't know the answer.
Per Ricky Demer's remark, ZQP as defined in the Complexity Zoo is another EQP-like class that has the same shortcomings. However, I penciled into the Zoo a more interesting operational equivalent of ZPP that I called ZBQP. It's not a great name, but ZQP is already taken. My definition of ZBQP is that a quantum computer produces a certificate for either yes or no that can be checked by a deterministic verifier in polynomial time. And, the quantum computer succeeds in its task in polynomial time with high probability. If you use a classical randomness-enhanced computer instead of a quantum computer, you get the class ZPP. For example, any factoring-related decision question, such as whether a number is square-free, is in ZBQP, and this fact neither implies nor is implied by Mosca-Zalka.