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

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

Zixuan He

Published Oct 7, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.5281/zenodo.23200365

Related papers

Hybrid quantum network design against unauthorized secret-key generation, and its memory cost

Omer Sakarya, Marek Winczewski, Adam Rutkowski +1 more

A significant number of servers that constitute the Internet are to provide private data via private communication channels to mutually anonymous registered users.Such are the servers of banks, hospitals that provide cloud storage and many others.Replacing communication channels by maximally entangled states is a promising idea for the quantum-secured Internet (QI).While it is an important idea for large distances secure communication, for the case of the mentioned class of servers pure entanglement based solution is not only unnecessary but also opens a threat.A crack stimulating a node to generate secure connections via entanglement swapping between two hackers can cause uncontrolled consumption of resources.Turning into positive a recently proven no-go result by S. Bäuml et al. [Nat. Commun. 6, 6908 (2015)], we propose a natural countermeasure against this threat.The solution bases on connections between hub-nodes and end-users realized with states that contain secure key but do not allow for swapping of this key.We then focus on the study of the quantum memory cost of such a scheme and prove a fundamental lower bound on its memory overhead.In particular, we show that to avoid the possibility of entanglement swapping, it is necessary to store at least twice as much memory than it is the case in standard quantum-repeater-based network design.For schemes employing either states with positive partial transposition that approximates certain privates states or private states hardly distinguishable from their attacked versions, we derive much tighter lower bounds on required memory.Our considerations yield upper bounds on a two-way repeater rate for states with positive partial transposition (PPT), which approximates strictly irreducible private states.As a byproduct, we provide a lower bound on the trace distance between PPT and private states, shown previously only for private bits.

arXiv:1912.07548•Physical Review Research•Oct 5, 2020•4 citations

Beyond the Positive Partial Transpose Squared Conjecture: The Qutrit Case

Junhyeong An, Soojoon Lee

Entanglement swapping is a fundamental operation in quantum repeaters for establishing entanglement between distant parties. The positive partial transpose (PPT) squared conjecture asks whether two PPT entangled links can generate terminal entanglement through entanglement swapping, or equivalently, whether the composition of two PPT maps is always entanglement breaking. Motivated by this conjecture, we investigate the map-composition problem beyond the PPT setting. For qutrit completely positive (CP) maps, we prove that the composition of any CP map whose Choi matrix is $1$-undistillable with any CP map whose Choi matrix has Schmidt number at most two is entanglement breaking in either order. Moreover, we show that the cone of $1$-undistillable CP maps is exactly the largest qutrit cone of CP maps whose composition with every CP map whose Choi matrix has Schmidt number at most two is entanglement breaking in both orders. Finally, although map composition captures only the standard maximally entangled outcome in entanglement swapping, we prove that any $1$-undistillable two-qutrit state and any state of Schmidt number at most two cannot generate terminal entanglement under an arbitrary selective measurement on the intermediate systems.

quant-pharXiv:2607.15947•Jul 20, 2026•1 citation

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

Sparse anisotropic positive maps for qutrit entanglement: exact indecomposability and PPT geometry

Massimiliano F. Sacchi

Positive but not completely positive maps provide one of the most direct ways to detect entanglement beyond the positive-partial-transpose (PPT) criterion. We introduce and analyze an exactly solvable two-parameter family of sparse bistochastic positive maps on qutrits, in which two coherence channels are independently tuned by parameters $w$ and $z$. The sparse structure makes the full phase diagram analytic: positivity holds exactly on the square $0\le w,z\le2/3$, complete positivity on the smaller square $0\le w,z\le1/3$, and decomposability is lost precisely outside a quarter circle in the corner $w,z\ge1/3$. The indecomposable region is certified by explicit PPT entangled state adapted to the same witness geometry. At the endpoint $W_*=W(2/3,2/3)$ we construct a four-parameter family of PPT edge states of rank type $(5,5)$, derive their analytic detection region, and show that the corresponding rays are exposed faces of the PPT cone. Finally, although $W_*$ is not optimal, we give an explicit optimal refinement whose detection region on this family is strictly larger. The result is an analytically tractable qutrit setting in which positivity, indecomposability, PPT entanglement, optimality, and exposed convex geometry can be studied in a single framework.

