Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2503.02945

Help | Advanced Search

Mathematics > Quantum Algebra

arXiv:2503.02945 (math)
[Submitted on 4 Mar 2025 ]

Title: Towards a complexity-theoretic dichotomy for TQFT invariants

Title: 关于拓扑量子场论不变量的复杂性理论二分法

Authors:Nicolas Bridges (Purdue), Eric Samperton (Purdue)
Abstract: We show that for any fixed $(2+1)$-dimensional TQFT over $\mathbb{C}$ of either Turaev-Viro-Barrett-Westbury or Reshetikhin-Turaev type, the problem of (exactly) computing its invariants on closed 3-manifolds is either solvable in polynomial time, or else it is $\#\mathsf{P}$-hard to (exactly) contract certain tensors that are built from the TQFT's fusion category. Our proof is an application of a dichotomy result of Cai and Chen [J. ACM, 2017] concerning weighted constraint satisfaction problems over $\mathbb{C}$. We leave for future work the issue of reinterpreting the conditions of Cai and Chen that distinguish between the two cases (i.e. $\#\mathsf{P}$-hard tensor contractions vs. polynomial time invariants) in terms of fusion categories. We expect that with more effort, our reduction can be improved so that one gets a dichotomy directly for TQFTs' invariants of 3-manifolds rather than more general tensors built from the TQFT's fusion category.
Abstract: 我们证明了对于任何固定的定义在$\mathbb{C}$上的维度为$(2+1)$的拓扑量子场论(TQFT),无论是 Turaev-Viro-Barrett-Westbury 类型还是 Reshetikhin-Turaev 类型,在闭三维流形上精确计算其不变量的问题要么可以在多项式时间内解决,要么计算某些由该 TQFT 的融合范畴构造的张量的精确收缩问题是$\#\mathsf{P}$- 难的。 我们的证明是基于 Cai 和 Chen [J. ACM, 2017] 关于$\mathbb{C}$上带权约束满足问题的二分性结果的一个应用。 我们将重新解释 Cai 和 Chen 提出的区分两种情况(即$\#\mathsf{P}$- 难张量收缩与多项式时间不变量)的条件表述为融合范畴的工作留作未来研究。 我们预计通过更多努力,我们的归约可以改进,从而直接得到三维流形上的 TQFT 不变量的二分性,而不是更一般的由 TQFT 的融合范畴构建的张量的二分性。
Comments: 16 pages, 11 figures. Comments welcome!
Subjects: Quantum Algebra (math.QA) ; Computational Complexity (cs.CC); Geometric Topology (math.GT); Quantum Physics (quant-ph)
Cite as: arXiv:2503.02945 [math.QA]
  (or arXiv:2503.02945v1 [math.QA] for this version)
  https://doi.org/10.48550/arXiv.2503.02945
arXiv-issued DOI via DataCite

Submission history

From: Eric Samperton [view email]
[v1] Tue, 4 Mar 2025 19:05:46 UTC (23 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
math.QA
< prev   |   next >
new | recent | 2025-03
Change to browse by:
cs
cs.CC
math
math.GT
quant-ph

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号