Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Sharp dimension-independent Schatten bounds for PPT-protected coherence

Zixuan He

Published Nov 8, 2026• 0 citations
Publisher

Abstract

How much coherence can remain when its two protecting diagonal blocks have positive partial transpose? This article gives a sharp bound without fixing the local Hilbert-space dimensions. Let H be a positive two-by-two operator block matrix with diagonal blocks A and B and off-diagonal block X. Each diagonal block is bipartite and has positive partial transpose internally. The coherence X may be rectangular, complex and non-Hermitian. Define two crossed arrangements by \(\mathcal R(X)_{ik,j\ell}=X_{ij,k\ell}\) and \(\mathcal G(X)_{i\ell,kj}=X_{ij,k\ell}\). Then \[\max\{\|\mathcal R(X)\|_{4/3},\|\mathcal G(X)\|_{4/3}\}\le\sqrt{\operatorname{Tr}A\,\operatorname{Tr}B}.\] The traces and Schatten norms are unnormalized. The constant one is optimal, and every smaller Schatten exponent fails uniformly in dimension. Internal PPT protection of the diagonal blocks is distinct from requiring the entire flagged block matrix to be PPT. Why the endpoint is sharp. Marginal spectral truncation gives a dimension-independent singular-value tail of order \(n^{-3/4}\). Closure under tensor powers removes the prefactor and returns the strong \(4/3\) endpoint. A Fourier shield family already present in the private-state literature supplies matching equality and the obstruction below the endpoint; the new contribution is the universal upper bound and its endpoint identification. Infinite-dimensional use. The paper extends the result to trace-class guards on separable Hilbert spaces, specifies the partial-transpose and local-filter domains, and states the joint weighted-trace conditions for unbounded filters. Trace-norm conversion and partial trace incur additional explicit costs. The integrated 10-page article includes two figure groups, complete proofs and references.

DOI
10.5281/zenodo.24059239

Related papers

Two-copy nondistillability of Werner states: sharp partial-trace inequalities and finite-copy extensions

Kishor Bharti, Rishikesh Gajjala, Tobias Haug

We solve the two-copy distillability problem for Werner states in every local dimension. Our main matrix result is a sharp, dimension-free inequality: for every rank-at-most-two operator, the sum of the squared Hilbert--Schmidt norms of its two partial traces is bounded by twice its squared Hilbert--Schmidt norm plus one half of the squared modulus of its trace. This implies that a Werner state $ρ_α$ is two-copy distillable if and only if $α<-1/2$. In particular, the two-ququart state $ρ^{(4)}_{-1/2}$ is two-copy undistillable, resolving Problem 5 of Horodecki, Rudnicki, and Życzkowski. For an arbitrary finite number $k$ of copies, we give three exact formulations of the remaining problem. At the endpoint $α=-1/2$, undistillability is equivalent to nonnegativity of the endpoint partial-trace form on every rank-at-most-two operator. We also derive an equivalent hierarchy of operator inequalities $H_k(ψ)\succeq0$ for pure states with a maximally mixed qubit marginal. The two-copy proof does not formally induct, because partial trace can increase rank and $2$-positivity is not generally preserved by tensor products. We prove two rigorous many-copy extensions. First, the quadratic form factorizes exactly on tensor-factorized witnesses; for any such decomposition, the endpoint inequality holds if its possible rank-two factor is supported on a block containing at most two copies. Second, we construct explicit constants $γ_k>0$ such that $α\ge-γ_k$ implies $k$-copy undistillability in every dimension. The initial proofs were generated by ChatGPT 5.6 Sol; the authors have verified and rewritten them to enhance readability and provide additional context.

quant-pharXiv:2607.24479•Jul 28, 2026•5 citations

Sharp Entropy Cost of Coherent Leakage Across a Block Decomposition

Hassan Nasreddine

