C
Entangled quantum states are an important component of quantum computing techniques such as quantum error-correction, dense coding and quantum teleportation. We determine the requirements for a state in the Hilbert space ⊗ Cnfor m, n ∈ N to be entangled and a solution to the corresponding “factorization” problem if this is not the case.We consider the implications of these criteria for computer algebra applications.


Comments (0)