Research Article | Open Access

Ion Nechita, "On the Separability of Unitarily Invariant Random Quantum States: The Unbalanced Regime", *Advances in Mathematical Physics*, vol. 2018, Article ID 7105074, 13 pages, 2018. https://doi.org/10.1155/2018/7105074

# On the Separability of Unitarily Invariant Random Quantum States: The Unbalanced Regime

**Academic Editor:**Giorgio Kaniadakis

#### Abstract

We study entanglement-related properties of random quantum states which are unitarily invariant, in the sense that their distribution is left unchanged by conjugation with arbitrary unitary operators. In the large matrix size limit, the distribution of these random quantum states is characterized by their limiting spectrum, a compactly supported probability distribution. We prove several results characterizing entanglement and the PPT property of random bipartite unitarily invariant quantum states in terms of the limiting spectral distribution, in the unbalanced asymptotical regime where one of the two subsystems is fixed, while the other one grows in size.

#### 1. Introduction

In quantum information theory, when one needs to understand properties of* typical* density matrices, it is necessary to endow the convex body of quantum states with a natural, physically motivated probability measure, in order to compute statistics of the relevant quantities. Since the late 1990s, there have been several candidates for such measures: the induced measures [1, 2], the Bures measure [3], or random matrix product states [4], just to name a few.

The induced measures, introduced by Zyczkowski and Sommers [2], but already studied by Page [1], have received the most attention, mainly due to their simplicity and to their natural physical interpretation: a density matrix from the induced ensemble is obtained by tracing an environment system of appropriate dimension out of a random uniform bipartite pure state (the latter being distributed along the Lebesgue measure on the unit sphere of the corresponding complex Hilbert space).

In [5], Aubrun studied bipartite random quantum states from the induced ensemble, and determined which values of the ratio environment size/system size the random states are, with high probability, PPT (i.e., they have a positive semidefinite partial transpose). Aubrun’s idea was developed and generalized in many directions, for other entanglement-related properties and in different asymptotic regimes in the following years [6–13]. One of the most notable results in this framework is the characterization of the* entanglement threshold* from [14], in which the authors determine, up to logarithmic factors, how large should the environment be in order for a random bipartite quantum state from the induced ensemble to be separable.

In this work, we consider random quantum states which have the property that their distribution is left unchanged by conjugation with arbitrary unitary operations; we call them* unitarily invariant*. These distributions are characterized only by their spectrum, and we consider sequences of distributions with the property that their spectra converge towards some compactly supported probability measure on the real line. In particular, the family of distributions we consider generalizes the induced ensemble, which corresponds to a Marčenko-Pastur limiting spectral distribution. We provide conditions such that the quantum state corresponding to a random unitarily invariant matrix will be, with large probability, PPT, separable, or entangled. We shall ask that the conditions be simple and only depend on the asymptotic spectrum of the random matrices. We state now an informal version of some of the main results contained in this paper; we refer the reader to Theorem 10 and Propositions 15 and 23 for the exact results.

Theorem 1. *Let be a sequence of unitarily invariant random matrices converging “strongly” to a compactly supported probability measure ; here, and are fixed. Assume that the limiting spectral measure has average and variance and is supported on the interval . Then, *(i)*if the following condition holds, then sequence is asymptotically PPT: *(ii)*if one of the two following conditions hold, then sequence is asymptotically separable: *(iii)*if the following condition holds, then sequence is asymptotically entangled: *

The paper is organized as follows: Sections 2, 3, and 4 contain facts from the theories of, respectively, unitarily invariant random matrices, free probability, and entanglement, which are used later in the paper. Section 5 contains a strengthening of a result about block-modifications of random matrices which allows us to study the behavior of the extremal eigenvalues of such matrices. Sections 6, 7, and 8 contain the new results of this work, spectral conditions that unitarily invariant random matrices must satisfy in order to, respectively, have the PPT property, to be separable, or to be entangled. Moreover, Section 8 contains results about the asymptotic value the norms introduced by Johnston and Kribs take on unitarily invariant random matrices. Finally, in Section 9, we show that shifted GUE matrices are PPT and have Schmidt number that scales linearly with the dimension of the fixed subsystem in the unbalanced asymptotical regime.

