This paper establishes new inequalities relating the Schmidt number of bipartite states to their ranks and constructs PPT states with specified Schmidt numbers, advancing understanding of quantum entanglement and PPT state properties.
Contribution
It introduces novel bounds for the Schmidt number based on state ranks and presents a family of PPT states with controllable Schmidt numbers, addressing open problems in quantum entanglement theory.
Findings
01
Derived lower bounds for the Schmidt number using rank inequalities.
02
Constructed PPT states with any desired Schmidt number within a certain range.
03
Demonstrated the diversity of quantum entanglement through two contrasting state construction methods.
Abstract
In this short note we show two completely opposite methods of constructing entangled states. Given a bipartite state Ξ³βMkββMkβ, define Ξ³Sβ=(Id+F)Ξ³(Id+F), Ξ³Aβ=(IdβF)Ξ³(IdβF), where FβMkββMkβ is the flip operator. In the first method, entanglement is a consequence of the inequality rank(Ξ³Sβ)<rank(Ξ³Aβ)β. In the second method, there is no correlation between Ξ³Sβ and Ξ³Aβ. These two methods show how diverse is quantum entanglement. We prove that any bipartite state Ξ³βMkββMkβ satisfies SN(Ξ³)β₯max{rank(Ξ³)rank(Ξ³Lβ)β,rank(Ξ³)rank(Ξ³Rβ)β,2SN(Ξ³Sβ)β,2SN(Ξ³Aβ)β}, where SN(Ξ³) stands for the Schmidt number of Ξ³ and Ξ³Lβ,Ξ³Rβ are theβ¦
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
Inequalities for the Schmidt Number of Bipartite States
In this short note we show two completely opposite methods of constructing entangled states. Given a bipartite state Ξ³βMkββMkβ, define Ξ³Sβ=(Id+F)Ξ³(Id+F), Ξ³Aβ=(IdβF)Ξ³(IdβF), where FβMkββMkβ is the flip operator. In the first method, entanglement is a consequence of the inequality rank(Ξ³Sβ)<rank(Ξ³Aβ)β.
In the second method, there is no correlation between Ξ³Sβ and Ξ³Aβ. These two methods show how diverse is quantum entanglement.
We prove that any bipartite state Ξ³βMkββMkβ satisfies
[TABLE]
where SN(Ξ³) stands for the Schmidt number of Ξ³ and Ξ³Lβ,Ξ³Rβ are the marginal states of Ξ³.
We also present a family of PPT states in MkββMkβ, whose members have Schmidt number equal to n, for any given 1β€nβ€β2kβ1ββ. This is a new contribution to the open problem of finding the best possible Schmidt number for PPT states.
1. Introduction
The separability problem in Quantum Information Theory asks for a deterministic criterion to distinguish the entangled states from the separable states [Guhne]. This problem is known to be a hard problem even for bipartite mixed states [gurvits2003, gurvits2004].
The Schmidt number of a state (SN(Ξ³) - Definition 2.1) is a measure of how entangled a state is [Terhal, Sperling2011]. If its Schmidt number is 1 then the state is separable. If its Schmidt number is greater than 1 then the state is entangled. A method to compute the Schmidt Number is unknown.
Denote by Mkβ the set of complex matrices of order k. The separability problem has been completely solved in M2ββM2β. A state in M2ββM2β is separable if and only if it is positive under partial transposition or simply PPT (Definition 2.1) [peres, horodeckifamily]. Therefore, the Schmidt number of a PPT state in M2ββM2β is equal to 1. Recently, the Schmidt number of every PPT state of M3ββM3β has been proved to be less or equal to 2 [Yang, Chen].
The authors of [Marcus] left an open problem to determine the best possible Schmidt number for PPT states.
They also presented a construction of PPT states in MkββMkβ whose Schmidt numbers are greater or equal to β4kβ1ββ.
This was the first explicit
example of a family of PPT states achieving a Schmidt number that scales linearly in the local dimension.
We investigate this matter. We present an explicit construction of PPT states in MkββMkβ, whose Schmidt numbers are equal to n, for any given 1β€nβ€β2kβ1ββ. This is a new contribution to their open problem.
We manage to compute the Schmidt number of these PPT states using the following inequality
[TABLE]
where Ξ³Sβ=(Id+F)Ξ³(Id+F), Ξ³Aβ=(IdβF)Ξ³(IdβF) and FβMkββMkβ is the flip operator (i.e., F(aβb)=bβa, for every a,bβCk).
We believe this is one of the simplest constructions of an entangled PPT state made so far.
Another inequality that we present here extends a result that was previously known for separable states ([smolin, Theorem 1]) to every state of MkββMmβ. Denote by Ξ³Lβ and Ξ³Rβ the marginal states of a state Ξ³βMkββMmβ (Definition 2.1).
We show that every state Ξ³ of MkββMmβ satisfies
[TABLE]
We can use this inequality to obtain a lower bound for the Schmidt number of low rank states.
Next, through a series of very technical results, the author of [Cariello_LAA] obtained the following lower bounds for the rank(Ξ³Sβ) of any separable state Ξ³βMkββMkβ
[TABLE]
where r is the marginal rank of Ξ³+FΞ³F.
These inequalities can be combined into one inequality:
Hence, rank(Ξ³Sβ)β₯rank(Ξ³Aβ)β for every separable state Ξ³βMkββMkβ.
Therefore, if rank(Ξ³Sβ)<rank(Ξ³Aβ)β then Ξ³ is entangled.
Next, we can combine equations 1.1 and 1.2 in order to obtain
[TABLE]
We can easily create entangled states by satisfying rank(Ξ³Sβ)rank((Ξ³Sβ)Lβ)β>2 or rank(Ξ³Aβ)rank((Ξ³Aβ)Lβ)β>2 and no correlation between Ξ³Sβ and Ξ³Aβ is required.
These two methods of creating entangled states are completely opposite. One depends on a correlation between Ξ³Sβ,Ξ³Aβ and the other does not. They show how diverse is quantum entanglement.
This paper is organized as follows.
β’
In Section II, we prove that SN(Ξ³)β₯max{2SN(Ξ³Sβ)β,2SN(Ξ³Aβ)β} (Proposition 2.2) and we construct a PPT state whose Schmidt number is equal to n, for any given nβ{1,β¦,β2kβ1ββ} (Proposition 2.3).
β’
In Section III, we prove our main inequality rank(Ξ³)SN(Ξ³)β₯max{rank(Ξ³Lβ),rank(Ξ³Rβ)} (Theorem 3.1) and two corollaries SN(Ξ³)β₯2Β rank(Ξ³Sβ)rank((Ξ³Sβ)Lβ)β and SN(Ξ³)β₯2Β rank(Ξ³Aβ)rank((Ξ³Aβ)Lβ)β (Corollaries 3.2 and 3.3).
Notation: Given xβR, define βxβ=min{nβZ,nβ₯x}. Identify MkββMmββMkmβ and CkβCmβCkm via Kronecker product. Let us call a positive semidefinite Hermitian matrix of Mkmβ a (non-normalized bipartite) state of MkββMmβ. Let β(Ξ΄) denote the image of Ξ΄βMkββMmβ within CkβCm. Given wβCkβCm denote by SR(w) its Schmidt rank (or tensor rank). Let the trace of a matrix AβMkβ be denoted by tr(A).
2. Preliminary Inequalities
In this section we present two preliminary inequalities (Proposition 2.2). They have independent interest as we can see in Proposition 2.3. There we construct a family of PPT states in MkββMkβ whose members have Schmidt number equal to n, for any given 1β€nβ€β2kβ1ββ.
Definition 2.1**.**
Given a state Ξ΄=βi=1nβAiββBiββMkββMmβ, define
β’
*the Schmidt number of Ξ΄ as *
SN(Ξ΄)=min{jmaxβ{SR(wjβ)},Β Ξ΄=j=1βmβwjβwjββt}*
*(This minimum is taken over all decompositions of Ξ΄ as βj=1mβwjβwjββt).
β’
the partial transposition of Ξ΄ as Ξ΄Ξ=βi=1nβAiββBitβ .
Moreover, let us say that δ is positive under partial transposition or simply a PPT state if and only if δ and δΠare states.
β’
*the marginal states of Ξ΄ as Ξ΄Lβ=βi=1nβAiβtr(Biβ) and Ξ΄Rβ=βi=1nβBiβtr(Aiβ).
*
Proposition 2.2**.**
Every state Ξ³βMkββMkβ satisfies SN(Ξ³)β₯max{2SN(Ξ³Sβ)β,2SN(Ξ³Aβ)β}.
Proof.
By definition 2.1, there is a subset {w1β,β¦,wnβ}βCkβCk such that
Ξ³=βi=1nβwiβwiββt and SR(wiβ)β€SN(Ξ³), for every i.
Therefore, (IdΒ±F)Ξ³(IΒ±F)=βi=1nβviβviββt, where viβ=(IdΒ±F)wiβ. Notice that, for every i,
[TABLE]
Hence, SN((IdΒ±F)Ξ³(IΒ±F))β€2SN(Ξ³).
β
Proposition 2.3**.**
Let v=βi=1nβaiββbiβ, where {a1β,β¦,anβ,b1β,β¦bnβ} is a linearly independent subset of Ck. Define
[TABLE]
(1)
For every Ο΅>0, SN(Ξ³)=n. Notice that 1β€nβ€β2kβ1ββ.
2. (2)
There is Ο΅>0 such that Ξ³ is positive under partial transposition.
Proof.
(1) Notice that Ξ³Aβ=(IdβF)Ξ³(IdβF)=Ο΅(aat), where a=βi=1nβaiββbiββbiββaiβ.
Since
{a1β,β¦,anβ,b1β,β¦bnβ} is linearly independent then SR(v)=n and SR(a)=2n. Hence,
[TABLE]
Thus, SN(Ξ³)β₯2SN(Ξ³Aβ)β=n, by Proposition 2.2.
Next, the separability of Id+FβMkββMkβ is a well known fact, therefore SN(Id+F)=1.
(2) Notice that (Id+F)Ξ=Id+uut, where u=βi=1kβeiββeiβ and {e1β,β¦,ekβ} is the canonical basis of Ck. So (Id+F)Ξ is positive definite and, for a small Ο΅, (Id+F)Ξ+Ο΅(vvt)Ξ is positive definite too.
β
3. Main Inequality
In this section, we present our main result (Theorem 3.1) and two corollaries (Corollaries 3.2 and 3.3).
Theorem 3.1**.**
If Ξ³βMkββMmβ is a state then rank(Ξ³)SN(Ξ³)β₯max{rank(Ξ³Lβ),rank(Ξ³Rβ)}.
Proof.
The proof is an induction on rank(Ξ³). The case rank(Ξ³)=0 is trivial. If rank(Ξ³)=1 then SN(Ξ³)=rank(Ξ³Lβ)=rank(Ξ³Rβ).
Let rank(Ξ³)>1 and assume that this result is valid for states Ξ΄βMkββMmβ satisfying rank(Ξ΄)<rank(Ξ³).
Since β(Ξ³)ββ(Ξ³LββΞ³Rβ) then Ξ³ can be embedded in Mrank(Ξ³Lβ)ββMrank(Ξ³Rβ)β. The embedding does not change its rank or its Schmidt number. Thus, we can assume without loss of generality that rank(Ξ³Lβ)=k and rank(Ξ³Rβ)=m.
Let vββ(Ξ³)β{0} be such that SR(v)=SN(Ξ³).
β’
If kβ₯m then choose UβMkβ satisfying rank(U)=kβSN(Ξ³) and (UβId)v=0.
Define Ξ΄=(UβId)Ξ³(UββId). Note that rank(Ξ΄)β€rank(Ξ³)β1, since β(Ξ΄)β(UβId)(β(Ξ³)) and (UβId)v=0.
β’
If k<m then choose UβMmβ satisfying rank(U)=mβSN(Ξ³) and (IdβU)v=0.
Define Ξ΄=(IdβU)Ξ³(IdβUβ). Note that rank(Ξ΄)β€rank(Ξ³)β1, since β(Ξ΄)β(IdβU)(β(Ξ³)) and (IdβU)v=0.
In any case, by induction hypothesis, rank(Ξ΄)SN(Ξ΄)β₯max{rank(Ξ΄Lβ),rank(Ξ΄Rβ)}.
β’
If kβ₯m then Ξ΄Lβ=UΞ³LβUβ. Since Ξ³Lβ is positive definite then rank(Ξ΄Lβ)=rank(U)=kβSN(Ξ³).
β’
If k<m then Ξ΄Rβ=UΞ³RβUβ. Since Ξ³Rβ is positive definite then rank(Ξ΄Rβ)=rank(U)=mβSN(Ξ³).
Since rank(Ξ΄)β€rank(Ξ³)β1 and SN(Ξ΄)β€SN(Ξ³) then
β’
(rank(Ξ³)β1)SN(Ξ³)β₯kβSN(Ξ³), if kβ₯m. Therefore, rank(Ξ³)SN(Ξ³)β₯k.
β’
(rank(Ξ³)β1)SN(Ξ³)β₯mβSN(Ξ³), if k<m. Therefore, rank(Ξ³)SN(Ξ³)β₯m.
The induction is complete.
β
Corollary 3.2**.**
If Ξ³βMkββMkβ is a state then SN(Ξ³)β₯2Β rank(Ξ³Aβ)rank((Ξ³Aβ)Lβ)β.
Proof.
First, notice that (Ξ³Aβ)Lβ=(Ξ³Aβ)Rβ. Therefore, rank((Ξ³Aβ)Lβ)=rank((Ξ³Aβ)Rβ).
Next, since SN(Ξ³Aβ)β€2SN(Ξ³), by Proposition 2.2, then rank(Ξ³Aβ)SN(Ξ³)β₯21βrank(Ξ³Aβ)SN(Ξ³Aβ)β₯2rank((Ξ³Aβ)Lβ)β, by Theorem 3.1.
β
Corollary 3.3**.**
If Ξ³βMkββMkβ is a state then SN(Ξ³)β₯2Β rank(Ξ³Sβ)rank((Ξ³Sβ)Lβ)β.
Proof.
First, notice that (Ξ³Sβ)Lβ=(Ξ³Sβ)Rβ. Therefore, rank((Ξ³Sβ)Lβ)=rank((Ξ³Sβ)Rβ).
Since SN(Ξ³Sβ)β€2SN(Ξ³), by Proposition 2.2, then rank(Ξ³Sβ)SN(Ξ³)β₯21βrank(Ξ³Sβ)SN(Ξ³Sβ)β₯2rank((Ξ³Sβ)Lβ)β, by Theorem 3.1.
β
Summary and Conclusion
We presented an inequality that relates the marginal ranks of any bipartite state of MkββMmβ to its rank and its Schmidt number . Using this inequality, we described a method of constructing entangled states which is not based on any correlation between rank(Ξ³Aβ) and rank(Ξ³Sβ).
This form of entanglement differs completely from the entanglement derived from the inequality rank(Ξ³Sβ)<rank(Ξ³Aβ)β.
We also constructed a family of PPT states whose members have Schmidt number equal to n, for any given 1β€nβ€β2kβ1ββ. This is a new contribution to the open problem of finding the best possible Schmidt number for PPT states.