Metraipolis › archive › dc_ca46d9517c7a
A Dichotomy for Boolean Complex Holant Problems with Conjugate-Closed Signature Sets — arXiv:2609.13132
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.13132
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T03:59:22.803Z
- SHA-256 of the archived text
2092a30f86fd64a528ee2d404c8246f4ebcef83b5868c58786d9934f8693d6cf- Stable URL of this page
https://metraipolis.com/documento/dc_ca46d9517c7a
How to cite
A Dichotomy for Boolean Complex Holant Problems with Conjugate-Closed Signature Sets — arXiv:2609.13132 — arXiv (en), https://arxiv.org/abs/2609.13132 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ca46d9517c7a (Metraipolis archive dc_ca46d9517c7a, sha256 2092a30f86fd64a528ee2d404c8246f4ebcef83b5868c58786d9934f8693d6cf)
BibTeX
@misc{dcca46d9517c7a,
title = {A Dichotomy for Boolean Complex Holant Problems with Conjugate-Closed Signature Sets — arXiv:2609.13132},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.13132},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ca46d9517c7a; sha256 2092a30f86fd64a528ee2d404c8246f4ebcef83b5868c58786d9934f8693d6cf},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.13132. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study Boolean Holant problems with complex-valued signature sets closed under conjugation. Such sets arise naturally in tensor-network expressions for classical strong simulation of quantum circuits. We prove a complexity dichotomy for such problems with an explicit tractability criterion. This extends the dichotomy for real-valued Holant problems, with the same four tractability conditions. Our proofs use Xia's projective binary group framework and quantum entanglement theory. The conjugate closure assumption precisely makes $k$-uniformity, directly applicable to the classification of Holant problems, by realizing reduced density matrices via Holant gadgets. We also use the classification of absolutely maximally entangled states to resolve a particular $6$-ary obstruction in our inductive proof of the \#P-hardness. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-14 in cs.CC). Categorie arXiv: Computational Complexity (cs.CC). Pagina del lavoro: https://arxiv.org/abs/2609.13132 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T03:50:48.482Z dalla pagina https://arxiv.org/catchup/cs.CC/2026-09-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).