quantum-information-computing / Quantum cryptography: distillable secret key and bound entanglement

Secret key from all entangled states: does every entangled state have positive distillable secret key? (Kruger-Werner Problem 24)

Theorem 1.1: there is an explicit entangled density operator ρ\rho on C10⊗C10\mathbb C^{10}\otimes\mathbb C^{10} whose range contains no nonzero product vector, such that for every nn and every admitted completed bit-output protocol on ρ⊗n\rho^{\otimes n} the output is at trace-norm distance at least 1/51/5 from an ideal secret bit; hence KD(ρ)=0K_D(\rho)=0. The state is the normalized Choi matrix of a composition of two PPT maps; a coherence inequality for such states bounds secrecy by disagreement probability. So the answer to Problem 24 is no. Not shown: minimality of dimension ten, or a zero-key example for protocol models beyond the paper's admitted class.

28Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

quantum-information-computingSep 27, 2026Significance 28/100Registry: unreviewed

Secret key from all entangled states: does every entangled state have positive distillable secret key? (Kruger-Werner Problem 24)

Prior state unknown→disproved

Theorem 1.1: there is an explicit entangled density operator ρ\rho on C10⊗C10\mathbb C^{10}\otimes\mathbb C^{10} whose range contains no nonzero product vector, such that for every nn and every admitted completed bit-output protocol on ρ⊗n\rho^{\otimes n} the output is at trace-norm distance at least 1/51/5 from an ideal secret bit; hence KD(ρ)=0K_D(\rho)=0. The state is the normalized Choi matrix of a composition of two PPT…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Theorem 1.1: there is an explicit entangled density operator ρ\rho on C10⊗C10\mathbb C^{10}\otimes\mathbb C^{10} whose range contains no nonzero product vector, such that for every nn and every admitted completed bit-output protocol on ρ⊗n\rho^{\otimes n} the output is at trace-norm distance at least 1/51/5 from an ideal secret bit; hence KD(ρ)=0K_D(\rho)=0. The state is the normalized Choi matrix of a composition of two PPT maps; a coherence inequality for such states bounds secrecy by disagreement probability. So the answer to Problem 24 is no. Not shown: minimality of dimension ten, or a zero-key example for protocol models beyond the paper's admitted class.

Theorem 1.1: there is an explicit entangled density operator ρ\rho on C10⊗C10\mathbb C^{10}\otimes\mathbb C^{10} whose range contains no nonzero product vector, such that for every nn and every admitted completed bit-output protocol on ρ⊗n\rho^{\otimes n} the output is at trace-norm distance at least 1/51/5 from an ideal secret bit; hence KD(ρ)=0K_D(\rho)=0. The state is the normalized Choi matrix of a composition of two PPT maps; a coherence inequality for such states bounds secrecy by disagreement probability. So the answer to Problem 24 is no. Not shown: minimality of dimension ten, or a zero-key example for protocol models beyond the paper's admitted class.

Recorded attempts

Evidence graph

Connected research record

Secret key from all entangled states: does every entangled state have positive distillable secret key? (Kruger-Werner Problem 24) — Mathematical Frontier Network