quant-pharXiv:2607.12470•Physical Review A•Jul 15, 2026•1 citation

Equality cases and every-copy results for the Werner endpoint inequality

Tejasvi Singh Tomar

Whether every entangled state with a non-positive partial transpose (NPT) is distillable reduces to the case of the Werner states ρ(d,α) = (I + αF)/(d² + αd), where F is the swap. For d ≥ 3 and −1/2 ≤ α < −1/d these states are NPT but one-copy undistillable. Write a vector on k copies as a matrix C, and let Tr_J trace out the copies in J. By the Schmidt-rank criterion of DiVincenzo et al. and Dür et al. (2000), as rewritten by P. Costa Rico (2025), ρ(d,α) is k-copy undistillable exactly when Σ_J α^|J| ‖Tr_J C‖² ≥ 0 for every vector of Schmidt rank at most two on k copies. At α = −1/2 we call this the endpoint inequality. It was proved independently for two copies by Fu et al., Fraser et al., Song and Chen, and Bharti et al. (2026), and for three copies by a computer-assisted proof in the companion record doi:10.5281/zenodo.23604343. If it held for every k, NPT bound entanglement would exist. We describe its equality cases for two copies and where it could first fail, and we prove it on two classes of matrices, one for every number of copies and one for four copies. For two copies we prove that every equality case, that is, every nonzero C of rank at most two with equality in the endpoint inequality, has rank two and that the ranges of C and C* lie in products of two-dimensional single-copy subspaces. We obtain this by following the equality cases through Song and Chen's elementary proof of the two-copy inequality. Every known equality case, for any number of copies, has a range with a reduced state of rank at most two on some copy. We also show that a first failure would come with larger reduced states: if the endpoint inequality holds for k − 1 copies but fails for k, then for some α > −1/2 the inequality still holds, with equality at a nonzero C whose range has reduced states of rank at least three on every copy. This rests on a copy-removal lemma built on the separable ball of Gurvits and Barnum. We prove the endpoint inequality, for every k and d ≥ 3, for the matrices C whose range is spanned by a vector f_0 of V_0 and a vector f_1 of V_1 and whose co-range (the range of C*) is arbitrary. Here V_c is spanned by |c⟩^⊗k and the k vectors obtained from it by replacing one factor with |2⟩, for orthonormal |0⟩, |1⟩, |2⟩; for generic f_0 and f_1 the projector onto the range has reduced states of rank three on every copy, as a first failure would require. So no vector of this kind witnesses distillability of ρ(d,−1/2). Schur complements reduce the claim to a quadratic form; an induction on the number of copies then completes the argument. For four copies we establish the endpoint inequality in every dimension for all C whose range and co-range lie in one two-dimensional subspace. This class contains all normal matrices of rank two, for which Wu and Zou had proved the three-copy case (arXiv:2608.02647). Here we restrict the quartic moment relaxation used in the companion record to this class, where it involves the moments of a single vector; one exact certificate, together with an embedding into larger dimensions, then covers every dimension. For d = 3 the theorem is also proved in Lean 4 with Mathlib, in the package release_lean_commonplane. Some data checks in that proof are evaluated by compiled code (native_decide). For general C the endpoint inequality remains open from four copies on. This record contains the paper, the Lean package named above, and two packages of Python programs, each with a README that says how to run its checks. The package release_endpoint covers the computer-verified steps of the proofs, among them a symbolic check of five rational identities; these do not involve k, and checking them is the only computer step in the proof for every k. The package release_commonplane contains the four-copy certificates and two implementations of their exact checks; the second was written independently, from the definitions.

•Oct 28, 2026•1 citation

Entanglement with zero distillable secret key in local dimension ten

OpenAI

