  In [1], it is shown that the simultaneous identification capacity region for
the discrete, memoryless, classical-quantum multiple access channel is equal to
the transmission capacity region for codes using a deterministic encoding
scheme. Here, we use transmission codes with a stochastic encoding scheme and
show that the analogous capacity theorem holds. Further, by using stochastic
encoders, the proof of achievability is highly simplified.
