Computing geometric measure of entanglement for symmetric pure states via the Jacobian SDP relaxation technique
DOI10.1007/S40305-016-0135-1zbMATH Open1371.65033OpenAlexW2522285031MaRDI QIDQ2014679FDOQ2014679
Authors: Bing Hua, Guyan Ni, Meng-Shi Zhang 
Publication date: 25 August 2017
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-016-0135-1
Recommendations
- Calculating entanglement eigenvalues for nonsymmetric quantum pure states based on the Jacobian semidefinite programming relaxation method
- The geometric measure of entanglement of multipartite states and the \(Z\)-eigenvalue of tensors
- Geometric measure of entanglement and U-eigenvalues of tensors
- The geometric measure of multipartite entanglement and the singular values of a hypermatrix
- On the geometric measure of entanglement for pure states
numerical examplespolynomial optimizationquantum entanglementsymmetric tensorssemidefinite programming (SDP)geometric measureunitary symmetric eigenvalue
Numerical mathematical programming methods (65K05) Multilinear algebra, tensor calculus (15A69) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Semidefinite programming (90C22) Quantum coherence, entanglement, quantum correlations (81P40)
Cites Work
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Tensor Decompositions and Applications
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Eigenvalues of a real supersymmetric tensor
- Global optimization with polynomials and the problem of moments
- Z-eigenvalue methods for a global polynomial optimization problem
- On motivating the Mitchell-Todd modification of Karmarkar's algorithm for LP problems with free variables
- On the best rank-1 approximation of higher-order supersymmetric tensors
- Shifted power method for computing tensor eigenpairs
- GloptiPoly 3: moments, optimization and semidefinite programming
- An exact Jacobian SDP relaxation for polynomial optimization
- The best rank-1 approximation of a symmetric tensor and related spherical optimization problems
- On the best rank-1 approximation to higher-order symmetric tensors
- Rank-one approximation to high order tensors
- Finding the extreme \(Z\)-eigenvalues of tensors via a sequential semidefinite programming method.
- An unconstrained optimization approach for finding real eigenvalues of even order symmetric tensors
- Geometric measure of entanglement and U-eigenvalues of tensors
- All Real Eigenvalues of Symmetric Tensors
- The hierarchy of local minimums in polynomial optimization
- Spherical optimization with complex variables for computing US-eigenpairs
Cited In (7)
- Pseudospectra localizations for generalized tensor eigenvalues to seek more positive definite tensors
- Calculating entanglement eigenvalues for nonsymmetric quantum pure states based on the Jacobian semidefinite programming relaxation method
- An alternative steepest direction method for the optimization in evaluating geometric discord
- Low Rank Symmetric Tensor Approximations
- Iterative methods for computing U-eigenvalues of non-symmetric complex tensors with application in quantum entanglement
- Symmetric Tensor Nuclear Norms
- \texttt{libCreme}: an optimization library for evaluating convex-roof entanglement measures
Uses Software
This page was built for publication: Computing geometric measure of entanglement for symmetric pure states via the Jacobian SDP relaxation technique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014679)
