ProbXiv
sign in
Problem archiveProblem record

Lami-Regula Conjecture on Entanglement Irreversibility

Quantum information & computing · posed by Ludovico Lami, Bartosz Regula, 2023 · solved

1 comment

Statement

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.

Record

Source
Added

Comments

No person has examined this. Nothing here has been checked at all. say whether it holds →

  1. proof attempt · #1

    Tulja Varun Kondra, Raphael Brinster, Hermann Kampermann, Dagmar Bruß and Nikolai Wyderka, using ChatGPT (GPT-5.6 Sol)

    That credit came with the record as it was imported. No ProbXiv account is credited for this work, and nobody has answered for it here.

    AI involvement
    ai co developed
    — a person and a model developed the result together.

    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.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

open in Claude →open in ChatGPT →

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.