#### 2. Unitarily Invariant Random Matrices and Strong Convergence

In this work, we shall denote by (, resp.) the set of complex matrices (self-adjoint matrices, resp.) and by the group of unitary operators. We shall be concerned with* unitarily invariant* random matrices: these are self-adjoint random matrices having the property that, for any unitary matrix , the random variables and have the same distribution. From the invariance of the Haar distribution on , it follows that, given a deterministic matrix and a Haar-distributed random unitary matrix , the distribution of the random matrix is unitarily invariant; this is the most common construction of unitarily invariant ensembles.

The most well-studied ensembles of random matrices are, without a doubt,* Wigner ensembles* [15]: these are random matrices having independent and identically distributed (i.i.d.) entries, up to the symmetry condition ; see [16, Section 2]. At the intersection of Wigner and unitarily invariant ensembles is the* Gaussian unitary ensemble* (GUE). A random matrix is said to have distribution if its entries are as follows: where are i.i.d. real, centered standard Gaussian random variables.

The celebrated Wigner theorem states that GUE random matrices converge in moments, as towards the semicircle law; see [15].

Theorem 2. *Let be a sequence of GUE random matrices. Then, for all moment orders , we have where are the Catalan numbers and is the semicircular distribution with mean and variance : *

Note that the above theorem only gives partial information about the behavior of the extremal eigenvalues (or about the operator norm) of . For example, convergence in distribution implies that the largest eigenvalue of is at least 2 (which is the maximum of the support of the limit distribution ). The fact that the largest eigenvalue of converges indeed to 2 requires much more work; see [17] for the case of Wigner matrices. In their seminal paper [18], Haagerup and Thorbjørnsen have further generalized these results to polynomials in tuples of GUE matrices and called this phenomenon* strong convergence*.

*Definition 3. *A sequence of -tuples of GUE distributed random matrices is said to* converge strongly* towards a -tuple of noncommutative random variables living in some -noncommutative probability space , if they converge in distribution: for all polynomials in noncommutative variables, and, moreover, for all as above, we also have the convergence of the operator norms:

Collins and Male generalized in [19] the result above to arbitrary unitarily invariant random matrices, by dropping the GUE hypothesis and asking that individual matrices converge strongly to their respective limits ; see [19, Theorem 1.4]. Their result will be crucial to the present paper, since it will allow us to prove that the extremal eigenvalues have indeed the behavior suggested by the convergence in distribution (i.e., they converge to the extrema of the support of the limiting eigenvalue distribution, in the single matrix case ).

#### 3. Some Elements of Free Probability

We recall in this section the main tools from free probability theory needed here. The excellent monographs [20–22] contain detailed presentations of the theory, with emphasis on different aspects.

In free probability theory, noncommutative random variables are seen as abstract elements of some -algebra , equipped with a trace which plays the role of the expectation in classical probability. The notion of distribution of a family of random variables is the set of all evaluations , where runs through all polynomials in noncommutative variables (see also Definition 3). In the case of a single self-adjoint variable , the distribution is given by the sequence of moments The notion of* free cumulants* introduced by Speicher in [23] plays a central role in the theory, in the sense that it characterizes free independence. In the case of a single variable, one can express the moments in terms of the free cumulants by the* moment-cumulant formula*:Above, denotes the set of noncrossing partitions on elements [21], and the free cumulant functional is defined multiplicatively on the blocks of the noncrossing partition :

Let us briefly discuss two examples. First, it is easy to see that the semicircular distribution introduced in Theorem 2 has free cumulants , , while , for all . The vanishing of free cumulants of order 3 and larger characterizes the distribution which appears in the free central limit theorem (exactly as in the classical situation; see [21, Lecture 8]).

