Second-level collapse conjecture for the PPT entanglement-cost hierarchies
Second-level collapse conjecture for the PPT entanglement-cost hierarchies
Let be a state. The quantities are the -quantities defined by the hierarchy at level , and are the corresponding -quantities. Write for the exact entanglement cost under PPT operations. Second-level collapse conjecture. For every state ,
Consequently, the two hierarchies collapse and
The conjecture concerns whether the hierarchy limit can be computed at a finite level. The paper reports numerical evidence for collapse at the second level of the -hierarchy, but states that it was neither confirmed nor disproved analytically.
Sources & referencesView supporting material
Primary source
Ludovico Lami, Francesco Anna Mele and Bartosz Regula, “Computable entanglement cost under positive partial transpose operations”, arXiv:2405.09613 (2025).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.