[1] Lo, H.K., Popescu, S., Spiller, T.: Introduction to Quantum Computation and Information. World Scientific, Singapore (1998)
[2] Einstein, A., Podolsky, B., Rosen, N.: Can quantum-mechanical description of physical reality be considered complete? Phys. Rev. 47(10), 696-702(1935)
[3] Horodecki, R., Horodecki, P., Horodecki, M., et al.: Quantum entanglement. Rev. Mod. Phys. 81(2), 865-942(2009)
[4] Hamma, A., Santra, S., Zanardi, P.: Quantum entanglement in random physical states. Phys. Rev. Lett. 109(4), 040502(2012)
[5] Cleve, R., Van Dam,W., Nielsen,M., et al.: Quantum entanglement and the communication complexity of the inner product function. Nash International Conference on Quantum Computing and Quantum Communications 1509, 61-74(1999)
[6] Rossi, M., BruB D., Macchiavello, C.: Scale invariance of entanglement dynamics in Grover’s quantum search algorithm. Phys. Rev. A 87(2), 022331(2013)
[7] Han, D., Qi, L.: A successive approximation method for quantum separability. Front. Math. China 8(6), 1275-1293(2013)
[8] Shimony, A.: Degree of entanglement. Ann. N. Y. Acad. Sci. 755(1), 675-679(1995)
[9] Wei, T.C., Goldbart, P.M.: Geometric measure of entanglement and applications to bipartite and multipartite quantum states. Phys. Rev. A 68(4), 4343-4349(2003)
[10] Hu, S., Qi, L., Zhang, G.: The geometric measure of entanglement of pure states with nonnegative amplitudes and the spectral theory of nonnegative tensors. (2012) https://arxiv.org/pdf/1203.3675.pdf
[11] Ni, G., Qi, L., Bai, M.: Geometric measure of entanglement and U-eigenvalues of tensors. SIAM J. Matrix Anal. Appl. 35(1), 73-87(2014)
[12] Ni, G., Bai, M.: Spherical optimization with complex variablesfor computing US-eigenpairs. Comput. Optim. Appl. 65(3), 799-820(2016)
[13] Hayashi, M., Markham, D., Murao, M., et al.: The geometric measure of entanglement for a symmetric pure state with non-negative amplitudes. J. Math. Phys. 50(12), 122104(2009)
[14] Qi, L.: The Minimum hartree value for the quantum entanglement problem (2012) https://arxiv.org/pdf/1202.2983.pdf
[15] Zhang, X., Qi, L.: The quantum eigenvalue problem and Z-eigenvalues of tensors. Mathematics (2012)
[16] Fu, T., Jiang, B., Li, Z.: On decompositions and approximations of conjugate partial-symmetric complex tensors. Calcolo 58(2021)
[17] Nie, J., Wang, L.: Semidefinite relaxations for best rank-1 tensor approximations. SIAM J. Matrix Anal. Appl. 35(3), 1155-1179(2014)
[18] Che, M., Cichocki, A., Wei, Y.: Neural networks for computing best rank-one approximations of tensors and its applications. Neurocomputing 267, 114-133(2017)
[19] Hua, B., Ni, G.Y., Zhang, M.S.: Computing geometric measure of entanglement for symmetric pure states via the Jacobian SDP relaxation technique. J. Oper. Res. Soc. China 5(1), 111-121(2017)
[20] Che, M., Qi, L., Wei, Y.: Iterative algorithms for computing US-and U-eigenpairs of complex tensors. J. Comput. Appl. Math. 317, 547-564(2017)
[21] Bai, M., Zhao, J., Zhang, Z.H.: A descent cautious BFGS method for computing US-eigenvalues of symmetric complex tensors. J. Glob. Optim. 76(4), 889-911(2019)
[22] Sorber, L., Barel, M.V., Lathauwer, L.D.: Unconstrained optimization of real functions in complex variables. SIAM J. Optim. 22(3), 879-898(2012)
[23] Jiang, B., Li, Z., Zhang, S.: Approximation methods for complex polynomial optimization. Comput. Optim. Appl. 59(1-2), 219-248(2014)
[24] Remmert, R.: Theory of complex functions. Graduate in Texts Mathematics 122(4), 379-399(1991)
[25] Kreutz-Delgado, K.: The complex gradient operator and the CR-calculus, Mathematics (2009) https:// arxiv.org/pdf/0906.4835.pdf
[26] Absil, P.-A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton, N.J. (2008)
[27] Absil, P.-A., Bake, C.G., Gallivan, K.A.: Trust-Region Methods on Riemannian Manifolds. Found. Comput. Math. 7(3), 303-330(2007)
[28] Hu, J., Milzarek, A., Wen, Z., Yuan, Y.: Adaptive regularized Newton method for Riemannian optimization. SIAM J. Matrix Anal. Appl. 39(3), 1181-1207(2018)
[29] Zhao, X., Bai, M., Ng, M.K.: Nonconvex optimization for robust tensor completion from Grossly sparse observations. J. Sci. Comput. 85, 46(2020)
[30] Qiu, D., Bai, M., Ng, M.K.: Zhang X, Nonlocal robust tensor recovery with nonconvex regularization. Inverse Probl. 37(2021)
[31] Rockafellar, R.T., Wets, R.J.: Variational Analysis. Springer Verlag, Berlin (2009)
[32] Clarke, F.H.: Optimization and Nonsmooth Analysis, 2nd edn. SIAM, Philadelphia (1990)
[33] Xu, Z., Zhang, H., Xu, Y., et al.: A Unified Single-loop Alternating Gradient Projection Algorithm for Nonconvex-Concave and Convex-Nonconcave Minimax Problems. Math. Program. 201, 635-706(2023)
[34] Jin, C., Netrapalli, P., Jordan, M.I.: What is Local Optimality in Nonconvex-Nonconcave Minimax Optimization? In: Proceedings of the 37th International Conference on Machine Learning (ICML’20), JMLR.org, Article 453, pp. 4880-4889(2020)
[35] Huang, W., Absil, P.-A., Gallivan, K.A., Hand, P.: ROPTLIB: an object-oriented C++ library for optimization on Riemannian manifolds. ACM Trans. Math. Softw. 44(4), 43(2018)
[36] Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, New York (2006) |