Another remarkable family of distributions in free probability theory are the Marčenko-Pastur distributions , where is a positive scalar. The distribution is defined by the very simple property that all its free cumulants are equal to : , . Using the moment-cumulant formula and Stieltjes inversion, one can compute the density of :where and . This density is plotted in Figure 1 for different values of parameter .

With the help of free cumulants, we can introduce the* free additive convolution* of compactly supported probability measures, a notion which will play a key role in what follows. Given two compactly supported probability measures , , define , the free additive convolution of and , as the unique probability measure having free cumulants:For a given measure , one can define iteratively its free additive convolution powers as for any integer . As it was shown by Nica and Speicher in [24], this semigroup extends from positive integers to all real numbers . This semigroup plays an important role in what follows, mainly due to the connection to block-modifications of random matrices (see Section 5); for now, it is important to remember that the measures are characterized by their free cumulants:

It is in general very hard to get a grip on the support of the elements of the free additive convolution semigroup . Although there exist implicit algebraic characterizations of the support of the measures in terms of the support of and , it is only in very simple circumstances that one can write down explicit formulas for the support. We recall below an approximation result obtained in [25, Lemma 2.3 and Theorem 2.4].

Proposition 4. *Let be a probability measure having mean and variance , whose support is contained in the compact interval . Then, for any , we have *

#### 4. The Separability Problem

We review in this section the notions of* separability* and* entanglement* from quantum information theory, as well as several important known results from this field. An excellent review of these notions is [26]; for connections with random matrix theory, see [27].

We denote by the cone of complex positive semidefinite matrices. The* separable cone* is a subcone of the set of bipartite positive semidefinite matrices of size defined by

Quantum states (separable quantum states, resp.) are elements of (, resp.) with unit trace; however, it is clear from the definition of separability that the trace normalization is of little importance, so we shall work with the conic versions of these notions to avoid technicalities.

Deciding whether a given positive semidefinite matrix is separable is an NP-hard problem [28], when formulated as a weak membership decision problem. A simple solution exists only in small dimensions , a fact due to the simple structure of the cone of positive maps . Indeed, any such positive map can be decomposed as follows (see [29]): where , are* completely positive* maps and is the transposition operator. Maps which can be written as above are called* decomposable*; Woronowicz’s result from [29] shows that, in the case , any positive map is decomposable; this fact is no longer true in larger dimensions; see [30].

The cone of separable matrices and the cone of positive maps, are dual to each other [30]:

As we have already seen, the transposition map plays a special role in the theory. We introduce thus the cone of matrices having a positive partial transpose: It is an intermediate cone, sitting between the separable cone and the positive semidefinite cone: In what follows, we shall write .

#### 5. Strong Convergence for Block-Modified Random Matrices

In this section we recall a result about the limiting distribution of random matrices obtained by acting with a given linear map on each block of a unitarily invariant random matrix [31]. We then upgrade this result to take into account strong convergence; the result will be used many times in the subsequent sections.

The setting for block-modified random matrices is as follows. Consider a sequence of bipartite random matrices converging strongly as to a compactly supported probability measure ( being a fixed parameter). Given a (fixed) function preserving self-adjoint elements, define the* modified random matrix*:obtained by acting with on the blocks of . Note that in [31] the more general situation where could change the size of blocks is considered, but this more general setting is not needed here. We also require that the function satisfies the following technical condition (again, weaker conditions were considered in [31]; the situation here is closer to the results in [11]); see [31, Definition 4.7].

*Definition 5. *Define the Choi matrix of the linear map : Map is said to satisfy the unitarity condition if every eigenprojector of satisfies the condition that is proportional to the identity operator .

Under this assumption on , we have the following result, which upgrades [31, Theorem 5.1] to strong convergence.

