Topological quantum computation is hyperbolic
arXiv:2201.00857 · doi:10.1007/s00220-023-04713-w
Abstract
We show that a topological quantum computer based on the evaluation of a Witten-Reshetikhin-Turaev TQFT invariant of knots can always be arranged so that the knot diagrams with which one computes are diagrams of hyperbolic knots. The diagrams can even be arranged to have additional nice properties, such as being alternating with minimal crossing number. Moreover, the reduction is polynomially uniform in the self-braiding exponent of the coloring object. Various complexity-theoretic hardness results regarding the calculation of quantum invariants of knots follow as corollaries. In particular, we argue that the hyperbolic geometry of knots is unlikely to be useful for topological quantum computation.
arXiv comment12 pages. V4: Incorporated changes in response to referee reports
References in corpus (8)
- Simulation of topological field theories by quantum computers
- A Link Invariant from Quantum Dilogarithm
- The two-eigenvalue problem and density of Jones representation of braid groups
- The BQP-hardness of approximating the Jones Polynomial
- Bridge distance and plat projections
- Algorithms and complexity for Turaev-Viro invariants
- Complexity Classes as Mathematical Axioms II
- Coloring invariants of knots and links are often intractable