Problem 5 in Five Open Problems in Quantum Information Theory [PRX Quantum 3, 010101 (2022)], asks whether the two-ququart Werner state ϱ(4,−21) is two-copy distillable, where ϱ(d,α)=(I+αF)/(d2+αd). We answer it in the negative. To this end, we show the following stronger statement: for all C∈Md1d2(C) of rank at most r≤d1d2, tr1(C)∥F2+∥tr2(C)∥F2≤r∥C∥F2+r1∣tr(C)∣2. A result by Costa Rico on the equivalence of this inequality with two-copy undistillability at r=2 then settles Problem 5: ϱ(4,−21) is not two-copy distillable. Furthermore, we show that ϱ(d,α) is two-copy undistillable for every d≥2, if and only if α≥−21. Thus, the one and two-copy distillability regions of ϱ(d,α) coincide. These results have been found and written up with AI tools, pointing towards a structural change affecting the field of quantum information and computation.
Introduction
Werner states
Let (ei)i∈[d] be the standard basis of Cd, and let Eij:=eiej∗∈Md(C) be the associated matrix units, so that (Eij)i,j∈[d] is an orthonormal basis of Md(C) for the inner product (6): ⟨Eij,Ekl⟩F=δikδjl. Let F denote the flip on Cd⊗Cd, defined by F(x⊗y)=y⊗x and given by
F=i,j=1∑dEij⊗Eji.(1)
The operator F is Hermitian and satisfies F2=I. For α∈[−1,1] the Werner state with parameter α is
ϱ(d,α):=d2+αdId2+αF,(2)
following the convention of [7 Eq. (4)]; ϱα is written for ϱ(d,α) when d is clear.
It is known that the partial transpose ϱ(d,α)TB is not positive semidefinite, i.e. has negative partial transpose (NPT), if and only if α<−d1[1]. Thus, ϱ(4,−21) is NPT. For α≥−d1 the state is separable [1].
Entanglement distillation
A bipartite state ϱ is two-copy distillable if some vector ψ of Schmidt rank at most two across A1A2:B1B2 satisfies ⟨ψ∣(ϱTB)⊗2∣ψ⟩<0, where TB is partial transposition on the second subsystem of each copy [2, 7], and two-copy undistillable otherwise.
A state with positive partial transpose cannot be distilled: if ϱTB⪰0, then (ϱTB)⊗n⪰0 for every n, so ⟨ψ∣(ϱTB)⊗n∣ψ⟩≥0 for every ψ and ϱ is undistillable at every number of copies. Thus non-positivity of the partial transpose (NPT)—the Peres criterion [3]—is necessary for distillability [2].
A sufficient condition is the reduction criterion: any state violating the inequality ϱA⊗I−ϱ⪰0 or I⊗ϱB−ϱ⪰0, where ϱA=tr2(ϱ) and ϱB=tr1(ϱ), is distillable [4].
Between the two lies a partial unresolved regime: whether every NPT state is distillable is a longstanding open question. Recall that ϱ(d,α) is NPT if and only if α<−d1[1]. Furthermore,
Date: July 28, 2026.
Key words and phrases. Werner states, distillability, NPT bound entanglement, partial trace, singular values.
We thank Karol Życzkowski for fruitful discussions. TCF acknowledges financial support from VILLUM FONDEN via the QMATH Centre of Excellence (Grant No. 10059) and the Novo Nordisk Foundation (grant NNF20OC0059939 “Quantum for Life”). FH was funded in whole or in part by the National Science Centre, Poland 2024/54/E/ST2/00451 and by the Polish National Agency for Academic Exchange under the Strategic Partnership Programme grant BNI/PST/2023/1/00001. For the purpose of Open Access, the author has applied a CC-BY public copyright licence to any Author Accepted Manuscript (AAM) version arising from this submission. BP and IV were supported by the Hungarian National Research, Development and Innovation Office, NKFIH Grant No. K-145904. Werner states are one-copy undistillable if and only if α≥−21[2, 5, 11]. Since one-copy distillability trivially implies k-copy for every k≥1, ϱ(d,α) is in particular two-copy distillable for every α<−21.
Regarding undistillability, Vianna and Doherty showed by numerical computation that qutrit Werner states are two-copy undistillable on the whole range −21≤α<−31[6]. For general d, Costa Rico and Wolf showed that Werner states are two-copy undistillable for all α≥−31[11].
The concrete question addressed here is the following, listed as Problem 5 in Horodecki, Rudnicki and Życzkowski’s Five Open Problems in Quantum Information Theory[9].
Problem 1.1 (Problem 5 of [9]). Decide whether the Werner state ϱ(4,−21) of two ququarts, d=4, defined in Eq. (2), is two-copy distillable.
The answer given in this work is negative [shown in Cor. B]. More generally, we ask:
Problem 1.2. For which d and α is ϱ(d,α) two-copy distillable?
We show that for every d≥2, the Werner state ϱ(d,α) is two-copy undistillable if and only if α≥−21 [shown in Cor. C]. Thus every Werner state is two-copy undistillable if and only if it is one-copy undistillable.
The proof presented in this work was found with ChatGPT Sol-5.6 and refined with Claude Opus and Fable. All results have been carefully checked by the authors.
During preparation of this manuscript we became aware of a similar work by Fu et al, arXiv:2607.21367 and a manuscript in preparation by Kishor Bharti, Rishikesh Gajjala, and Tobias Haug. They seem to use a different proof strategy but also use a variant of Lemma 6.6.
Undistillability from a partial trace inequality
To answer Problems 1.1 and 1.2, we will make use of the following partial trace inequality.
Theorem 2.1 (Partial-trace criterion; Costa Rico [10 Theorem 1], in the norm form of Costa Rico and Wolf [11 Eq. (31)]). Let d≥2 and α∈[−1,0). The Werner state ϱ(d,α) is two-copy undistillable if and only if every C∈Md2(C) with rank(C)≤2 satisfies
Costa Rico [10] states the criterion for n copies and in the equivalent quadratic form qα(C)≥0, where qα(C)=∥C∥F2+α(∥tr1(C)∥F2+∥tr2(C)∥F2)+α2∣tr(C)∣2; only n=2 is used here. Writing α=−t with t>0 and dividing q−t(C)≥0 by t gives the norm form (3) stated above, which is the form recorded by Costa Rico and Wolf [11 Eq. (31)] and the one applied here.
Costa Rico and Wolf [11] prove that (3) holds for every rank-two C when α≥−31, and thus Werner states are two-copy undistillable in this range. Our aim is to show that this range extends to α=−21.
Contributions
We prove the required inequality, (3) at α=−21, in the following stronger form which is valid for every rank and local dimensions d1,d2. Note that no assumption on positive-semidefiniteness, hermiticity, or normality is made on C.
Theorem A (Rank-constrained partial-trace inequality). Let d1, d2, r be positive integers with 1≤r≤d1d2, and let C∈Md1d2(C) have rank at most r. Then
Corollary B.The two-ququart Werner state ϱ(4,−21) is not two-copy distillable.
In fact, we can deduce from Theorem A also:
Corollary C.For every d≥2, the Werner state ϱ(d,α) is two-copy undistillable if and only if α≥−21.
Overview
Dependency table
Below we list, for every item, its provenance and dependencies. We cite the original reference for items that predate this note (these are collected in § 6), and highlight with [here] for results established in this work.
Thm. A at r=2; (23); Thm. 2.1; separability/NPT criterion [1]
Table 1 (PDF p. 3).
Dependency graph
The same information in graphical form; arrows point from an ingredient to the result that uses it. Shaded nodes are known, framed nodes are established here.
Figure overview.
Conventions and definitions
Index sets and matrix spaces
For a positive integer d, write [d]:={1,2,…,d}. For positive integers m,n, let Mm,n(C) denote the vector space of m×n complex matrices. Write Mn(C):=Mn,n(C). The conjugate transpose of a matrix T is denoted by T∗. The ordinary transpose is denoted by TT. Entrywise complex conjugation is denoted by T.
Inner products
For column vectors x,y∈Cn the inner product and norm are
Both are conjugate-linear in the first argument and linear in the second. A third pairing on a direct sum of two matrix spaces, appears in (26); it is again the same one, since the pair (R1,R2) may be read as the block-diagonal matrix diag(R1,R2), for which tr(diag(R1,R2)∗diag(S1,S2))=⟨R1,S1⟩F+⟨R2,S2⟩F. No new notation is therefore introduced for it.
Rank-one operators
For column vectors x,y∈CN, the matrix xy∗ is the rank-at-most-one operator defined by (xy∗)z=x(y∗z). Its trace and Frobenius norm satisfy
tr(xy∗)=y∗x,(7)
∥xy∗∥F2=∥x∥2∥y∥2.(8)
Note that the left-hand side of (8) is a matrix norm and the right-hand side a product of vector norms; the subscript F marks the difference. Indeed, tr(xy∗)=∑k=1Nxkyk=y∗x, and
This is standard; see Horn and Johnson [19 Sec. 0.3] or Bhatia [20 Sec. I.1].
Tensor-product coordinates
Let H1=Cd1 and H2=Cd2, with standard orthonormal bases (ea)a∈[d1] and (fb)b∈[d2]. We identify H1⊗H2≅Cd1d2 using the ordered basis
(ea⊗fb)a∈[d1],b∈[d2].(11)
A vector x∈H1⊗H2 is written x=∑a=1d1∑b=1d2xabea⊗fb. A matrix C∈Md1d2(C) has entries C(a,b),(c,d) with a,c∈[d1] and b,d∈[d2]. For P∈Md1(C) and Q∈Md2(C), their Kronecker product is defined by
(P⊗Q)(a,b),(c,d)=PacQbd.(12)
Partial traces
For C∈Md1d2(C), define tr1(C)∈Md2(C) and tr2(C)∈Md1(C) by
(tr1(C))bd:=a=1∑d1C(a,b),(a,d),(13)
(tr2(C))ac:=b=1∑d2C(a,b),(c,b).(14)
Thus tr1 traces out the first tensor factor, while tr2 traces out the second tensor factor. The partial traces are adjoint to tensoring with an identity matrix: for every P∈Md1(C) and Q∈Md2(C),
⟨C,P⊗Id2⟩F=⟨tr2(C),P⟩F,(15)
⟨C,Id1⊗Q⟩F=⟨tr1(C),Q⟩F.(16)
Equations (15)–(16) can be seen as the coordinate-free definition of the partial trace: tr2 is the unique linear map Md1d2(C)→Md1(C) satisfying (15) for all P, and tr1 the unique one satisfying (16) for all Q[18 §1.1.2], [17 §2.4.3].
Vectorization
For X∈Md1,d2(C), define the row-major vectorization,
vec(X):=a=1∑d1b=1∑d2Xabea⊗fb.(17)
This provides a linear bijection vec:Md1,d2(C)⟶H1⊗H2, and it is an isometry between the two inner products of Section 5.2:
These are partial-trace forms of the identity vec(ABC)=(AT⊗C)vec(B) [see [14, §2.3, Eq. (4)]] for the column majorized form.
Rank and trace
For every C∈MN(C),
∣tr(C)∣2≤rank(C)∥C∥F2(23)
Indeed, for a singular-value decomposition C=∑j=1sμjujvj∗ with s=rank(C), Cauchy–Schwarz gives ∣tr(C)∣=∣∑j=1sμjujvj∗∣=∑j=1sμj∣uj∗vj∣≤∑jμj≤s∥C∥F.
The two summands are orthogonal, so this is again the pairing (6), read on block-diagonal matrices. Thus
∥Φ(C)∥2=∥tr1(C)∥F2+∥tr2(C)∥F2.(27)
Equations (25) and (26) are definitions, and (27) is the norm they induce. The displayed norm is the genuine norm on the target direct sum: tr1(C) occupies its Md2(C) slot and tr2(C) its Md1(C) slot.
Known ingredients
Everything in this section predates the manuscript, with the exception of Corollary 6.7 which is a straightforward consequence of Lemma 6.6.
Constant diagonals
Lemma 6.1 (Parker–Fillmore constant diagonal form [13, 12]). Let K∈Mr(C), and define τ:=rtr(K). Then there exists a unitary matrix Q∈Mr(C) such that
(Q∗KQ)ii=τfor every i∈[r];(28)
equivalently, there is an orthonormal basis q1,…,qr of Cr with qi∗Kqi=τ for every i∈[r].
The statement used here is [13 Theorem 9]: for every square complex matrix there is a unitary Q for which Q∗KQ has all diagonal entries equal; since the trace is unitarily invariant, that common value is τ=tr(K)/r. The same statement is [12 Corollary 2], with the constant likewise fixed by the trace condition of [12 Theorem 2].
Singular-value decomposition
Lemma 6.2 (Singular-value decomposition [19, 20]). Let C∈MN(C) have rank s. The case s=0 is interpreted using empty families and an empty sum. Then there exist positive numbers μ1,…,μs>0 and orthonormal families
u1,…,us∈CN,v1,…,vs∈CN(29)
such that C=∑i=1sμiuivi∗.
Lagrange variance identity
Lemma 6.3 (Lagrange variance identity [16 Theorem 7]). For real numbers δ1,…,δr,
To see this, note that both sides of (30) equal (r−1)∑iδi2−2∑i<jδiδj. On the left, r∑iδi2−(∑iδi)2=∑iδi2+2∑i<jδiδj; on the right, expanding each square gives ∑i<j(δi−δj)2=(r−1)∑iδi2−2∑i<jδiδj, since each δi2 occurs in exactly r−1 of the (2r) terms.
Rank-one partial-trace identities
Lemma 6.4 (Rank-one partial-trace inequality [10, 11]). For every x,y∈Cd1⊗Cd2, one has
Inequality (34) is the q=2 case of positive-matrix entropy subadditivity [15]. We note that Lemma 6.5 is not used in the proof of Theorem A.
A four-state identity
The identity of Eltschka and Siewert [8] below converts a trace inner product of the marginals of two rank-one operators into a complementary expression with terms exchanged. What Theorem A eventually uses is its direct-sum consequence, Corollary 6.7.
Lemma 6.6 (Four-state marginal identity [8 Eq. (13)]). In the original form of Eltschka and Siewert, for allψ,χ,ϕ,ζ∈Cd1⊗Cd2,
The two forms are equivalent by replacing (ψ,χ,ϕ,ζ)=(v,u,s,t) in (36) and using that the Frobenius product conjugates its first argument, e.g. ⟨tr1(uv∗),tr1(st∗)⟩F=tr[tr1(vu∗)tr1(st∗)].
For the benefit of the reader we prove Lemma 6.6 directly from the vectorization identities (19)–[20].
Proof of Lemma 6.6. It suffices to prove (37); equation (38) is the same identity with the two tensor factors interchanged, and both are equivalent to the bilinear form (36).
By the vectorization bijection [17], write u=vec(U), v=vec(V), s=vec(S), t=vec(T) with U,V,S,T∈Md1,d2(C).
Evaluate the left-hand side of (37): by [20], tr1(uv∗)=(V∗U)T and tr1(st∗)=(T∗S)T, and since transposition preserves the Frobenius inner product,
⟨tr1(uv∗),tr1(st∗)⟩F=⟨V∗U,T∗S⟩F=tr(U∗VT∗S).
Now evaluate the right-hand side of (37): by [19], tr2(tv∗)=TV∗ and tr2(su∗)=SU∗, so
⟨tr2(tv∗),tr2(su∗)⟩F=⟨TV∗,SU∗⟩F=tr(VT∗SU∗).
By trace cyclicity [10], tr(U∗VT∗S)=tr(VT∗SU∗), so the two sides agree, which is (37). This ends the proof.
Corollary 6.7 (Crossed polarization). For u,v,s,t∈Cd1⊗Cd2,
⟨Φ(uv∗),Φ(st∗)⟩=⟨Φ(tv∗),Φ(su∗)⟩.(39)
Proof. By the definition (26) of the direct-sum inner product, the left-hand side of (39) is the sum of the left-hand sides of (37) and (38), and the right-hand side is the sum of their right-hand sides. Adding the two therefore gives the claim. This ends the proof. □
We now state a main ingredient of the proof, a decomposition of C such that the diagonal is constant and the Gram matrices corresponding to the left and right factors coincide.
Lemma 7.1 (Balanced rank-r decomposition). Let C∈MN(C) satisfy rank(C)≤r≤N. Then there exist vectors x1,…,xr∈CN and y1,…,yr∈CN, and a Hermitian positive semidefinite matrix G=(gij)i,j=1r∈Mr(C) such that all of the following hold:
C=i=1∑rxiyi∗,(41)
xi∗xj=yi∗yj=gijfor every i,j∈[r],(42)
yi∗xi=rtr(C)for every i∈[r].(43)
Proof. Let s:=rank(C)≤r. Take a singular-value decomposition from Lemma 6.2: C=∑i=1sμiuivi∗. Extend u1,…,us to an orthonormal family u1,…,ur, and extend v1,…,vs to an orthonormal family v1,…,vr. Define μs+1=⋯=μr=0. Let
U=(u1⋯ur),V=(v1⋯vr)(44)
be the corresponding N×r isometries, and let Σ:=diag(μ1,…,μr). Then C=UΣV∗. Define
X:=UΣ1/2,Y:=VΣ1/2.(45)
Then C=XY∗ and X∗X=Σ=Y∗Y.
Set K:=Y∗X∈Mr(C). By rectangular trace cyclicity (10) it holds that
tr(K)=tr(Y∗X)=tr(XY∗)=tr(C).(46)
By Lemma 6.1, there exists a unitary Q∈Mr(C) such that every diagonal entry of Q∗KQ is
τ:=rtr(C).(47)
Now let X:=XQ and Y:=YQ and note that
C=XY∗=XQQ∗Y∗=XY∗,(48)
using QQ∗=I. Also define
G:=X∗X=Q∗ΣQ=Y∗Y,(49)
using X∗X=Σ=Y∗Y. Note that G⪰0, being a Gram matrix.
Let xi be the i-th column of X, and yi the i-th column of Y. Then XY∗=∑i=1rxiyi∗, so by (48), C=∑i=1rxiyi∗, which is (41).
Theorem A (Rank-constrained partial-trace inequality). Let d1,d2,r be positive integers with 1≤r≤d1d2, and let C∈Md1d2(C) have rank at most r. Then
Proof. The strategy is as follows: By (27), the left-hand side of (4) equals ∥Φ(C)∥2. Expanding C as a balanced rank-r decomposition we can write Φ(C)=∑iΦ(xiyi∗). Its squared norm ∥Φ(C)∥2 can be written as a double sum of diagonal and off-diagonal terms, which we bound separately from above. The resulting upper bound plus an additional sum of squares expression then equals the right-hand side of (4), proving the assertion.
Step 1: balanced decomposition
Let N:=d1d2. Apply the balanced decomposition in Lemma 7.1 to obtain vectors x1,…,xr, y1,…,yr∈CN and a Hermitian positive semidefinite matrix G=(gij)i,j=1r such that
The last expression can then be regrouped using the Lagrange identity [Lemma 6.3],
ri∑δi2−(i∑δi)2+2(r−1)i<j∑∣gij∣2(73)
i<j∑(δi−δj)2+2(r−1)i<j∑∣gij∣2≥0.(74)
This is a clearly non-negative expression, and thus proves inequality (4). This ends the proof.
Back to distillability
We can now answer the first question.
Problem 1.1 (Problem 5 of [9]). Decide whether the Werner state ϱ(4,−21) of two ququarts, d=4, defined in Eq. (2), is two-copy distillable.
The answer is:
Corollary B.The two-ququart Werner state ϱ(4,−21) is not two-copy distillable.
Proof. Theorem A with d1=d2=4 and r=2 states that every C∈M16(C) of rank at most two satisfies ∥tr1(C)∥F2+∥tr2(C)∥F2≤2∥C∥F2+21∣tr(C)∣2. This is condition (3) of Theorem 2.1 at d=4, α=−21. It follows that ϱ(4,−21) is two-copy undistillable. This ends the proof. □
We can also answer the second main question:
Problem 1.2. For which d and α is ϱ(d,α) two-copy distillable?
The answer is:
Corollary C.For every d≥2, the Werner state ϱ(d,α) is two-copy undistillable if and only if α≥−21.
Proof. We proceed by cases:
Case 1:−d1≤α. ϱ(d,α) is separable [1] and thus two-copy undistillable.
For α<−d1, ϱ(d,α) is NPT [1] and we distinguish two further cases:
Case 2:−21≤α<−d1. Note that this is only relevant for d≥3. Let C∈Md2(C) have rank at most two, put t:=−α∈(0,21],
a:=∥C∥F2,b:=∣tr(C)∣2,(75)
By Theorem A with d1=d2=d and r=2, ∥Φ(C)∥2≤2a+b/2, so it suffices to show that
2a+2b≤ta+tb,(76)
for all t:=−α∈(0,21]. This indeed holds due to,
(ta+tb)−(2a+2b)=(1−2t)(ta−2b)≥0.(77)
Above we used that the first factor is nonnegative due to t≤21. The second factor is nonnegative due to (23), b≤2a, which gives bt≤2at≤a≤2a, i.e. ta≥2b. Hence (76) holds. Combining (76) with Theorem A gives
∥Φ(C)∥2≤ta+tb=∣α∣1∥C∥F2+∣α∣∣tr(C)∣2(78)
which is condition (3) of Theorem 2.1. Hence ϱ(d,α) is two-copy undistillable for −21≤α.
Case 3:α<−21. Then ϱ(d,α) is one-copy distillable [2], and one-copy distillability trivially implies distillability at every larger number of copies; hence ϱ(d,α) is two-copy distillable. This ends the proof. □
As a consequence, the one and two-copy distillability regions of ϱ(d,α) coincide.
{sup}1` Department of Mathematical Sciences, University of Copenhagen, Copenhagen, 2100, Denmark
{sup}2` Division of Quantum Information, Institute of Informatics, Faculty of Mathematics, Physics and Informatics, University of Gdańsk, Wita Stwosza 57, 80-308 Gdańsk, Poland
{sup}3` MTA-ELTE "Momentum" Integrable Quantum Dynamics Research Group, ELTE Eötvös Loránd University, Pázmány Péter sétány 1/A, 1117 Budapest, Hungary
{sup}4` Holographic Quantum Field Theory Research Group, HUN-REN Wigner Research Centre for Physics, Konkoly-Thege Miklós u. 29-33, 1121 Budapest, Hungary
[1]R. F. Werner, “Quantum states with Einstein–Podolsky–Rosen correlations admitting a hidden-variable model,” Physical Review A 40, 4277–4281 (1989). doi:10.1103/PhysRevA.40.4277.DOI
[2]M. Horodecki, P. Horodecki, and R. Horodecki, “Mixed-state entanglement and distillation: Is there a ‘bound’ entanglement in nature?,” Physical Review Letters 80, 5239–5242 (1998). doi:10.1103/PhysRevLett.80.5239.DOI
[3]A. Peres, “Separability criterion for density matrices,” Physical Review Letters 77, 1413–1415 (1996). doi:10.1103/PhysRevLett.77.1413.DOI
[4]M. Horodecki and P. Horodecki, “Reduction criterion of separability and limits for a class of distillation protocols,” Physical Review A 59, 4206–4216 (1999). doi:10.1103/PhysRevA.59.4206.DOI
[5]W. Dür, J. I. Cirac, M. Lewenstein, and D. Bruß, “Distillability and partial transposition in bipartite systems,” Physical Review A 61, 062313 (2000). doi:10.1103/PhysRevA.61.062313; arXiv:quant-ph/9910022.DOI
[6]R. O. Vianna and A. C. Doherty, “Distillability of Werner states using entanglement witnesses and robust semidefinite programs,” Physical Review A 74, 052306 (2006). doi:10.1103/PhysRevA.74.052306.DOI
[7]Ł. Pankowski, M. Piani, M. Horodecki, and P. Horodecki, “A Few Steps More Towards NPT Bound Entanglement,” IEEE Transactions on Information Theory 56(8), 4085–4100 (2010). doi:10.1109/TIT.2010.2050810.DOI
[8]C. Eltschka and J. Siewert, “Joint Schmidt-type decompositions for two bipartite pure quantum states,” Physical Review A 101, 022302 (2020). doi:10.1103/PhysRevA.101.022302; arXiv:1907.07976.DOI
[9]P. Horodecki, Ł. Rudnicki, and K. Życzkowski, “Five Open Problems in Quantum Information Theory,” PRX Quantum 3, 010101 (2022). doi:10.1103/PRXQuantum.3.010101; arXiv:2002.03233.DOI
[10]P. Costa Rico, “New Partial Trace Inequalities and Distillability of Werner States,” Letters in Mathematical Physics 115, 47 (2025). doi:10.1007/s11005-025-01935-y; arXiv:2310.05726.DOI
[11]P. Costa Rico and M. M. Wolf, “Partial Trace Relations Beyond Normal Matrices,” arXiv:2507.18278 [quant-ph] (2025). doi:10.48550/arXiv.2507.18278.DOI
[12]P. A. Fillmore, “On Similarity and the Diagonal of a Matrix,” The American Mathematical Monthly 76(2), 167–169 (1969). doi:10.1080/00029890.1969.1200162.
[13]W. V. Parker, “Sets of Complex Numbers Associated with a Matrix,” Duke Mathematical Journal 15(3), 711–715 (1948). doi:10.1215/S0012-7094-48-01560-9.DOI
[15]K. M. R. Audenaert, “Subadditivity of q-entropies for q > 1,” Journal of Mathematical Physics 48, 083507 (2007). doi:10.1063/1.2771542.DOI
[16]G. H. Hardy, J. E. Littlewood, and G. Pólya, Inequalities, Cambridge University Press, Cambridge (1934); 2nd ed. (1952).
[17]M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, 10th anniversary ed., Cambridge University Press, Cambridge (2010). doi:10.1017/CBO9780511976667.
[18]J. Watrous, The Theory of Quantum Information, Cambridge University Press, Cambridge (2018). doi:10.1017/9781316848142.DOI
[19]R. A. Horn and C. R. Johnson, Topics in Matrix Analysis, Cambridge University Press, Cambridge (1991).DOI
[20]R. Bhatia, Matrix Analysis, Springer, New York (1997).
Nami Nishimura, Nils L. Vu, Adrià Gispert-Fernández, Cillian Kelly, Lawrence E. Kidder, Benjamin Leather, Thomas Osburn, Jonathan E. Thompson, Samuel D. Upton, Barry Wardell ·