×

Highly entangled tensors. (English) Zbl 1495.15037

Positive definite Hermitian forms defined on Hilbert spaces \(V_1,\dots,V_k\) naturally extend to an inner product \(\langle \cdot, \cdot \rangle\) defined on the tensor space thereof, \(V_1\otimes \dots \otimes V_k\). Needless to say, this inner product induces a norm \(\| v \| := \sqrt{\langle v, v \rangle}\). Quantum physics characterizes unit norm tensors as pure quantum states; one such state is called separable if it corresponds to a simple tensor \(T=v_1\otimes \dots \otimes v_k\), and entangled if it corresponds to a tensor of higher rank \(\sum_i' v_{i,1}\otimes \dots \otimes v_{i,k}\).
Entanglement has consistently appeared to be a major actor in the qualitative evolution experienced by quantum algorithms. Thus its study, and particularly its measure, is germane to a variety of current fields in the theory of computation. The present paper addresses two such entanglement measures, linked to two mutually dual non-Euclidean norms: the spectral norm \(\| T \|_\sigma := \max_{\| v \|=1} |\langle T, v \rangle|\), and the nuclear norm \(\| T \|_\star := \min_{T=\sum v_i} \|v_i\|\), its defining gamut restricted to simple tensors \(v_i\). The two measures studied here are \(E( T):=-2\log_2(\|T\|_\sigma)\) and \(F( T):=2\log_2(\|T\|_\star)\), but most of the emphasis is placed on the first one.
The paper lays out its specific setting \(V_1=\dots = V_k = \mathbb{C}^n\) in Section 1.1 and states its first main results, namely an upper bound on \(C^2\) (\(C\) being the minimal spectral norm among unit-norm tensors \(T\in (\mathbb{C}^n)^{\otimes k}\)), and an upper bound on the fraction of unit tensors \(T\) in \((\mathbb{C}^n)^{\otimes k}\) satisfying a certain inequality involving \(E(T)\). These improve results from earlier works and help cement the notion that high entanglement is predominant. Such measure-derived predominance, however, does not guarantee the finding of an explicit tensor with high entanglement, and such construction is indeed an extremely testing and mostly unresolved task in a number of well-known open problems.
Once the challenge of constructing explicit tensors with large entanglement is established, one first example is provided, namely the classical determinant tensor, which, while objectively displaying high entanglement itself, falls short of the earlier bound provided by the paper itself. This can also be considered to be a main result, albeit one that is more specific and somehow set apart from those in Section 1.1.
Yet another main result is stated immediately thereafter in the next section, arising from the action of the symmetric group \(\mathfrak{S}_m\) on \(V:=(\mathbb{C}^n)^{\otimes m}\) given by tensor factor permutation and the resulting symmetric product \(\mathrm{Sym}^m(\mathbb{C}^n) \subsetneq (\mathbb{C}^n)^{\otimes m}\). The focus is restricted to symmetric tensors of length one, \(T\in S_1:=\mathrm{Sym}_1^m(\mathbb{C}^n)\), and the maximum entanglement \(E^s_{\max}:=\max \{ E(T) : T\in S_1\}\) is stated to have certain useful lower bounds.
The authors then proceed to pave the ground for the proofs of their main results. On the set of unit-norm tensors in \((\mathbb{C}^n)^{\otimes k}\cong \mathbb{C}^{n^k}\), which is nothing but the Euclidean sphere \(\mathbb{S}^{2n^k-1}\), certain subsets named \(\varepsilon\)-balls are defined in terms of the inner product, and important properties of the volume of said balls are proved. This in turn leads to lower bounds on the inner product as well as an upper bound on the cardinality of any covering of \(\mathbb{S}^{2n^k-1}\) by \(\varepsilon\)-balls, depending solely on \(\varepsilon\) and \(n\).
The aforementioned main results are then proved. The ancillary results leading to them are a lower bound on the inner product of arbitrary \(T\in \mathbb{S}^{2n^k-1}\) with some choice of centers of \(\varepsilon\)-balls in a covering of \(\mathbb{S}^{2n^k-1}\), a proof that said choice suffices for an alternative covering of the same sphere, and an inequality relating all the major constants involved in the problem. Once this is all settled, the main proofs follow in this and the next sections: the proofs of the main bounds, the proof that the determinant tensor shows high entanglement and the proofs of the upper bounds on norms of symmetric tensors of length one.

MSC:

15A69 Multilinear algebra, tensor calculus
26B15 Integration of real functions of several variables: length, area, volume
47A05 General (adjoints, conjugates, products, inverses, domains, ranges, etc.)
47A30 Norms (inequalities, more than one norm, etc.) of linear operators
81P40 Quantum coherence, entanglement, quantum correlations
81P15 Quantum measurement theory, state operations, state preparations

References:

[1] Amico, L.; Fazio, R.; Osterloh, A., Entanglement in many-body systems, Rev Mod Phys, 80, 517-576 (2008) · Zbl 1205.81009 · doi:10.1103/RevModPhys.80.517
[2] Horodecki, R.; Horodecki, P.; Horodecki, M., Quantum entanglement, Rev Mod Phys, 81, 865-942 (2009) · Zbl 1205.81012 · doi:10.1103/RevModPhys.81.865
[3] Plenio, MB, Virmani, SS.An introduction to entanglement theory. In: Andersson E, Ohberg P, editors. Quantum information and coherence. Scottish Graduate Series. Cham: Springer, 2014. p. 173-209. · Zbl 1317.81035
[4] Barnum, H.; Linden, N., Monotones and invariants for multi-particle quantum states, J Phys A, 34, 35, 6787-6805 (2001) · Zbl 1008.81006 · doi:10.1088/0305-4470/34/35/305
[5] Shimony, A.Degree of entanglement. Fundamental problems in quantum theory (Baltimore, MD, 1994). New York: New York Acad. Sci.; 1995. p. 675-679. (Ann. New York acad. sci.; 755).
[6] Wei, T.; Goldbart, PM., Geometric measure of entanglement and applications to bipartite and multipartite quantum states, Phys Rev A, 68 (2003) · doi:10.1103/PhysRevA.68.042307
[7] Gross, D.; Flammia, ST; Eisert, J., Most quantum states are too entangled to be useful as computational resources, Phys Rev Lett, 102 (2009) · doi:10.1103/PhysRevLett.102.190501
[8] Friedland, S.; Kemp, T., Most Boson quantum states are almost maximally entangled, Proc Amer Math Soc, 146, 12, 5035-5049 (2018) · Zbl 1406.81012 · doi:10.1090/proc/13933
[9] Friedland, S.; Ottaviani, G., The number of singular vector tuples and uniqueness of best rank one approximation of tensors, Found Comput Math, 14, 6, 1209-1242 (2014) · Zbl 1326.15036 · doi:10.1007/s10208-014-9194-z
[10] Nie, J.; Wang, L., Semidefinite relaxations for best rank-1 tensor approximations, SIAM J Matrix Anal Appl, 35, 1155-1179 (2014) · Zbl 1305.65134 · doi:10.1137/130935112
[11] Yuan, M, Zhang, C-H.On tensor completion via nuclear norm minimization. 2014. arXiv:1405.1773 [stat.ML]. · Zbl 1378.90066
[12] Friedland, S.; Lim, LH., The computational complexity of duality, SIAM J Optim, 26, 4, 2378-2393 (2016) · Zbl 1353.65144 · doi:10.1137/16M105887X
[13] Friedland, S.; Lim, LH., Nuclear norm of higher-order tensors, Math Comput, 87, 311, 1255-1281 (2018) · Zbl 1383.15018 · doi:10.1090/mcom/3239
[14] Nie, J., Symmetric tensor nuclear norms, SIAM J Appl Algebra Geom, 1, 1, 599-625 (2017) · Zbl 1372.15023 · doi:10.1137/16M1083384
[15] Derksen, H, Friedland, S, Lim, LH, et al. Theoretical and computational aspects of entanglement. 2017. arXiv:1705.07160 [quant-ph].
[16] Qi, L.; Zhang, G.; Ni, G., How entangled can a multi-party system possibly be?, Phys Lett A, 382, 22, 1465-1471 (2018) · Zbl 1428.81030 · doi:10.1016/j.physleta.2018.04.007
[17] Derksen, H., On the nuclear norm and the singular value decomposition of tensors, Found Comput Math, 16, 3, 779-811 (2016) · Zbl 1343.15016 · doi:10.1007/s10208-015-9264-x
[18] Banach, S., Über homogene polynome in \((####)\), Studia Math, 7, 36-44 (1938) · JFM 64.0376.02 · doi:10.4064/sm-7-1-36-44
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.