Monodromy Analysis of the Computational Power of the Ising Topological Quantum Computer

DOI10.1063/1.3460174zbMath1210.81016arXiv0911.2591WikidataQ62124823 ScholiaQ62124823MaRDI QIDQ3079591

Andre Ahlbrecht, Lachezar S. Georgiev, Reinhard F. Werner

Publication date: 2 March 2011

Published in: AIP Conference Proceedings (Search for Journal in Brave)

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

zbMATH Keywords

braid groups; anyons; topological quantum computation

Mathematics Subject Classification ID

81P68: Quantum computation

20F36: Braid groups; Artin groups

82B20: Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics

58K10: Monodromy on manifolds

68Q12: Quantum algorithms and complexity in the theory of computing