Title :
Operational separability criteria and matrix reorderings
Author_Institution :
Coll. of Comput. Sci. & Eng., Univ. of Electron. Sci. Technol. of China, Chengdu
Abstract :
So far the positive partial transpose (PPT) criterion and the computable cross norm (CCN) criterion are two strongest operational separability criteria of bipartite mixed quantum states. In this paper, we exactly connect the PPT criterion and the CCN criterion with the matrix reorderings found by Poluikis and Hill [J. A. Poluikis and R. D. Hill, Linear Algebra and Its Applications 35: 1-10 (1981)] and Oxenrider and Hill [C. J. Oxenrider and R. D. Hill, Linear Algebra and Its Applications 69: 205-212 (1985)]. Motivated by work by Chen etc. [K. Chen, S. Albeverio, and S.-M. Fei, Physical Review Letters 95, 040504 (2005), Physical Review Letters 95, 210501 (2005)], we compute the trace norm of several bound entangled states and illuminate the equivalence among the elements of group generated by the eight matrix reorderings.
Keywords :
matrix algebra; quantum computing; eight matrix reorderings; matrix reorderings; operational separability criteria; positive partial transpose; Computer science; Educational institutions; Joining processes; Linear algebra; Mathematics; Matrices; Physics computing; Quantum computing; Quantum entanglement; Time measurement; computable cross norm; matrix reorderings; positive partial transpose; quantum computing; quantum entanglement; separability; trace norm;
Conference_Titel :
Cybernetics and Intelligent Systems, 2008 IEEE Conference on
Conference_Location :
Chengdu
Print_ISBN :
978-1-4244-1673-8
Electronic_ISBN :
978-1-4244-1674-5
DOI :
10.1109/ICCIS.2008.4670886