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

arXiv:2609.27906

A sharp norm inequality for entanglement-breaking channels

Eran Kopel

quant-phmath-phmath.OASubmitted Aug 21, 2026• Announced Aug 24, 2026• 1 citation
v1 · Aug 21, 2026v2 · Oct 17, 2026
arXivHTMLPDF

Abstract

For a channel $Φ$ on $M_d$ written in the generalised Bloch parameterisation $r \mapsto Ar+c$, we prove that entanglement breaking implies $\|A\|_*^2 + \frac{d(d-1)}{2}|c|^2 \le (d-1)^2$, where $\|\cdot\|_*$ denotes the nuclear norm. The bound is attained in every dimension by the completely dephasing channel, and at $d=2$ by an explicit family with $c\neq0$. The qubit case reads $\|A\|_*^2+|c|^2\le1$ and extends to full rank a rank-two condition of Ruskai. The proof sharpens Ruskai's bound $\|A\|_*\le1$ by retaining the POVM completeness relation $\sum_k f_k=0$, which her argument discards; this recentres $A$ from a second moment into a cross-covariance, and is the entire content of the improvement.

Comments
5 pages. Ancillary files: numerical verification scripts (all dimensions and qubit case)

Related papers

Output Side Information Changes the Entanglement-Breaking Threshold

Oliver Tuma

Discarding an output subsystem is a local post-processing operation, so an entanglement-breaking channel remains entanglement breaking after output reduction. The converse need not hold: a reduced channel can be entanglement breaking even when a richer output still carries reference entanglement. This preprint gives an exactly solvable two-parameter benchmark that quantifies this asymmetry. On two qubits, let (\Pi_\pm=(I\pm Z\otimes I)/2), let (\mathcal L(X)=\sum_s\Pi_sX\Pi_s) be sector dephasing, let (\mathcal M(X)=\sum_s\operatorname{Tr}(\Pi_sX)\Pi_s/2) be measure-and-prepare within the two sectors, and let (\mathcal D_4(X)=\operatorname{Tr}(X)I_4/4). The channel family is [\Phi_{t,\eta}=(1-\eta)\big[(1-t)\mathcal L+t\mathcal M\big]+\eta\mathcal D_4,\qquad 0\le t,\eta\le1.] For the reduced task, a variable second-qubit input is embedded with an arbitrary fixed first-qubit state and the first output qubit is discarded. The induced qubit channel is depolarizing with parameter (q=(1-\eta)(1-t)), and is entanglement breaking exactly when (q\le1/3). For the full four-dimensional output, the partially transposed normalized Choi state has one potentially negative eigenvalue, [\lambda_- = \frac{-4(1-\eta)+6(1-\eta)t+\eta}{16},] with multiplicity two. The block structure makes PPT sufficient for separability in this family. Hence, for (\eta<1), [t_{\rm red}(\eta)=\max!\left{0,1-\frac{1}{3(1-\eta)}\right},\qquadt_{\rm full}(\eta)=\max!\left{0,\frac{4-5\eta}{6(1-\eta)}\right}.] The exact region in which the reduced channel is already entanglement breaking while the full channel is not is (t_{\rm red}(\eta)\le t<t_{\rm full}(\eta)). Its width is [w(\eta)=\begin{cases}\eta/[6(1-\eta)],&0\le\eta\le2/3,\(4-5\eta)/[6(1-\eta)],&2/3\le\eta<4/5,\0,&4/5\le\eta\le1,\end{cases}] and reaches the exact maximum (w_{\max}=1/3) at (\eta=2/3). The Choi negativities are [\mathcal N_{\rm red}=\frac{[3(1-\eta)(1-t)-1]+}{4},\qquad\mathcal N{\rm full}=\frac{[4-5\eta-6(1-\eta)t]_+}{8}.] Therefore the maximal full-output Choi negativity compatible with an already entanglement-breaking reduced output is (1/12), attained at ((\eta,t)=(2/3,0)). The result is a controlled benchmark for output-access dependence: the same physical channel family can cross the entanglement-breaking boundary at different noise values solely because an output subsystem is retained or discarded.

•Sep 29, 2026•0 citations

Log-Sobolev inequality, von Neumann entropy and Entanglement of Formation

