 It's described by the density matrix formula_3, where I is the identity matrix.In computational complexity theory, DCQ1; also known as the Deterministic quantum computation with one clean qubit is the class of decision problems solvable by a one clean qubit machine in polynomial time with an error probability of at most 1/3 for all instances.Trace estimation is complete for DCQ1.