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.
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.
We establish that the explicit trace-preserving 21-dimensional PPT channel constructed in OpenAI's September 2026 Entanglement with zero distillable secret key in local dimension ten has entanglement-breaking index exactly three. The original paper proves that its square is not entanglement breaking; we give an exact finite certificate that its cube is entanglement breaking. The certificate proves the reverse-order constituent composition is entanglement breaking, using rational invertible local filters, strict diagonal dominance, partial-transpose invariance, and an exact nonnegative decomposition into 666 real product projectors. A self-contained integer-only Python verifier and the LaTeX source are included as a supplementary ZIP. This result determines the index of one specific channel; it does not resolve the universal PPT-cubed conjecture. The work is a preprint and has not been independently peer reviewed. The structured Related works identify the original construction, Park's eventual entanglement-breaking theorem, and an earlier qubit-intermediate PPT composition result by Henry.
Quantum communication relies on the existence of high quality quantum channels to exchange information. In practice, however, all communication links are affected by noise from the environment. Here we investigate the ability of quantum channels to perform quantum communication tasks by restricting the participants to use only local operations and one-way classical communication (one-way LOCC) along with the available quantum channel. In particular, a channel can be used to distill a highly entangled state between two parties, which further enables quantum or private communication. In this work, we invoke the framework of superchannels to study the distillation of a resourceful quantum state, such as a maximally entangled state or a private state, using multiple instances of a point-to-point quantum channel. We use the idea ofk-extendibility to obtain a semidefinite relaxation of the set of one-way LOCC superchannels and define a class of entanglement measures for quantum channels that decrease monotonically under such superchannels; therefore these measures, dubbed collectively the “unextendible entanglement of a channel”, yield upper bounds on several communication-theoretic quantities of interest in the regimes of resource distillation and zero error.We then generalize the formalism ofk-extendibility to bipartite superchannels, thus obtaining functions that are monotone under two-extendible superchannels. This allows us to analyze probabilistic distillation of ebits or secret key bits from a bipartite state when using a resourceful quantum channel. Moreover, we propose semidefinite programs to evaluate several of these quantities, providing a computationally feasible method of comparison between quantum channels for resource distillation.
We study and solve the problem of distilling a secret key from quantum states representing correlation between two parties (Alice and Bob) and an eavesdropper (Eve) via one–way public discussion: we prove a coding theorem to achieve the ‘wire–tapper’ bound, the difference of the mutual information Alice–Bob and that of Alice–Eve, for so–called classical–quantum–quantum–correlations, via one–way public communication. This result yields information–theoretic formulae for the distillable secret key, giving ‘ultimate’ key rate bounds if Eve is assumed to possess a purification of Alice and Bob's joint state. Specializing our protocol somewhat and making it coherent leads us to a protocol of entanglement distillation via one–way LOCC (local operations and classical communication) which is asymptotically optimal: in fact we prove the so–called ‘hashing inequality’, which says that the coherent information (i.e. the negative conditional von Neumann entropy) is an achievable Einstein–Podolsky–Rosen rate. This result is known to imply a whole set of distillation and capacity formulae, which we briefly review.
Complete security proofs for quantum communication protocols can be notoriously involved, which convolutes their verification, and obfuscates the key physical insights the security finally relies on. In such cases, for the majority of the community, the utility of such proofs may be restricted. Here, we provide a simple proof of confidentiality for parallel quantum channels established via entanglement distillation based on hashing, in the presence of noise, and a malicious eavesdropper who is restricted only by the laws of quantum mechanics. The direct contribution lies in improving the linear confidentiality levels of recurrence-type entanglement distillation protocols to exponential levels for hashing protocols. The proof directly exploits the security relevant physical properties: measurement-based quantum computation with resource states and the separation of Bell-pairs from an eavesdropper. The proof also holds for situations where Eve has full control over the input states, and obtains all information about the operations and noise applied by the parties. The resulting state after hashing is private, i.e. disentangled from the eavesdropper. Moreover, the noise regimes for entanglement distillation and confidentiality do not coincide: confidentiality can be guaranteed even in situations where entanglement distillation fails. We extend our results to multiparty situations which are of special interest for secure quantum networks.
Differential privacy provides a mathematical framework for guaranteeing privacy for sensitive data. In quantum information processing, the interaction of privacy constraints with quantum resources such as entanglement remains a question of interest. Given that the utility of many protocols, and often the presence of a quantum advantage, relies on quantum resources such as entanglement, it is crucial to understand when a privacy requirement for a quantum channel is compatible with the channel's ability to preserve entanglement. We study this question for quantum local differential privacy (QLDP). Our main result shows that every ε-QLDP channel with a d-dimensional input is entanglement-breaking whenever ε≤logd−1d. We also prove an approximate version for (ε,δ)-QLDP, where channels in the same high-privacy regime are close in diamond norm to an entanglement-breaking channel. We further prove a composition result for a collection of private quantum channels having entangled inputs and global measurements in the high-privacy regime. Finally, we apply our results to private quantum learning theory. We prove that any learning protocol using arbitrary quantum memory on copies of the output of an entanglement-breaking channel can be simulated by a protocol that measures the corresponding unprocessed input copies one at a time while storing only classical information. Combining this result with our high-privacy entanglement-breaking theorem, we show that under sufficiently private local noise, a learning protocol with quantum memory for purity testing and bipartite product testing is subject to the sample complexity lower bounds for protocols with single-copy measurements on the noiseless tasks. We also obtain stronger sample complexity lower bounds when a single highly private channel acts on the entire multipartite input.
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.