Complexity classes as mathematical axioms. II

DOI10.4171/QT/75zbMath1336.68088arXiv1305.6076MaRDI QIDQ259630

Zhenghan Wang, Michael Hartley Freedman, Shawn Xingshan Cui

Publication date: 17 March 2016

Published in: Quantum Topology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.6076

zbMATH Keywords

Jones polynomialknot theorylink diagramcomplexity separation conjecturequantum complexity

Mathematics Subject Classification ID

Quantum computation (81P68) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (2)

Topological quantum computation is hyperbolic ⋮ Mathematics of topological quantum computing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Congruence subgroups and generalized Frobenius-Schur indicators
• Representation of links by braids: A new algorithm
• Fox's congruence classes and the quantum-\(SU(2)\) invariants of links in 3-manifolds
• Simulation of topological field theories by quantum computers
• A modular functor which is universal for quantum computation
• Invariants of 3-manifolds via link polynomials and quantum groups
• Congruence and quantum invariants of 3-manifolds
• Estimating Jones polynomials is a complete problem for one clean qubit
• Topological quantum computation
• A polynomial quantum algorithm for approximating the Jones polynomial

This page was built for publication: Complexity classes as mathematical axioms. II