Topological quantum computation is hyperbolic

01/03/2022

∙

by   Eric Samperton, et al.

∙

0

∙

share

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 one compiles are hyperbolic. Furthermore, the diagrams can be arranged to have additional nice properties, such as being alternating with minimal crossing number. 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.