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.
Received: 2002-3-25
Published Online: 2014-6-2
Published in Print: 2002-8-1
© 1946 – 2014: Verlag der Zeitschrift für Naturforschung
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.