Theorem 6. *Consider a sequence of bipartite unitarily invariant random matrices converging strongly to a compactly supported probability measure . Let be a hermiticity-preserving linear map satisfying the unitarity condition from Definition 5. Then, the sequence of block-modified random matrices converges strongly to the probability measure:where , are the eigenvalues of the Choi matrix and their multiplicities, respectively.*

*Proof. *The convergence in distribution has been shown in [31, Theorem 5.1]. The strong convergence follows from [19, Theorem 1.4] and the decomposition where . Indeed, the dilated matrix units are strongly asymptotically free from , and the result follows.

#### 6. The Partial Transposition

As an application of Theorem 6, we consider in this section the operation of* partial transposition*. Recall that transposition operation has the* flip operator* as its Choi matrix: , The flip operator is unitary, having eigenvalues with respective multiplicities , (the eigenvalues have as eigenspaces the symmetric and the antisymmetric subspace, resp.). Below, we denote by (, resp.) the minimum (maximum, resp.) element of the support of the measure .

Proposition 7. *Let be a sequence of unitarily invariant random matrices as in Definition 3 converging strongly to a compactly supported probability measure ; here, and are fixed. DefineIf then, almost surely as , . In particular, *

*Proof. *Using Theorem 6, the smallest eigenvalue of the partially transposed random matrix converges, almost surely as , towards , which is positive. Hence, the random matrices are asymptotically positive definite.

Let us discuss now some implications of these results. First, let consider some basic examples. Since GUE matrices are both unitarily invariant and Wigner, the result above applies to them, and we have the following remarkable equality ( denotes equality in distribution): for a GUE matrix . In particular, we have that, for all and , . We show in the next lemma that semicircular measures are the only compactly supported probability measures enjoying this property.

Lemma 8. *Assume and let be a compactly supported probability measure such that . Then, is semicircular.*

*Proof. *Let be the free cumulants of the distribution (see Section 3) and be its -transform [21, Lecture 12]. The equality of the two measures from the statement together with (28) gives where we have used the fact that the -transform is additive with respect to the free convolution. On the level of the free cumulants, the equality above means that whenever Since , the above relation holds for all , so it must be that has the property that for all . This property characterizes semicircular distributions (see [21, Example 11.21]), so the conclusion follows.

*Remark 9. *It would be interesting to see if there are any other probability measures, with unbounded support, which are invariant by the partial transposition operation, see [32].

Another interesting example for which one can perform computations is the case of the Marčenko-Pastur distribution , for some parameter . This case has been studied in [8, Theorem 6.2], where it has been shown that the measure has positive support iffAs a remark, note that, in the limit , we recover Aubrun’s threshold value of from [5, Theorems 2.2 and 2.3].

We prove next the main result of this section, a sufficient condition for the modified measure to be supported on the positive half-line.

Theorem 10. *Let be a probability measure having mean and variance , whose support is contained in the compact interval . Then, provided that , we have .*

*Proof. *We start by rewriting (28) as where such that Let us denote by the measure and try to obtain bounds for its support. First, using Proposition 4 for , we get Thus, the support of is bounded from below by Moreover, by direct computation, we have Applying again Proposition 4 for and , we deduce that the support of is bounded from below by The conclusion follows from the upper bound: which is satisfied for all .

This result gives rather rough bounds for the semicircular and Marčenko-Pastur distributions. For example, in the latter case, we obtain the condition , which is off by a factor of roughly 2 from the exact bound (34).

#### 7. Sufficient Conditions: The Depolarizing Map

There are very few* sufficient* conditions for the separability of a positive semidefinite matrix (or quantum state). For quantum states, the most famous one is the purity bound of Gurvits and Barnum [33, Corollary 3], corresponding to the fact that the in-radii of the convex sets of quantum states and separable states are identical. For the separable cone, this criterion reads that given a positive semidefinite matrix , : Note however that the condition above is very restrictive: by the Cauchy-Schwarz inequality, we always have In particular, if we consider a sequence of random matrices converging strongly (as in Definition 3) to a probability measure , the only case in which the Gurvits-Barnum condition would hold is when had 0 variance; that is, would be closer to a multiple of the identity matrix.

