What was already known
Formation cost in general requires regularization. The paper builds on the scalar two-qubit concurrence formula and compares its assumption with general additivity results.
AI involvement
Ziao Tang, Chengkai Zhu, Ge Bai and Xin Wang report using frontier language models for the proofs of Theorems 4.1 and 4.2. The authors verified both proofs and extended the application of Theorem 4.2 themselves.
- Classical Capacity and Entanglement Cost of the Amplitude Damping ChannelClassical Capacity and Entanglement Cost of the Amplitude Damping Channel
Importance
The result gives strong superadditivity and an exact single-copy entanglement cost for a specified family.
Technical verification
Authors explicitly report rigorously verifying the statements and proofs of Theorems 4.1 and 4.2. No machine check was documented.
Formal checking
Authors explicitly report rigorously verifying the statements and proofs of Theorems 4.1 and 4.2. No machine check was documented.
- Checker
- Ziao Tang, Chengkai Zhu, Ge Bai, Xin Wang
- Scope
- Authors explicitly report rigorously verifying the statements and proofs of Theorems 4.1 and 4.2. No machine check was documented.
- Basis
- Reported by the linked checker
Human understanding
The authors give a mathematical explanation and extended an application of the entropy inequality. The source does not isolate a human account of every step of the model-drafted proofs.
Correction and publication history
Reassessment after tracing the model’s exact contribution to the pinned source.
Read this published revisionHistorical curation based on the cited claim, AI attribution and checking scope.
Read this published revision