Scholarlink

<p>We compute the set of all extreme rays of the 6-party subadditivity cone that are compatible with strong subadditivity. In total, we identify 208 new (genuine 6-party) orbits, 52 of which violate at least one known holographic entropy inequality. For the remaining 156 orbits, which do not violate any such inequalities, we construct holographic graph models for 150 of them. For the final 6 orbits, it remains an open question whether they are holographic. Consistent with the strong form of the conjecture in [<CitationRef CitationID="CR1">1</CitationRef>], 148 of these graph models are trees. However, 2 of the graphs contain a “bulk cycle”, leaving open the question of whether equivalent models with tree topology exist, or if these extreme rays are counterexamples to the conjecture. The paper includes a detailed description of the algorithm used for the computation, which is presented in a general framework and can be applied to any situation involving a polyhedral cone defined by a set of linear inequalities and a partial order among them to find extreme rays corresponding to down-sets in this poset.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Algorithmic construction of SSA-compatible extreme rays of the subadditivity cone and the N = 6 solution

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年6月5日

查看全文
  • Temple He,
  • Veronika E. Hubeny,
  • Massimiliano Rota

摘要

We compute the set of all extreme rays of the 6-party subadditivity cone that are compatible with strong subadditivity. In total, we identify 208 new (genuine 6-party) orbits, 52 of which violate at least one known holographic entropy inequality. For the remaining 156 orbits, which do not violate any such inequalities, we construct holographic graph models for 150 of them. For the final 6 orbits, it remains an open question whether they are holographic. Consistent with the strong form of the conjecture in [1], 148 of these graph models are trees. However, 2 of the graphs contain a “bulk cycle”, leaving open the question of whether equivalent models with tree topology exist, or if these extreme rays are counterexamples to the conjecture. The paper includes a detailed description of the algorithm used for the computation, which is presented in a general framework and can be applied to any situation involving a polyhedral cone defined by a set of linear inequalities and a partial order among them to find extreme rays corresponding to down-sets in this poset.