We consider next a more powerful separability criterion, given by the* depolarizing channel*. Recall that the depolarizing channel of parameter is the completely positive, trace preserving map given by It is known that the quantum channel is entanglement breaking iff [34, Section 5]. This means that when the parameter lies inside the above specified range, we have, for all positive semidefinite input matrices , Using this observation, we obtain the following sufficient separability conditions.

Proposition 11. *Let be a positive semidefinite operator. If any of the following two conditions is satisfied, then :*

*Proof. *For a given , let us solve . Writing for the partial trace of with respect to the first tensor factor, we have Taking the partial trace of this equation with respect to the first factor, we get . Plugging this in, we finally obtain If , the condition above implies that is of the form . For , asking that amounts to having The weakest necessary condition is obtained when takes the largest possible value (for which is still entanglement breaking); that is, . The condition reads then which is the first condition announced. To recapitulate, for satisfying the condition above, there exists a positive semidefinite matrix such that . Since the quantum channel is entanglement breaking [34, Section 5], the output matrix is separable. Similarly, for negative values of , we obtain condition (47), finishing the proof.

Before we move on, let us present a second point of view on condition (46). Note that Obviously, the left-hand side of the equality above defines an entanglement breaking channel; one can generalize this idea, by considering the more general* measure and prepare map*:for some positive integer . It is clear that the (nonlinear) map has a separable range (when restricted to the PSD cone). It is however more challenging to invert this map; as an example, we have, for , Such maps appear in the context of quantum de Finetti theorems [35, 36] and the exchangeability separability hierarchy [37].

Theorem 12. *Let be a sequence of unitarily invariant random matrices as in Definition 3 converging strongly to a compactly supported probability measure ; here, and are fixed. DefineIf or then, almost surely as , ; in particular, *

*Proof. *The proof uses conditions (46) and (47) and Theorem 6. Let us work through the first case, the second one being similar. The sufficient condition (46) for separability is equivalent to , for the map given by This map satisfies the unitarity condition from Definition 5, where the Choi matrix of has eigenvalues: Hence, by Theorem 6, the random matrices converge strongly, as , towards the probability measure from (55). The positivity of the support of ensures that the random matrices are asymptotically positive definite.

Let us consider some examples. For the semicircular distribution with mean and variance , we get by direct computation with In this case, since both modified measures are semicircular and have the same average, the criterion is stronger when the standard deviation is smaller. In the range , we have iff . Indeed, the inequality simplifies to . The above polynomial changes signs 3 times between the values , thus proving the claim (the actual roots of this polynomial are approximately , , and ). In the case , . For shifted GUE random matrices, we have the following result.

Corollary 13. *Let be a sequence of random matrices, where is a standard GUE and is a fixed parameter. Then, provided that the random matrices are almost surely asymptotically separable. In particular. *

Let us now apply Theorem 12 to the case of the Marčenko-Pastur distribution. Although we are not able to determine analytically the support of the probability distributions , we present some useful bonds.

Corollary 14. *Let be a sequence of unitarily invariant random matrices as in Definition 3 converging strongly to the Marčenko-Pastur probability distribution of parameter . Then, provided thatthe random matrices are almost surely asymptotically separable. In particular. *

*Proof. *Let us consider first the criterion corresponding to map . We are interested in the support of the probability measure: A sufficient condition for the support of to be positive is that which is equivalent to (63). A similar analysis for map yields the sufficient condition: which can be seen to be weaker than (63) for , proving the claim.

Following the proof of Lemma 8, one can easily show that the only probability distributions which are invariant under the modifications are Dirac masses; we leave the proof as an exercise for the reader.

Let us now look for sufficient conditions on the probability measure which would ensure that the hypotheses of Theorem 12 are satisfied. Our approach here is identical to the one used in Theorem 10.

