Entangled states with zero distillable secret key
Does there exist a finite-dimensional bipartite entangled state with , when key is distilled by LOCC with authenticated public communication and an adversary holds a purification?
Problem statement
Does there exist a finite-dimensional bipartite entangled state with , when key is distilled by LOCC with authenticated public communication and an adversary holds a purification?
Lean 4
No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.
Background
Distillable secret key is the asymptotic rate of shared classical bits that are uniform and independent of an adversary. The question asks whether this quantity is faithful on entangled bipartite states: does every entangled state contain some distillable secrecy?
Distillable entanglement implies distillable key, but the converse fails: PPT bound-entangled states can have positive key. Consequently the absence of distillable entanglement does not establish zero key, and the NPT bound-entanglement conjecture E1 is a different problem.
Horodecki–Sikorski–Das–Wilde's published 2026 resource theory explicitly allows for the unresolved possibility of entangled zero-key states. Calling this version “mathematical bound key” avoids silently identifying it with other conjectures involving a positive key-formation cost, whose definition requires additional care.
A proof that is positive for every entangled state, or one explicit entangled state with a rigorous zero-key converse against arbitrary LOCC protocols, resolves this sharp question. No finite-copy failure or numerical lack of a protocol establishes the required asymptotic zero.
Progress & source assessment
Source catalogue review: 4 September 2026. Improved indicates partial progress, including qualified preprint claims.
published: The 2026 resource theory of quantum secret key explicitly treats the existence of entangled zero-key states as unresolved. Evidence
Recorded progress
Add yours →Nothing recorded yet. A pointer to a paper the entry is missing counts.
Machine attempts
0 recordedAttempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.
No machine attempts recorded.
Sign in to run an attempt. New accounts start with enough credits for ten.
Discussion
0 notesNotes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.
No notes yet.
Sign in to add a note.