Let $\mathcal{H}=P\mathcal{H}\oplus Q\mathcal{H}$ and let $Πρ=PρP\oplus QρQ$ be the two-block pinching of a density matrix. Write $A=PρP$, $B=PρQ$, and $C=QρQ$. We study the block-coherence entropy $D(ρ\|Πρ)$, the relative-entropy cost of removing cross-block coherence. First, we prove a midpoint Bogoliubov--Kubo--Mori coercivity estimate, giving the operator-kernel lower bound $D(ρ\|Πρ)\ge \operatorname{Tr}[B^*Ω^{-1}_{A,C}(B)]$ for strictly positive diagonal blocks. The proof uses the block-sign involution $U=P-Q$ to obtain a sign-symmetric midpoint lower bound for the BKM Hessian. Second, we determine the exact minimum in the associated constrained entropy-minimization problem: at fixed protected-sector floor, leakage mass, and quadratic coherence, the minimum can be achieved by a single active two-level block, independently of the ambient dimension. Third, under a uniform floor $A\ge a_0P$ and $0<\varepsilon_Q\le a_0/2$, we obtain the logarithmic boundary law $D(ρ\|Πρ)\ge \|B\|_F^2\log(a_0/\varepsilon_Q)$, showing that the lower-bound coefficient multiplying the quadratic coherence diverges logarithmically as leakage mass tends to zero. As a finite-dimensional application, the estimates give an entropy certificate for coherent leakage from a protected subspace: $PρQ$ measures protected--leakage coherence, and the constrained entropy minimum is attained by a state supported on a single effective two-level transition. The BKM estimate also yields a dissipation lower bound along an idealized uniform block-dephasing orbit. Finally, the midpoint mechanism extends to finite-dimensional trace-preserving $\mathbb{Z}_2$-graded automorphisms and bounded finite-trace semifinite corners.

quant-pharXiv:2605.11024•May 12, 2026•0 citations

Toroidal-Core Certificates for PPT-Squared Diagonal Orthogonal Covariant Channels

Samuel Marquez Gonzalez

The positive-partial-transpose-squared (PPT-squared) conjecture asks whether the composition of two positive-partial-transpose (PPT) quantum channels must be entanglement breaking (EB). The problem remains open in general and, within the diagonal orthogonal covariant (DOC) class, the first unresolved deterministic dimension is four. A sufficient condition for PPT-squared composition is derived for DOC maps in arbitrary finite dimension. The proof isolates the quantum coherence data into two correlation matrices, mixes each with the identity until it lies in the convex hull of rank-one correlation matrices, and converts the resulting objects into an explicit triplewise completely positive (TCP) core. The remaining contribution is purely classical and is TCP whenever a simple entrywise mixing inequality is satisfied. For PPT DOC maps $Φ_{A,B,C}$ and $Φ_{D,E,F}$ on $M_d$, the entrywise bound $(AD)_{ij}\ge 2\lfloor\sqrt{d}\rfloor\sqrt{A_{ii}A_{jj}D_{ii}D_{jj}}$ for all $i,j$ guarantees that $Φ_{A,B,C}\circΦ_{D,E,F}$ is EB. In dimension four the universal coefficient becomes four. A continuous family of bistochastic PPT channels is then constructed; every member with $a\ne1$ is not EB, while every pairwise composition within the family is proved to be EB. A rank-sensitive refinement shows explicitly how low coherence rank can improve the universal coefficient. The resulting certificate is sufficient rather than necessary and is complementary to factor-width and semidefinite-hierarchy approaches.

quant-pharXiv:2609.32979•Sep 29, 2026•0 citations

A Sharp Rank-r Partial-Trace Inequality

Elazar Gershuni