Proposition 15. *Let be a probability measure having mean and variance , whose support is contained in the compact interval . Then, provided that we have Similarly, In particular, if any of the conditions above hold, then, almost surely as , ; in particular, *

*Proof. *We just prove the implication for , the other one being similar. Let us define We obviously have ; to lower bound , we use Proposition 4 for , to obtain The conclusion follows now from the previous two inequalities, ensuring that .

#### 8. Necessary Conditions: The Correlated Witness

We shift focus in this section and study* necessary* conditions for separability or, equivalently, sufficient conditions for entanglement. Many such criteria (usually called entanglement criteria), exist in the literature, and we shall start by quickly reviewing them. Next, we discuss a criterion coming from a random entanglement witness, arguing that is a very useful one.

Given the use of entanglement for quantum tasks, and the computational hardness of deciding separability, there exist a plethora of criteria that permit certifying the entanglement of a given (mixed) quantum state. Most of these criteria stem from the following very simple observation: let be a positive map (i.e., a map which preserves the positive semidefinite cone). Then, for any matrix , we have Hence, if the output is not positive semidefinite, then the input matrix is entangled (assuming that was positive semidefinite to begin with). Every choice of a positive map yields an entanglement criterion; some of the most studied such maps are the* transposition map* (giving the PPT criterion discussed at the end of Section 5) and the reduction map, giving the* reduction criterion* [34, 38], which can be shown to be weaker (i.e., it detects fewer entangled states) than the PPT criterion, but it is interesting nonetheless for its relation to the distillability problem. There are some other entanglement criteria which do not fall in this framework, the most notable being the realignment criterion [39, 40]; we shall not discuss these criteria her; see [26] for a review and [6, 10] for results about random quantum states.

Since the set of separable states is a closed convex cone, by the Hahn-Banach theorem one can find, given any entangled matrix , a hyperplane separating from . In other words, there exists a* block-positive* operator , called an* entanglement witness*, such that . We recall that an operator is called block-positive iff

In this section, we shall make a very particular choice for the operator : we shall set, for a constant ,using the following intuition:* what is a better witness for a quantum state’s entanglement than the state itself?* Pursuing this idea for unitarily invariant quantum states, we obtain the entanglement criterion from Theorem 19. Before we state and prove that theorem, we need some preliminary results, which we find interesting for their own sake.

First, let us recall the following definition from [41]; see also [42].

*Definition 16. ** norm* of an operator is defined to bewhere the* Schmidt rank* of a vector is its tensor rank: If operator is normal, than one can restrict the maximization in (77) to .

Obviously, the operator from (76) is block-positive as soon as (moreover, if were positive, then the two statements would be equivalent; see [41, Corollary 4.9] for the general case of -block-positivity). So, in order to certify the block-positivity of bipartite operators having a strong asymptotic limit, we need the following result.

Proposition 17. *Let be a sequence of unitarily invariant random matrices as in Definition 3 converging strongly to a compactly supported probability measure ; here, and are fixed. Then, almost surely, where we write for some random variable having distribution .*

*Proof. *Since we are interested in the limit and is fixed, we assume wlog that . Moreover, since the matrices are self-adjoint, we have where We relate now the above numbers to -positivity: The asymptotic -positivity of strongly convergent sequences of random matrices has been studied in [43, Theorem 4.2], where it has been shown that, almost surely, the sequence is asymptotically -block-positive if , and, reciprocally, it is not -block-positive if ; note that the case where the left endpoint of the support of is zero is excluded, since in this case one needs extra information about the fluctuations of the smallest eigenvalue. Applying this result to our setting, we obtain, say for , almost surely, where , with denoting the translation operator. We have obviously and thus Similarly, we get finishing the proof.

Before moving on, let us discuss the value of norms for random projections. This case is important for quantum information theory, as it was argued in [42, Section 7]; see also [41, Theorem 4.15] for general norm bonds for projections. We consider here a sequence of Haar-distributed random projection operators of ranks for some fixed parameter . Using [44, Proposition 2.9], we obtain the following asymptotic behavior.

