Back to Search
Start Over
Monodromy Analysis of the Computational Power of the Ising Topological Quantum Computer.
- Source :
-
AIP Conference Proceedings . 6/18/2010, Vol. 1243 Issue 1, p279-288. 10p. 1 Diagram, 1 Chart, 1 Graph. - Publication Year :
- 2010
-
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≥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. [ABSTRACT FROM AUTHOR]
- Subjects :
- *MONODROMY groups
*GROUP theory
*QUANTUM computers
*ALGEBRA
*ARITHMETIC groups
Subjects
Details
- Language :
- English
- ISSN :
- 0094243X
- Volume :
- 1243
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- AIP Conference Proceedings
- Publication Type :
- Conference
- Accession number :
- 51526899
- Full Text :
- https://doi.org/10.1063/1.3460174