A. S. Holevo, M. E. Shirokov

We present two results derived from the sharp log-Sobolev inequality for the uniform measure on a complete graph which concern the von Neumann entropy and the Entanglement of Formation of a state of finite and infinite-dimensional quantum systems. The first result is a sharp Lipschitz lower semicontinuity bound for the von Neumann entropy at any mixed state $ρ$ with uniform positive spectrum (i.e. a state proportional to a projector) w.r.t. the fidelity deficit: the inequality $\,S(ρ)-S(σ)\leq C_ρ(1-F(ρ,σ))\,$ valid for any state $σ$, where $C_ρ$ is a constant depending on the rank of $ρ$. The second result is a sharp Lipschitz lower semicontinuity bound for the Entanglement of Formation at any pure state $ρ$ with uniform positive spectrum of marginal states w.r.t. the fidelity deficit: the inequality $\,E_F(ρ)-E_F(σ)\leq C_ρ(1-\mathrm{Tr}ρσ)\,$ valid for any state $σ$, where $C_ρ$ is a constant depending on the Schmidt rank of $ρ$. In both cases the optimal constant $C_ρ$ is equal to the optimal constant $K_{d}$ in the log-Sobolev inequality for the complete graph with $d$ vertices: in the first case $d=\mathrm{rank}ρ$, in the second one $d=\mathrm{rank}ρ_A=\mathrm{rank}ρ_B$. The authors are grateful to GPT 5.6 for valuable discussion and technical help in preparing this note.

quant-pharXiv:2609.12667•Sep 14, 2026•2 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

Affine rigidity of Lindblad generators and stationary-state entanglement

Christian Barker

Complete positivity can determine information apparently missing from a measured decay operator. We study all Gorini–Kossakowski–Sudarshan–Lindblad (GKSL) generators with a prescribed restriction A to traceless operators. Conditional complete positivity gives an exact compact convex set of compatible stationary states. Our main theorem establishes a sharp universal rank threshold: in Hilbert-space dimension d≥3, any generator whose compressed Choi matrix has rank at most d−1 is uniquely determined by A, even among completions with unrestricted Hamiltonians and jump operators. Common-target pumping is a special case. Pure-target reset generators have rank d and already exhibit affine ambiguity, establishing optimality of the threshold. A spectral compression inequality also gives the exact maximal affine-source displacement under depolarizing contamination, (d−1)/dη, and explicit stationary-state bounds under errors in A. A general necessary- and-sufficient criterion resolves cases beyond the rank guarantee through support–kernel coupling. Calibrated paired preparations isolate the homogeneous dynamics, yielding a two- step stationary-state reconstruction without direct source measurement whenever rigidity and uniqueness hold. Two-qubit examples demonstrate both robust entanglement certification and complete loss of entanglement information in non-rigid families, despite matching dynamical invariants and local responses. Complete proofs, explicit benchmark matrices and reproducible finite-dimensional checks are provided.

•Nov 2, 2026•0 citations

Entanglement breaking rank and the existence of SIC POVMs

Satish K. Pandey, Vern I. Paulsen, Jitendra Prakash +1 more

We introduce and study the entanglement breaking rank of an entanglement breaking channel. We show that the entanglement breaking rank of the channel Z:Md→Md defined by Z(X)=1d+1(X+Tr(X)Id) is d2 if and only if there exists a symmetric informationally complete positive operator-valued measure in dimension d.

arXiv:1805.04583•Journal of Mathematical Physics•Apr 1, 2020•16 citations

A short proof of the modified Kretschmann-Schlingemann-Werner conjecture

Satvik Singh

Let $Φ_1, Φ_2 : \mathbb{M}_d(\mathbb{C})\to \mathbb{M}_n(\mathbb{C})$ be two quantum channels with respective Stinespring isometries $V_1, V_2 : \mathbb{C}^{d}\to \mathbb{C}^{n} \otimes \mathbb{C}^{m}$ on any common dilation space $\mathbb{C}^{m}$. We prove that there exists a unitary $U$ on $\mathbb{C}^{m}$ such that $\|V_1-({\bf1}\otimes U)V_2\|_\infty\leq\sqrt{2\|Φ_1-Φ_2\|_\diamond},$ thus resolving vom Ende's modification of the Kretschmann-Schlingemann-Werner conjecture in the affirmative.