Let $\Phi:M_d(\C)\to M_d(\C)$ be a completely positive map with a transpose-symmetric Kraus representation. Its Choi operator determines the rank-two constant \[ \beta_2(\Phi) =\frac12\sup_{\substack{\norm z=1\\ \SR(z)\le2}} \ip z{J(\Phi)z}. \] We prove that, for every $r\ge1$, \[ \Phi\circ\tau+(r-1)\beta_2(\Phi) \left(\Delta-\frac1r\id\right) \] is $r$-positive, where $\tau$ is transposition and $\Delta(X)=\Tr(X)I$. The proof turns the negative spectrum of a partially transposed rank-one operator into the edges of the complete graph $K_r$. Regrouping by vertices costs its degree $r-1$, rather than its $\binom r2$ edges. Transpose symmetry protects one direction and is exactly what produces the term $-\id/r$. For $\Phi=\Lambda_U\otimes\Lambda_V$, with $\Lambda_E(X)=\Tr(X)I-X^T$, a sharp double-skew singular-value estimate gives $\beta_2\le1$, with equality when both local dimensions are at least two. A map identity then yields, for every operator $C$ of rank at most $r$ on $U\otimes V$, \[ \norm{\Tr_U C}_2^2+\norm{\Tr_V C}_2^2 \le r\norm C_2^2+\frac1r\abs{\Tr C}^2, \] with dimension-uniform coefficients that are sharp whenever one local dimension is at least $r$ and the other is at least two. A second family, built from the edges of an arbitrary graph, has the same local constant and attains the universal coefficient $r-1$ whenever the graph contains an $r$-clique. The Choi lifting chain through the partial-trace and graph results, together with its sharpness witnesses, is formalized in Lean~4.

•Jul 26, 2026•0 citations

Arbitrarily large link key, zero repeater key: two PPT barriers in quantum networks

Zixuan He

Two quantum links can each supply arbitrarily much secret key and still supply none to their remote endpoints through an untrusted repeater. We prove that this obstruction is exact whenever the two links are independent and have positive partial transpose (PPT), even with collective processing of all copies, two-way public communication and postselection. Every positive-probability endpoint output remains at least 1/5 in unhalved trace norm from every nonempty private state, independently of block length, local memory and shield dimension. Explicit link families therefore realise KD(ρr) → ∞ while Krep(ρr, ρr) = 0. For a network of independent edge states, let dP(a,b) count the fewest PPT edges along any terminal path. The condition dP(a,b) ≥ 2 is necessary and sufficient for the PPT labels alone to force zero endpoint key for every compatible resource assignment. The threshold is sharp: one fixed pair of eight-dimensional link resources gives positive key exactly when dP(a,b) ≤ 1. The proof transfers the four-effect inequality for local PPT maps to complete repeater operations and reduces every blocked network to two PPT boundary bundles. Combined with the known failure of the PPT-square conjecture, the result separates entanglement swapping from private connectivity: an entangled endpoint state can survive two PPT links, while secret key remains impossible. Exact Markov sources and normal local operations on separable Hilbert spaces obey corresponding extensions.

•Oct 7, 2026•0 citations

Tight Universal Bounds on Quantum Data Hiding with Multipartite Werner States

Oren Akresh, Jacob Beckey, Felix Leditzky

Quantum data hiding concerns pairs of states which are highly distinguishable with global measurements, yet nearly indistinguishable when restricted to local operations and classical communication. More than two decades after Eggeling and Werner introduced a multipartite hiding scheme based on Werner states, the optimal dependence of its uniform security guarantee on the number of parties and local dimension remained unknown. We resolve this problem by showing that the distinguishing bias of any pair of $n$-qudit Werner states is $O(n^2/d)$ under measurements whose effects remain positive under partial transposition (PPT) across every bipartition. An explicit pair attains this scaling using only nonadaptive local measurements, establishing worst-case optimality and showing that the PPT relaxation preserves the optimal dependence on both the number of parties and the local dimension. At fixed security, this extends the certified hiding regime from $n=O(d^{1/4})$ to $n=O(\sqrt d)$. Beyond data hiding, the same bound implies that testing any nontrivial unitarily invariant property with adaptive single-copy measurements requires $Ω(\sqrt d)$ copies, yielding separations for any property with dimension-independent sample complexity under collective measurements. Our proof reduces the distinguishing bias to trace norms of partially transposed operators and analyzes them using mixed Schur-Weyl duality, demonstrating the utility of representation theoretic methods developed for port-based teleportation to data hiding and quantum property testing.

