Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/8015
Title: A successive approximation method for quantum separability
Authors: Han, D
Qi, L 
Keywords: Cross-hill
Entanglement
M-eigenvalue
Quantum system
Successive approximation
Tensor
Issue Date: 2013
Source: Frontiers of mathematics in China, 2013, v. 8, no. 6, p. 1275-1293 How to cite?
Journal: Frontiers of Mathematics in China 
Abstract: 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.
URI: http://hdl.handle.net/10397/8015
ISSN: 1673-3452
DOI: 10.1007/s11464-013-0274-1
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

3
Last Week
0
Last month
0
Citations as of Jun 23, 2017

WEB OF SCIENCETM
Citations

3
Last Week
0
Last month
0
Citations as of Jun 24, 2017

Page view(s)

27
Last Week
3
Last month
Checked on Jun 25, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.