Monodromy analysis of the computational power of the Ising topological quantum computer
Abstract
We show that all quantum gates which could be implemented by braiding of Ising anyons in the Ising topological quantum computer preserve the n-qubit Pauli group. Analyzing the structure of the Pauli group's centralizer, also known as the Clifford group, for n\geq 3 qubits, we prove that the image of the braid group is a non-trivial subgroup of the Clifford group and therefore not all Clifford gates could be implemented by braiding. We show explicitly the Clifford gates which cannot be realized by braiding estimating in this way the ultimate computational power of the Ising topological quantum computer.
Keywords
Cite
@article{arxiv.0911.2591,
title = {Monodromy analysis of the computational power of the Ising topological quantum computer},
author = {Andre Ahlbrecht and Lachezar S. Georgiev and Reinhard F. Werner},
journal= {arXiv preprint arXiv:0911.2591},
year = {2015}
}
Comments
10 pages, 2 figures and 1 table; v2: one more reference added and some typos corrected; Talk given at the VIII International Workshop "Lie Theory and its Applications in Physics", 15-21 June 2009, Varna, Bulgaria