Two paradigms for topological quantum computation
From MaRDI portal
Publication:3633641
Abstract: We present two paradigms relating algebraic, topological and quantum computational statistics for the topological model for quantum computation. In particular we suggest correspondences between the computational power of topological quantum computers, computational complexity of link invariants and images of braid group representations. While at least parts of these paradigms are well-known to experts, we provide supporting evidence for them in terms of recent results. We give a fairly comprehensive list of known examples and formulate two conjectures that would further support the paradigms.
Recommendations
Cited in
(12)- A finiteness property for braided fusion categories
- Simulation of topological field theories by quantum computers
- scientific article; zbMATH DE number 6667243 (Why is no real title available?)
- How hard is it to approximate the Jones polynomial?
- Mathematics of topological quantum computing
- Gravitational Topological Quantum Computation
- Integral metaplectic modular categories
- Generalisations of Hecke algebras from loop braid groups
- Finite cyclic quantum state machines: a topological perspective
- Quantum Fourier transforms and the complexity of link invariants for quantum doubles of finite groups
- Localization of unitary braid group representations
- Wavefunctions for topological quantum registers
This page was built for publication: Two paradigms for topological quantum computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3633641)