quant-pharXiv:2609.40332•Oct 1, 2026•1 citation
How much coherence can remain when its two protecting diagonal blocks have positive partial transpose? This article gives a sharp bound without fixing the local Hilbert-space dimensions. Let H be a positive two-by-two operator block matrix with diagonal blocks A and B and off-diagonal block X. Each diagonal block is bipartite and has positive partial transpose internally. The coherence X may be rectangular, complex and non-Hermitian. Define two crossed arrangements by (\mathcal R(X){ik,j\ell}=X{ij,k\ell}) and (\mathcal G(X){i\ell,kj}=X{ij,k\ell}). Then [\max{|\mathcal R(X)|{4/3},|\mathcal G(X)|{4/3}}\le\sqrt{\operatorname{Tr}A,\operatorname{Tr}B}.] The traces and Schatten norms are unnormalized. The constant one is optimal, and every smaller Schatten exponent fails uniformly in dimension. Internal PPT protection of the diagonal blocks is distinct from requiring the entire flagged block matrix to be PPT. Why the endpoint is sharp. Marginal spectral truncation gives a dimension-independent singular-value tail of order (n^{-3/4}). Closure under tensor powers removes the prefactor and returns the strong (4/3) endpoint. A Fourier shield family already present in the private-state literature supplies matching equality and the obstruction below the endpoint; the new contribution is the universal upper bound and its endpoint identification. Infinite-dimensional use. The paper extends the result to trace-class guards on separable Hilbert spaces, specifies the partial-transpose and local-filter domains, and states the joint weighted-trace conditions for unbounded filters. Trace-norm conversion and partial trace incur additional explicit costs. The integrated 10-page article includes two figure groups, complete proofs and references.
We solve the two-copy distillability problem for Werner states in every local dimension. Our main matrix result is a sharp, dimension-free inequality: for every rank-at-most-two operator, the sum of the squared Hilbert--Schmidt norms of its two partial traces is bounded by twice its squared Hilbert--Schmidt norm plus one half of the squared modulus of its trace. This implies that a Werner state ραρ_αρα​ is two-copy distillable if and only if α<−1/2α<-1/2α<−1/2. In particular, the two-ququart state ρ−1/2(4)ρ^{(4)}_{-1/2}ρ−1/2(4)​ is two-copy undistillable, resolving Problem 5 of Horodecki, Rudnicki, and Życzkowski. For an arbitrary finite number kkk of copies, we give three exact formulations of the remaining problem. At the endpoint α=−1/2α=-1/2α=−1/2, undistillability is equivalent to nonnegativity of the endpoint partial-trace form on every rank-at-most-two operator. We also derive an equivalent hierarchy of operator inequalities Hk(ψ)⪰0H_k(ψ)\succeq0Hk​(ψ)⪰0 for pure states with a maximally mixed qubit marginal. The two-copy proof does not formally induct, because partial trace can increase rank and 222-positivity is not generally preserved by tensor products. We prove two rigorous many-copy extensions. First, the quadratic form factorizes exactly on tensor-factorized witnesses; for any such decomposition, the endpoint inequality holds if its possible rank-two factor is supported on a block containing at most two copies. Second, we construct explicit constants γk>0γ_k>0γk​>0 such that α≥−γkα\ge-γ_kα≥−γk​ implies kkk-copy undistillability in every dimension. The initial proofs were generated by ChatGPT 5.6 Sol; the authors have verified and rewritten them to enhance readability and provide additional context.
Let H=PH⊕QH\mathcal{H}=P\mathcal{H}\oplus Q\mathcal{H}H=PH⊕QH and let Πρ=PρP⊕QρQΠρ=PρP\oplus QρQΠρ=PρP⊕QρQ be the two-block pinching of a density matrix. Write A=PρPA=PρPA=PρP, B=PρQB=PρQB=PρQ, and C=QρQC=QρQC=QρQ. We study the block-coherence entropy D(ρ∥Πρ)D(ρ\|Πρ)D(ρ∥Πρ), the relative-entropy cost of removing cross-block coherence. First, we prove a midpoint Bogoliubov--Kubo--Mori coercivity estimate, giving the operator-kernel lower bound D(ρ∥Πρ)≥Tr⁡[B∗ΩA,C−1(B)]D(ρ\|Πρ)\ge \operatorname{Tr}[B^*Ω^{-1}_{A,C}(B)]D(ρ∥Πρ)≥Tr[B∗ΩA,C−1​(B)] for strictly positive diagonal blocks. The proof uses the block-sign involution U=P−QU=P-QU=P−Q to obtain a sign-symmetric midpoint lower bound for the BKM Hessian. Second, we determine the exact minimum in the associated constrained entropy-minimization problem: at fixed protected-sector floor, leakage mass, and quadratic coherence, the minimum can be achieved by a single active two-level block, independently of the ambient dimension. Third, under a uniform floor A≥a0PA\ge a_0PA≥a0​P and 0<εQ≤a0/20<\varepsilon_Q\le a_0/20<εQ​≤a0​/2, we obtain the logarithmic boundary law D(ρ∥Πρ)≥∥B∥F2log⁡(a0/εQ)D(ρ\|Πρ)\ge \|B\|_F^2\log(a_0/\varepsilon_Q)D(ρ∥Πρ)≥∥B∥F2​log(a0​/εQ​), showing that the lower-bound coefficient multiplying the quadratic coherence diverges logarithmically as leakage mass tends to zero. As a finite-dimensional application, the estimates give an entropy certificate for coherent leakage from a protected subspace: PρQPρQPρQ measures protected--leakage coherence, and the constrained entropy minimum is attained by a state supported on a single effective two-level transition. The BKM estimate also yields a dissipation lower bound along an idealized uniform block-dephasing orbit. Finally, the midpoint mechanism extends to finite-dimensional trace-preserving Z2\mathbb{Z}_2Z2​-graded automorphisms and bounded finite-trace semifinite corners.
The positive-partial-transpose-squared (PPT-squared) conjecture asks whether the composition of two positive-partial-transpose (PPT) quantum channels must be entanglement breaking (EB). The problem remains open in general and, within the diagonal orthogonal covariant (DOC) class, the first unresolved deterministic dimension is four. A sufficient condition for PPT-squared composition is derived for DOC maps in arbitrary finite dimension. The proof isolates the quantum coherence data into two correlation matrices, mixes each with the identity until it lies in the convex hull of rank-one correlation matrices, and converts the resulting objects into an explicit triplewise completely positive (TCP) core. The remaining contribution is purely classical and is TCP whenever a simple entrywise mixing inequality is satisfied. For PPT DOC maps ΦA,B,CΦ_{A,B,C}ΦA,B,C​ and ΦD,E,FΦ_{D,E,F}ΦD,E,F​ on MdM_dMd​, the entrywise bound (AD)ij≥2⌊d⌋AiiAjjDiiDjj(AD)_{ij}\ge 2\lfloor\sqrt{d}\rfloor\sqrt{A_{ii}A_{jj}D_{ii}D_{jj}}(AD)ij​≥2⌊d​⌋Aii​Ajj​Dii​Djj​​ for all i,ji,ji,j guarantees that ΦA,B,C∘ΦD,E,FΦ_{A,B,C}\circΦ_{D,E,F}ΦA,B,C​∘ΦD,E,F​ is EB. In dimension four the universal coefficient becomes four. A continuous family of bistochastic PPT channels is then constructed; every member with a≠1a\ne1a=1 is not EB, while every pairwise composition within the family is proved to be EB. A rank-sensitive refinement shows explicitly how low coherence rank can improve the universal coefficient. The resulting certificate is sufficient rather than necessary and is complementary to factor-width and semidefinite-hierarchy approaches.
Let $\Phi:M_d(\C)\to M_d(\C)$ be a completely positive map with a transpose-symmetric Kraus representation. Its Choi operator determines the rank-two constant \[ \beta_2(\Phi) =\frac12\sup_{\substack{\norm z=1\\ \SR(z)\le2}} \ip z{J(\Phi)z}. \] We prove that, for every r≥1r\ge1r≥1, \[ \Phi\circ\tau+(r-1)\beta_2(\Phi) \left(\Delta-\frac1r\id\right) \] is rrr-positive, where τ\tauτ is transposition and $\Delta(X)=\Tr(X)I$. The proof turns the negative spectrum of a partially transposed rank-one operator into the edges of the complete graph KrK_rKr​. Regrouping by vertices costs its degree r−1r-1r−1, rather than its (r2)\binom r2(2r​) edges. Transpose symmetry protects one direction and is exactly what produces the term $-\id/r$. For Φ=ΛU⊗ΛV\Phi=\Lambda_U\otimes\Lambda_VΦ=ΛU​⊗ΛV​, with $\Lambda_E(X)=\Tr(X)I-X^T$, a sharp double-skew singular-value estimate gives β2≤1\beta_2\le1β2​≤1, with equality when both local dimensions are at least two. A map identity then yields, for every operator CCC of rank at most rrr on U⊗VU\otimes VU⊗V, \[ \norm{\Tr_U C}_2^2+\norm{\Tr_V C}_2^2 \le r\norm C_2^2+\frac1r\abs{\Tr C}^2, \] with dimension-uniform coefficients that are sharp whenever one local dimension is at least rrr and the other is at least two. A second family, built from the edges of an arbitrary graph, has the same local constant and attains the universal coefficient r−1r-1r−1 whenever the graph contains an rrr-clique. The Choi lifting chain through the partial-trace and graph results, together with its sharpness witnesses, is formalized in Lean~4.
Two quantum links can each supply arbitrarily much secret key and still supply none to their remote endpoints through an untrusted repeater. We prove that this obstruction is exact whenever the two links are independent and have positive partial transpose (PPT), even with collective processing of all copies, two-way public communication and postselection. Every positive-probability endpoint output remains at least 1/5 in unhalved trace norm from every nonempty private state, independently of block length, local memory and shield dimension. Explicit link families therefore realise KD(ρr) → ∞ while Krep(ρr, ρr) = 0. For a network of independent edge states, let dP(a,b) count the fewest PPT edges along any terminal path. The condition dP(a,b) ≥ 2 is necessary and sufficient for the PPT labels alone to force zero endpoint key for every compatible resource assignment. The threshold is sharp: one fixed pair of eight-dimensional link resources gives positive key exactly when dP(a,b) ≤ 1. The proof transfers the four-effect inequality for local PPT maps to complete repeater operations and reduces every blocked network to two PPT boundary bundles. Combined with the known failure of the PPT-square conjecture, the result separates entanglement swapping from private connectivity: an entangled endpoint state can survive two PPT links, while secret key remains impossible. Exact Markov sources and normal local operations on separable Hilbert spaces obey corresponding extensions.
Quantum data hiding concerns pairs of states which are highly distinguishable with global measurements, yet nearly indistinguishable when restricted to local operations and classical communication. More than two decades after Eggeling and Werner introduced a multipartite hiding scheme based on Werner states, the optimal dependence of its uniform security guarantee on the number of parties and local dimension remained unknown. We resolve this problem by showing that the distinguishing bias of any pair of nnn-qudit Werner states is O(n2/d)O(n^2/d)O(n2/d) under measurements whose effects remain positive under partial transposition (PPT) across every bipartition. An explicit pair attains this scaling using only nonadaptive local measurements, establishing worst-case optimality and showing that the PPT relaxation preserves the optimal dependence on both the number of parties and the local dimension. At fixed security, this extends the certified hiding regime from n=O(d1/4)n=O(d^{1/4})n=O(d1/4) to n=O(d)n=O(\sqrt d)n=O(d​). Beyond data hiding, the same bound implies that testing any nontrivial unitarily invariant property with adaptive single-copy measurements requires Ω(d)Ω(\sqrt d)Ω(d​) copies, yielding separations for any property with dimension-independent sample complexity under collective measurements. Our proof reduces the distinguishing bias to trace norms of partially transposed operators and analyzes them using mixed Schur-Weyl duality, demonstrating the utility of representation theoretic methods developed for port-based teleportation to data hiding and quantum property testing.