TY - JOUR
T1 - A successive approximation method for quantum separability
AU - Han, Deren
AU - Qi, Liqun
PY - 2013/12
Y1 - 2013/12
N2 - Determining whether a quantum state is separable or inseparable (entangled) is a problem of fundamental importance in quantum science and has attracted much attention since its first recognition by Einstein, Podolsky and Rosen [Phys. Rev., 1935, 47: 777] and Schrödinger [Naturwissenschaften, 1935, 23: 807-812, 823-828, 844-849]. In this paper, we propose a successive approximation method (SAM) for this problem, which approximates a given quantum state by a so-called separable state: if the given states is separable, this method finds its rank-one components and the associated weights; otherwise, this method finds the distance between the given state to the set of separable states, which gives information about the degree of entanglement in the system. The key task per iteration is to find a feasible descent direction, which is equivalent to finding the largest M-eigenvalue of a fourth-order tensor. We give a direct method for this problem when the dimension of the tensor is 2 and a heuristic cross-hill method for cases of high dimension. Some numerical results and experiences are presented.
AB - Determining whether a quantum state is separable or inseparable (entangled) is a problem of fundamental importance in quantum science and has attracted much attention since its first recognition by Einstein, Podolsky and Rosen [Phys. Rev., 1935, 47: 777] and Schrödinger [Naturwissenschaften, 1935, 23: 807-812, 823-828, 844-849]. In this paper, we propose a successive approximation method (SAM) for this problem, which approximates a given quantum state by a so-called separable state: if the given states is separable, this method finds its rank-one components and the associated weights; otherwise, this method finds the distance between the given state to the set of separable states, which gives information about the degree of entanglement in the system. The key task per iteration is to find a feasible descent direction, which is equivalent to finding the largest M-eigenvalue of a fourth-order tensor. We give a direct method for this problem when the dimension of the tensor is 2 and a heuristic cross-hill method for cases of high dimension. Some numerical results and experiences are presented.
KW - M-eigenvalue
KW - Quantum system
KW - cross-hill
KW - entanglement
KW - successive approximation
KW - tensor
UR - https://www.scopus.com/pages/publications/84886749664
U2 - 10.1007/s11464-013-0274-1
DO - 10.1007/s11464-013-0274-1
M3 - 文章
AN - SCOPUS:84886749664
SN - 1673-3452
VL - 8
SP - 1275
EP - 1293
JO - Frontiers of Mathematics in China
JF - Frontiers of Mathematics in China
IS - 6
ER -