Let ρ ∈ M 3 ⊗ M n \rho\in M_3\otimes M_n ρ ∈ M 3 ⊗ M n be an absolutely PPT state with n ≥ 2 n\geq 2 n ≥ 2 , and let λ 1 , … , λ 3 n \lambda_1,\ldots,\lambda_{3n} λ 1 , … , λ 3 n be its eigenvalues. Maximum-purity conjecture. The maximum purity of absolutely PPT states is
{ 4 9 n if n ≡ 0 ( m o d 4 ) , 36 n + 8 ( 9 n + 1 ) 2 if n ≡ 1 ( m o d 4 ) , 36 n + 16 ( 9 n + 2 ) 2 if n ≡ 2 ( m o d 4 ) , 36 n − 8 ( 9 n − 1 ) 2 if n ≡ 3 ( m o d 4 ) . \begin{cases}
\frac{4}{9n} &\text{if } n\equiv 0\pmod 4,\\
\frac{36n+8}{(9n+1)^2} &\text{if } n\equiv 1\pmod 4,\\
\frac{36n+16}{(9n+2)^2} &\text{if } n\equiv 2\pmod 4,\\
\frac{36n-8}{(9n-1)^2} &\text{if } n\equiv 3\pmod 4.
\end{cases} ⎩ ⎨ ⎧ 9 n 4 ( 9 n + 1 ) 2 36 n + 8 ( 9 n + 2 ) 2 36 n + 16 ( 9 n − 1 ) 2 36 n − 8 if n ≡ 0 ( mod 4 ) , if n ≡ 1 ( mod 4 ) , if n ≡ 2 ( mod 4 ) , if n ≡ 3 ( mod 4 ) .
Moreover, the maximum is attained when
{ λ 1 = ⋯ = λ 3 n 4 = 2 3 n , λ 3 n 4 + 1 = ⋯ = λ 3 n = 2 9 n if n ≡ 0 ( m o d 4 ) , λ 1 = ⋯ = λ 3 n + 1 4 = 6 9 n + 1 , λ 3 n + 5 4 = ⋯ = λ 3 n = 2 9 n + 1 if n ≡ 1 ( m o d 4 ) , λ 1 = ⋯ = λ 3 n + 2 4 = 6 9 n + 2 , λ 3 n + 6 4 = ⋯ = λ 3 n = 2 9 n + 2 if n ≡ 2 ( m o d 4 ) , λ 1 = ⋯ = λ 3 n − 1 4 = 6 9 n − 1 , λ 3 n + 3 4 = ⋯ = λ 3 n = 2 9 n − 1 if n ≡ 3 ( m o d 4 ) . \begin{cases}
\lambda_1=\cdots=\lambda_{\frac{3n}{4}}=\frac2{3n},\quad \lambda_{\frac{3n}{4}+1}=\cdots=\lambda_{3n}=\frac2{9n} &\text{if } n\equiv 0\pmod 4,\\
\lambda_1=\cdots=\lambda_{\frac{3n+1}{4}}=\frac6{9n+1},\quad \lambda_{\frac{3n+5}{4}}=\cdots=\lambda_{3n}=\frac2{9n+1} &\text{if } n\equiv 1\pmod 4,\\
\lambda_1=\cdots=\lambda_{\frac{3n+2}{4}}=\frac6{9n+2},\quad \lambda_{\frac{3n+6}{4}}=\cdots=\lambda_{3n}=\frac2{9n+2} &\text{if } n\equiv 2\pmod 4,\\
\lambda_1=\cdots=\lambda_{\frac{3n-1}{4}}=\frac6{9n-1},\quad \lambda_{\frac{3n+3}{4}}=\cdots=\lambda_{3n}=\frac2{9n-1} &\text{if } n\equiv 3\pmod 4.
\end{cases} ⎩ ⎨ ⎧ λ 1 = ⋯ = λ 4 3 n = 3 n 2 , λ 4 3 n + 1 = ⋯ = λ 3 n = 9 n 2 λ 1 = ⋯ = λ 4 3 n + 1 = 9 n + 1 6 , λ 4 3 n + 5 = ⋯ = λ 3 n = 9 n + 1 2 λ 1 = ⋯ = λ 4 3 n + 2 = 9 n + 2 6 , λ 4 3 n + 6 = ⋯ = λ 3 n = 9 n + 2 2 λ 1 = ⋯ = λ 4 3 n − 1 = 9 n − 1 6 , λ 4 3 n + 3 = ⋯ = λ 3 n = 9 n − 1 2 if n ≡ 0 ( mod 4 ) , if n ≡ 1 ( mod 4 ) , if n ≡ 2 ( mod 4 ) , if n ≡ 3 ( mod 4 ) .
The formulas are motivated by numerical estimates, which become smaller than the conjectured values as the dimension increases; the conjecture remains open.