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.
- Result
- Proved
- Status
- Resolved
- AI contribution
- AI co-developed
- Method
- Argument
- Field
- Quantum information
- Posed by
- Ludovico Lami, Bartosz Regula
- Year posed
- 2023
- Years open
- 3y
- Solved
- 2026-07-29
- Model
- ChatGPT (GPT-5.6 Sol)
- Vendor
- OpenAI
- Collaborators
- Tulja Varun Kondra, Raphael Brinster, Hermann Kampermann, Dagmar Bruß, Nikolai Wyderka
- Verification
- Unreviewed
- Publication
- Preprint
- Significance
- 20 / 100
- Disclosed cost
- —
- Wikipedia
- No dedicated article
What the AI did
Technical details of the proofs were developed with the help of ChatGPT (GPT-5.6 Sol, accessed July 2026); the authors thoroughly checked all output.
Verification
arXiv preprint; not yet peer-reviewed.
Source
arXiv:2607.27195 - Very Strong Irreversibility of Quantum Entanglement