quant-pharXiv:2606.16418•Jun 16, 2026•2 citations
For a channel ΦΦΦ on MdM_dMd​ written in the generalised Bloch parameterisation r↦Ar+cr \mapsto Ar+cr↦Ar+c, we prove that entanglement breaking implies ∥A∥∗2+d(d−1)2∣c∣2≤(d−1)2\|A\|_*^2 + \frac{d(d-1)}{2}|c|^2 \le (d-1)^2∥A∥∗2​+2d(d−1)​∣c∣2≤(d−1)2, where ∥⋅∥∗\|\cdot\|_*∥⋅∥∗​ denotes the nuclear norm. The bound is attained in every dimension by the completely dephasing channel, and at d=2d=2d=2 by an explicit family with c≠0c\neq0c=0. The qubit case reads ∥A∥∗2+∣c∣2≤1\|A\|_*^2+|c|^2\le1∥A∥∗2​+∣c∣2≤1 and extends to full rank a rank-two condition of Ruskai. The proof sharpens Ruskai's bound ∥A∥∗≤1\|A\|_*\le1∥A∥∗​≤1 by retaining the POVM completeness relation ∑kfk=0\sum_k f_k=0∑k​fk​=0, which her argument discards; this recentres AAA from a second moment into a cross-covariance, and is the entire content of the improvement.
Discarding an output subsystem is a local post-processing operation, so an entanglement-breaking channel remains entanglement breaking after output reduction. The converse need not hold: a reduced channel can be entanglement breaking even when a richer output still carries reference entanglement. This preprint gives an exactly solvable two-parameter benchmark that quantifies this asymmetry. On two qubits, let (\Pi_\pm=(I\pm Z\otimes I)/2), let (\mathcal L(X)=\sum_s\Pi_sX\Pi_s) be sector dephasing, let (\mathcal M(X)=\sum_s\operatorname{Tr}(\Pi_sX)\Pi_s/2) be measure-and-prepare within the two sectors, and let (\mathcal D_4(X)=\operatorname{Tr}(X)I_4/4). The channel family is [\Phi_{t,\eta}=(1-\eta)\big[(1-t)\mathcal L+t\mathcal M\big]+\eta\mathcal D_4,\qquad 0\le t,\eta\le1.] For the reduced task, a variable second-qubit input is embedded with an arbitrary fixed first-qubit state and the first output qubit is discarded. The induced qubit channel is depolarizing with parameter (q=(1-\eta)(1-t)), and is entanglement breaking exactly when (q\le1/3). For the full four-dimensional output, the partially transposed normalized Choi state has one potentially negative eigenvalue, [\lambda_- = \frac{-4(1-\eta)+6(1-\eta)t+\eta}{16},] with multiplicity two. The block structure makes PPT sufficient for separability in this family. Hence, for (\eta<1), [t_{\rm red}(\eta)=\max!\left{0,1-\frac{1}{3(1-\eta)}\right},\qquadt_{\rm full}(\eta)=\max!\left{0,\frac{4-5\eta}{6(1-\eta)}\right}.] The exact region in which the reduced channel is already entanglement breaking while the full channel is not is (t_{\rm red}(\eta)\le t<t_{\rm full}(\eta)). Its width is [w(\eta)=\begin{cases}\eta/[6(1-\eta)],&0\le\eta\le2/3,\(4-5\eta)/[6(1-\eta)],&2/3\le\eta<4/5,\0,&4/5\le\eta\le1,\end{cases}] and reaches the exact maximum (w_{\max}=1/3) at (\eta=2/3). The Choi negativities are [\mathcal N_{\rm red}=\frac{[3(1-\eta)(1-t)-1]+}{4},\qquad\mathcal N{\rm full}=\frac{[4-5\eta-6(1-\eta)t]_+}{8}.] Therefore the maximal full-output Choi negativity compatible with an already entanglement-breaking reduced output is (1/12), attained at ((\eta,t)=(2/3,0)). The result is a controlled benchmark for output-access dependence: the same physical channel family can cross the entanglement-breaking boundary at different noise values solely because an output subsystem is retained or discarded.
We present two results derived from the sharp log-Sobolev inequality for the uniform measure on a complete graph which concern the von Neumann entropy and the Entanglement of Formation of a state of finite and infinite-dimensional quantum systems. The first result is a sharp Lipschitz lower semicontinuity bound for the von Neumann entropy at any mixed state ρρρ with uniform positive spectrum (i.e. a state proportional to a projector) w.r.t. the fidelity deficit: the inequality  S(ρ)−S(σ)≤Cρ(1−F(ρ,σ)) \,S(ρ)-S(σ)\leq C_ρ(1-F(ρ,σ))\,S(ρ)−S(σ)≤Cρ​(1−F(ρ,σ)) valid for any state σσσ, where CρC_ρCρ​ is a constant depending on the rank of ρρρ. The second result is a sharp Lipschitz lower semicontinuity bound for the Entanglement of Formation at any pure state ρρρ with uniform positive spectrum of marginal states w.r.t. the fidelity deficit: the inequality  EF(ρ)−EF(σ)≤Cρ(1−Trρσ) \,E_F(ρ)-E_F(σ)\leq C_ρ(1-\mathrm{Tr}ρσ)\,EF​(ρ)−EF​(σ)≤Cρ​(1−Trρσ) valid for any state σσσ, where CρC_ρCρ​ is a constant depending on the Schmidt rank of ρρρ. In both cases the optimal constant CρC_ρCρ​ is equal to the optimal constant KdK_{d}Kd​ in the log-Sobolev inequality for the complete graph with ddd vertices: in the first case d=rankρd=\mathrm{rank}ρd=rankρ, in the second one d=rankρA=rankρBd=\mathrm{rank}ρ_A=\mathrm{rank}ρ_Bd=rankρA​=rankρB​. The authors are grateful to GPT 5.6 for valuable discussion and technical help in preparing this note.
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.
Complete positivity can determine information apparently missing from a measured decay operator. We study all Gorini–Kossakowski–Sudarshan–Lindblad (GKSL) generators with a prescribed restriction A to traceless operators. Conditional complete positivity gives an exact compact convex set of compatible stationary states. Our main theorem establishes a sharp universal rank threshold: in Hilbert-space dimension d≥3, any generator whose compressed Choi matrix has rank at most d−1 is uniquely determined by A, even among completions with unrestricted Hamiltonians and jump operators. Common-target pumping is a special case. Pure-target reset generators have rank d and already exhibit affine ambiguity, establishing optimality of the threshold. A spectral compression inequality also gives the exact maximal affine-source displacement under depolarizing contamination, (d−1)/dη, and explicit stationary-state bounds under errors in A. A general necessary- and-sufficient criterion resolves cases beyond the rank guarantee through support–kernel coupling. Calibrated paired preparations isolate the homogeneous dynamics, yielding a two- step stationary-state reconstruction without direct source measurement whenever rigidity and uniqueness hold. Two-qubit examples demonstrate both robust entanglement certification and complete loss of entanglement information in non-rigid families, despite matching dynamical invariants and local responses. Complete proofs, explicit benchmark matrices and reproducible finite-dimensional checks are provided.
Let Φ1,Φ2:Md(C)→Mn(C)Φ_1, Φ_2 : \mathbb{M}_d(\mathbb{C})\to \mathbb{M}_n(\mathbb{C})Φ1​,Φ2​:Md​(C)→Mn​(C) be two quantum channels with respective Stinespring isometries V1,V2:Cd→Cn⊗CmV_1, V_2 : \mathbb{C}^{d}\to \mathbb{C}^{n} \otimes \mathbb{C}^{m}V1​,V2​:Cd→Cn⊗Cm on any common dilation space Cm\mathbb{C}^{m}Cm. We prove that there exists a unitary UUU on Cm\mathbb{C}^{m}Cm such that ∥V1−(1⊗U)V2∥∞≤2∥Φ1−Φ2∥⋄,\|V_1-({\bf1}\otimes U)V_2\|_\infty\leq\sqrt{2\|Φ_1-Φ_2\|_\diamond},∥V1​−(1⊗U)V2​∥∞​≤2∥Φ1​−Φ2​∥⋄​​, thus resolving vom Ende's modification of the Kretschmann-Schlingemann-Werner conjecture in the affirmative.