We give the mathematical theory of duality computer in the density matrix formalism. This result complements the mathematical theory of duality computer of Gudder in the pure state formalism.
We reformulate the duality computer concept from thorough mathematical viewpoint, using the bra/ket formalism. We interpret the main objects divider and combiner, as some analogs of polyadic coproduct and polyadic product. The construction of a duality computer is presented in our new interpretation based on analogy with a convolution product in polyadic Hopf algebra theory. The higher generalization of duality computer based on polyadic powers is proposed. The corresponding simulation procedure of duality computer on the ordinary quantum computer is given using the introduced polyadic generalization.