We construct an entangled state on \mathbb C^{10}\otimes\mathbb C^{10} with zero distillable secret key for the local-instrument protocols specified here. They allow joint processing of all copies and unlimited two-way public communication, with the input as the only shared private resource and an eavesdropper holding a purification and the complete public record. The construction also disproves the unrestricted two-map PPT-composition conjecture. A separate trace-preserving PPT channel on M_{21}(\mathbb C) has a square that is not entanglement breaking.

•Oct 6, 2026•0 citations
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.
A significant number of servers that constitute the Internet are to provide private data via private communication channels to mutually anonymous registered users.Such are the servers of banks, hospitals that provide cloud storage and many others.Replacing communication channels by maximally entangled states is a promising idea for the quantum-secured Internet (QI).While it is an important idea for large distances secure communication, for the case of the mentioned class of servers pure entanglement based solution is not only unnecessary but also opens a threat.A crack stimulating a node to generate secure connections via entanglement swapping between two hackers can cause uncontrolled consumption of resources.Turning into positive a recently proven no-go result by S. Bäuml et al. [Nat. Commun. 6, 6908 (2015)], we propose a natural countermeasure against this threat.The solution bases on connections between hub-nodes and end-users realized with states that contain secure key but do not allow for swapping of this key.We then focus on the study of the quantum memory cost of such a scheme and prove a fundamental lower bound on its memory overhead.In particular, we show that to avoid the possibility of entanglement swapping, it is necessary to store at least twice as much memory than it is the case in standard quantum-repeater-based network design.For schemes employing either states with positive partial transposition that approximates certain privates states or private states hardly distinguishable from their attacked versions, we derive much tighter lower bounds on required memory.Our considerations yield upper bounds on a two-way repeater rate for states with positive partial transposition (PPT), which approximates strictly irreducible private states.As a byproduct, we provide a lower bound on the trace distance between PPT and private states, shown previously only for private bits.
Entanglement swapping is a fundamental operation in quantum repeaters for establishing entanglement between distant parties. The positive partial transpose (PPT) squared conjecture asks whether two PPT entangled links can generate terminal entanglement through entanglement swapping, or equivalently, whether the composition of two PPT maps is always entanglement breaking. Motivated by this conjecture, we investigate the map-composition problem beyond the PPT setting. For qutrit completely positive (CP) maps, we prove that the composition of any CP map whose Choi matrix is 111-undistillable with any CP map whose Choi matrix has Schmidt number at most two is entanglement breaking in either order. Moreover, we show that the cone of 111-undistillable CP maps is exactly the largest qutrit cone of CP maps whose composition with every CP map whose Choi matrix has Schmidt number at most two is entanglement breaking in both orders. Finally, although map composition captures only the standard maximally entangled outcome in entanglement swapping, we prove that any 111-undistillable two-qutrit state and any state of Schmidt number at most two cannot generate terminal entanglement under an arbitrary selective measurement on the intermediate systems.
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.
Positive but not completely positive maps provide one of the most direct ways to detect entanglement beyond the positive-partial-transpose (PPT) criterion. We introduce and analyze an exactly solvable two-parameter family of sparse bistochastic positive maps on qutrits, in which two coherence channels are independently tuned by parameters www and zzz. The sparse structure makes the full phase diagram analytic: positivity holds exactly on the square 0≤w,z≤2/30\le w,z\le2/30≤w,z≤2/3, complete positivity on the smaller square 0≤w,z≤1/30\le w,z\le1/30≤w,z≤1/3, and decomposability is lost precisely outside a quarter circle in the corner w,z≥1/3w,z\ge1/3w,z≥1/3. The indecomposable region is certified by explicit PPT entangled state adapted to the same witness geometry. At the endpoint W∗=W(2/3,2/3)W_*=W(2/3,2/3)W∗​=W(2/3,2/3) we construct a four-parameter family of PPT edge states of rank type (5,5)(5,5)(5,5), derive their analytic detection region, and show that the corresponding rays are exposed faces of the PPT cone. Finally, although W∗W_*W∗​ is not optimal, we give an explicit optimal refinement whose detection region on this family is strictly larger. The result is an analytically tractable qutrit setting in which positivity, indecomposability, PPT entanglement, optimality, and exposed convex geometry can be studied in a single framework.
Whether every entangled state with a non-positive partial transpose (NPT) is distillable reduces to the case of the Werner states ρ(d,α) = (I + αF)/(d² + αd), where F is the swap. For d ≥ 3 and −1/2 ≤ α < −1/d these states are NPT but one-copy undistillable. Write a vector on k copies as a matrix C, and let Tr_J trace out the copies in J. By the Schmidt-rank criterion of DiVincenzo et al. and Dür et al. (2000), as rewritten by P. Costa Rico (2025), ρ(d,α) is k-copy undistillable exactly when Σ_J α^|J| ‖Tr_J C‖² ≥ 0 for every vector of Schmidt rank at most two on k copies. At α = −1/2 we call this the endpoint inequality. It was proved independently for two copies by Fu et al., Fraser et al., Song and Chen, and Bharti et al. (2026), and for three copies by a computer-assisted proof in the companion record doi:10.5281/zenodo.23604343. If it held for every k, NPT bound entanglement would exist. We describe its equality cases for two copies and where it could first fail, and we prove it on two classes of matrices, one for every number of copies and one for four copies. For two copies we prove that every equality case, that is, every nonzero C of rank at most two with equality in the endpoint inequality, has rank two and that the ranges of C and C* lie in products of two-dimensional single-copy subspaces. We obtain this by following the equality cases through Song and Chen's elementary proof of the two-copy inequality. Every known equality case, for any number of copies, has a range with a reduced state of rank at most two on some copy. We also show that a first failure would come with larger reduced states: if the endpoint inequality holds for k − 1 copies but fails for k, then for some α > −1/2 the inequality still holds, with equality at a nonzero C whose range has reduced states of rank at least three on every copy. This rests on a copy-removal lemma built on the separable ball of Gurvits and Barnum. We prove the endpoint inequality, for every k and d ≥ 3, for the matrices C whose range is spanned by a vector f_0 of V_0 and a vector f_1 of V_1 and whose co-range (the range of C*) is arbitrary. Here V_c is spanned by |c⟩^⊗k and the k vectors obtained from it by replacing one factor with |2⟩, for orthonormal |0⟩, |1⟩, |2⟩; for generic f_0 and f_1 the projector onto the range has reduced states of rank three on every copy, as a first failure would require. So no vector of this kind witnesses distillability of ρ(d,−1/2). Schur complements reduce the claim to a quadratic form; an induction on the number of copies then completes the argument. For four copies we establish the endpoint inequality in every dimension for all C whose range and co-range lie in one two-dimensional subspace. This class contains all normal matrices of rank two, for which Wu and Zou had proved the three-copy case (arXiv:2608.02647). Here we restrict the quartic moment relaxation used in the companion record to this class, where it involves the moments of a single vector; one exact certificate, together with an embedding into larger dimensions, then covers every dimension. For d = 3 the theorem is also proved in Lean 4 with Mathlib, in the package release_lean_commonplane. Some data checks in that proof are evaluated by compiled code (native_decide). For general C the endpoint inequality remains open from four copies on. This record contains the paper, the Lean package named above, and two packages of Python programs, each with a README that says how to run its checks. The package release_endpoint covers the computer-verified steps of the proofs, among them a symbolic check of five rational identities; these do not involve k, and checking them is the only computer step in the proof for every k. The package release_commonplane contains the four-copy certificates and two implementations of their exact checks; the second was written independently, from the definitions.
We construct an entangled state on \mathbb C^{10}\otimes\mathbb C^{10} with zero distillable secret key for the local-instrument protocols specified here. They allow joint processing of all copies and unlimited two-way public communication, with the input as the only shared private resource and an eavesdropper holding a purification and the complete public record. The construction also disproves the unrestricted two-map PPT-composition conjecture. A separate trace-preserving PPT channel on M_{21}(\mathbb C) has a square that is not entanglement breaking.