Corollary 18. *For a sequence of random projections as above, and for any , we have the following almost sure limit: *

We have now all the ingredients to state and prove the main result of this section.

Theorem 19. *Let a sequence of unitarily invariant random matrices as in Definition 3 converging to a compactly supported probability measure ; here, and are fixed, and denote respectively the first two moments of . Ifthen, almost surely as , . In particular, *

*Proof. *To show that the matrices from (76) are indeed entanglement witnesses for (almost surely as ), we need to show, for an appropriate choice of the constant , two things: (1)The maps are asymptotically block-positive.(2). We use Proposition 17 with for the first item: are asymptotically entanglement witnesses provided that The computation of the limit appearing in the second item above is straightforward: almost surely, we have We are done: choose any satisfying

As in the previous section, we consider next some applications of the result above, which we state as corollaries. We start with the case of shifted GUEs; see also [43, Theorem 5.4].

Corollary 20. *Let be a sequence of (normalized) GUE matrices, and set , for some constants , . If then is asymptotically positive semidefinite, PPT, and entangled.*

*Proof. *Note that the sequence from the statement converges strongly to the semicircular probability measure , which is supported on the interval . Hence, if , the matrices are asymptotically positive semidefinite and also PPT (since the GUE distribution is Wigner). For the second inequality, use .

Corollary 21. *Let be a sequence of unitarily invariant random matrices as in Definition 3 converging strongly to the Marčenko-Pastur probability distribution of parameter . If then, almost surely as , ; in particular, *

*Proof. *We use the criterion in Theorem 19 to obtain the following condition for entanglement:

Putting together the bounds above with the ones from [8, Theorem 6.2] (see also (34)), we obtain the following corollary.

Corollary 22. *For any and such that a sequence of unitarily invariant random matrices converging strongly to the Marčenko-Pastur probability distribution of parameter is, almost surely in the limit , PPT and entangled.*

Proposition 23. *Let be a probability measure having mean and variance , whose support is contained in the compact interval . Assume that Then, for any sequence of unitarily invariant random matrices converging strongly to , we have that almost surely as , ; in particular, *

*Proof. *The result follows from Theorem 19, using the upper bound from Proposition 4.

#### 9. PPT Matrices with Large Schmidt Number

The Schmidt number of a positive semidefinite matrix is a discrete measure of entanglement. It is defined for rank-one matrices as and extended by the convex roof construction to arbitrary matrices Obviously, iff , and for all positive semidefinite . It is an interesting question whether imposing that the partial transposition of is positive semidefinite has any implications on the range of values that the Schmidt number can take. Very recently, explicit examples of PPT matrices with have been constructed [45, Corollary III.3]. In the same paper, the authors show that, for large , most quantum states acting on have Schmidt number greater than , for some universal constant . Also recently, in a breakthrough result, it has been shown [46] that all PPT quantum states have Schmidt number at most 2, which is a considerable first step in understanding the structure of positive maps acting on .

In the unbalanced case, we show that the linear scaling can be achieved by using GUE random matrices. The example below complements the construction of PPT entangled states from [43, Section 5], by providing a lower bound for the Schmidt number.

Theorem 24. *For any fixed integer , consider the sequence of self-adjoint matrices , where is a random matrix. There exists a constant (made explicit in the proof) such that the following conditions hold almost surely as : *(i)* is PPT: .*(ii)*.*

*Proof. *The asymptotic distribution of the random matrix is , and thus is positive semidefinite as iffRecall from Section 6 that the matrices and have the same distribution, so the fact that is also positive semidefinite comes at no cost (this being the reason that shifted GUE random matrices are useful for PPT-related questions).

Let us now show that, asymptotically, . This relation is equivalent to finding a -positive map such that is not positive semidefinite. Let