期刊文献+

A successive approximation method for quantum separability 被引量:1

A successive approximation method for quantum separability
原文传递
导出
摘要 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 SchrSdinger [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. 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 SchrSdinger [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.
出处 《Frontiers of Mathematics in China》 SCIE CSCD 2013年第6期1275-1293,共19页 中国高等学校学术文摘·数学(英文)
关键词 Quantum system ENTANGLEMENT TENSOR successive approximation M-eigenvalue cross-hill Quantum system, entanglement, tensor, successive approximation,M-eigenvalue, cross-hill
  • 相关文献

参考文献23

  • 1Bazarra M S,Sherali H D,Shetty C M. Nonlinear Programming:Theory and Algorithms[M].{H}New York:John Wiley & Sons,Inc,1993.
  • 2Cox D,Little J,O'Shea D. Using Algebraic Geometry[M].{H}New York:Springer-Verlag,1998.
  • 3Dahl D,Leinass J M,Myrheim J,Ovrum E. A tensor product matrix approximation problem in quantum physics[J].{H}Linear Algebra and its Applications,2007.711-725.
  • 4Doherty A C,Parrilo P A,Spedalieri F M. Distinguishing separable and entangled states[J].{H}Physical Review Letters,2002.187904.
  • 5Einstein A,Podolsky B,Rosen N. Can quantum-mechanical description of physical reality be considered complete[J].{H}Physical Review,1935.777.
  • 6Gurvits L. Classical deterministic complexity of Edmonds' problem and quantum entanglement[A].New York:ACM,2003.10-19.
  • 7Han D,Dai H,Qi L. Conditions for strong ellipticity of anisotropic elastic materials[J].{H}Journal of Elasticity,2009.1-13.
  • 8Han D,Qi L,Wu Ed. Extreme diffusion values for non-Gaussian diffusions[J].Optim Methods Softw,2008.703-716.
  • 9Horodecki M,Horodecki P,Horodecki R. Separability of mixed states:Necessary and sufficient conditions[J].{H}Physics Letters A,1996.1-8.
  • 10Ioannou L M,Travaglione B C,Cheung D,Ekert K. Improved algorithm for quantum separability and entanglement detection[J].{H}Physical Review A,2004.060303.

同被引文献2

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部