quantum-information-computing / Quantum information

Lami-Regula Conjecture on Entanglement Irreversibility

Is the irreversibility of entanglement manipulation robust in the strong-converse sense - a strict separation between the exponential strong-converse distillable entanglement and the entanglement cost, as conjectured by Lami and Regula? Yes: there are states for which any attempt to restore reversibility incurs an error growing exponentially in the number of copies, and the irreversibility persists even at polynomially growing error.

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

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

quantum-information-computingJul 29, 2026Significance 20/100Registry: unreviewed

Lami-Regula Conjecture on Entanglement Irreversibility

Prior state unknownproved

Is the irreversibility of entanglement manipulation robust in the strong-converse sense - a strict separation between the exponential strong-converse distillable entanglement and the entanglement cost, as conjectured by Lami and Regula? Yes: there are states for which any attempt to restore reversibility incurs an error growing exponentially in the number of copies, and the irreversibility persists even at polynom…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Is the irreversibility of entanglement manipulation robust in the strong-converse sense - a strict separation between the exponential strong-converse distillable entanglement and the entanglement cost, as conjectured by Lami and Regula? Yes: there are states for which any attempt to restore reversibility incurs an error growing exponentially in the number of copies, and the irreversibility persists even at polynomially growing error.

Recorded attempts

Evidence graph

Connected research record

No public relationships recorded yet.